About Me

▼
Showing posts with label Amazon Interview. Show all posts
Showing posts with label Amazon Interview. Show all posts
Saturday, June 29, 2013

Print the objects of an array in the order of decreasing frequency. PS: Please make sure order of object should remain same

›
E.g. if array is of integer is given as   5 2 2 8 5 6 8 8, then we should get 8 8 8 5 5 2 2 6 , here freq. of 5 and 2 are same but 5 comes...
Wednesday, May 22, 2013

Given a sequence of n real numbers A(1) ... A(n), determine a contiguous subsequence A(i) ... A(j) for which the sum of elements in the subsequence is maximized

›
#include<stdio.h> #define MAX(a,b) ((a>b)?(a):(b)) main ( ) {   int arr [ ] = { - 2 , - 3 , 4 , - 1 , - 2 , 1 , 5 , - 3 } ; ...
3 comments:
Monday, April 8, 2013

Given a root of a tree, and an integer k. Print all the nodes which are at k distance from given elment

›
Monday, December 24, 2012

Count maximum number of "connected 1" in given matrix

›
you have a matrix of N x N filled with 1 or 0. you can move only 1 step either right or 1 step down. you need to count maximum number of ...
1 comment:
Friday, October 12, 2012

A legend among a group of n people is a person who is top rated in all respects.The task is to identify a legend by asking a single question of the form "who deserves it?" Design an efficient algorithm to identify a legend or determine if the group has no such person.How many questions does your algorithm need in the worst case??

›
Sunday, September 30, 2012

Convert Prefix expression to postfix expression

›
Wednesday, September 26, 2012

In a binary tree replace each node's value (except leaf node) with the sum of left and right subtree's value.

›
Monday, September 24, 2012

Write a function to convert Hexadecimal number (String) to Decimal Number (Int)

›
Sunday, September 23, 2012

Maximum Sum Subsequence in an unsorted array of size n

›
We are given an array A having n integers. What we want to find is a contiguous subseqnence (A[i], A[i+1], …, A[j]) such that the sum of ...
Sunday, September 2, 2012

Given list of words in the order as in the dictionary, find the order of the alphabets.

›
Example:   Suppose you are given words in the same order as in the dictionary like a, ant, ball, cat, do, dog, fog, frock etc. From thes...
Thursday, August 30, 2012

Given a array, find the largest contiguous sub-array having its sum equal to N.

›
We are given an array A having n integers. What we want to find is a contiguous subseqnence (A[i], A[i+1], …, A[j]) such that the sum of ...
Sunday, August 26, 2012

Given Preorder can you make BST from it then print the sorted output from BST

›
#include<iostream> #include<stdlib.h> using namespace std ;   typedef struct tree { int val ; struct tree * left ; ...

Given an array of length n, print all sub arrays of length r

›
Wednesday, August 22, 2012

Fill next with node pointers which represent Inorder Successor of every node in BSTin BST

›
You are given a function getInorderSuccessor which takes a BST (Binary Search Tree) as it's parameter. Every node has an extra pointer ...

Given a root of a tree, and an integer k. Print all the nodes which are at k distance from root.

›

you have to print all possible combination of a given length let's say 'k' of a string in lexicographic order.

›
for Example:- input String=az k=2; output aa az za zz..