## SDE1 Interview Questions

- 1of 1 vote
Design multiple stacks in a Single one big int array as efficient as possible ( real world example multiple process function stacks creation and deletion in memory of linux os )

- 0of 0 votes
What happens when you enter URL in browser.

- 0of 0 votes
Write a program to convert a decimal number into binary your code should work on both big endian and small endian machine. U have given a variable which tell u whether machine is big endian or small endian

- 0of 0 votes
U have given 10 files each having 1 million integer in sorted order, physical memory have size of 3 million suggest method to extract 1 million integer in sorted form efficiently.

- 0of 0 votes
Given a graph, if we were to print all nodes within k hops of a given node, which algorithm would we use, the answer to this was obviously a Breadth first search. He followed it up asking, if one were to use Depth first search instead to code this problem instead, one would encounter bloated running times for Graphs with certain attributes (Perhaps Dense graphs or some such). Describe what types of graphs would a DFS algorithm falter with and why.

- 0of 0 votes
Given a floor of dimensions 2 x W and tiles of dimensions 2 x 1, write code to find the number of ways the floor can be tiled.

- 1of 1 vote
You are given a sequence of black and white horses, and a set of k stables numbered 1 to k. You have to accommodate the horses into the stables in such a way that the following conditions are satisfied:

a. You fill the horses into the stables preserving the order of horses. For instance, you cannot put for horse 1 into stable 2 and horse 2 into stable 1. You have to preserve the ordering of horses.

b. No stable should be empty and No horse should be left unaccommodated.

c. Take the product (number of white horses * number of black horses) for each stable and take the sum of all these products. This value should be the minimum among all possible accommodation arrangements.

- 1of 1 vote
Print permutations of a string.

I started with the recursive answer. He asked me the complexity. (Had no idea). But is was large

Then he asked me, if i could optimise it. I said i could sense this can be done using DP. Could not get how to do it though.

I had quick perm code, but dint understand it(saw it night prev to interview) so dint answer that.

- 0of 0 votes
implement bool isFactorialDivisible( int x, int y)

Return true if x! is divisible by y

else return false

- 0of 0 votes
MsExcel columns has a pattern like

A B C … Z

AA AB AC…. AZ BA BB … ZZ

AAA AAB

A has code 1

Z has code 26

AA has code 27

AAA has code 626

given a number return a column name as string

- 0of 0 votes
Given a continuous stream of strings, maintain strings such that duplicate are eliminated on the fly. The interviewer wanted working code. So coded the solution during the interview and emailed it to him 10 mins after.

So if you get “Ted”, “John”, “Mark”, “Ted”, “David”, at the moment in

time, the list should contain John, Mark, David

- 0of 0 votes
Foo was not amongst the most brilliant students of his class. So, he has some pending exams to clear. As the exams are approaching, this time he vowed to pass in all of them. This will only happen if he is not under stress. Foo's stress can be calculated using a simple function called Foo_function which depends upon the time for which Foo studies continuously .

Foo_funtion is defined as follows:

F(t)=A(t^3)+B(t^2)+C*(t)+D, F(t)<=10^18

where A,B,C,D belong to the set of prime numbers. t is the time in minutes for which foo studies continuously.

As foo is not very good at solving cubic equations, he seeks your help to find out the maximum number of minutes for which he can study continuously without taking stress. Help him find t such that F(t+1) > K, and F(t) <= K, where K is the maximum stress Foo can bear.

Input:

The first line of the input contains a single integer T denoting the number of test cases. each test case consists of a single line containing 5 space seperated positive numbers a, b, c, d, K.

Output:

for each test case, output a single integer t denoting the maximum time for which foo can study continuously without taking stress.

Constraints:

1 <= T <= 10^4

A, B, C, D belong to a set of prime numbers such that F(t) would never exceed 10^18

t >= 0

1 <= K <= 10^18

Sample Input (Plaintext Link)

2

2 2 2 2 10

2 3 5 7 1000

Sample Output (Plaintext Link)

1

7

Explanation

In the 1st test case for t = 2 foo will be under stress because F(2)=30 > K, therefore he can study for a maximum time of 1 minute without having stress.

In the 2nd test case for t = 8 foo will be under stess because F(8)=1263 > K, therefore he can study for a maximum time of 7 minutes continuously without having stress.

Time Limit 5 sec(s) (Time limit is for each input file.)

Memory Limit256 MB

Source Limit1024 KB

- -1of 1 vote
Given a integer N, print the decimal form of 1/2n.

Example:

N=1, print 0.5

N=2, print 0.25

Adding leading/unsignificant zeroes will lead to wrong answer. Example, printing 0.50 instead of 0.5 in above case will lead to wrong answer.

Input and Output:

First line contains T, the number of testcases. Each testcase consists of N in one line.

Print required answer in one line for each testcase.

Constraints:

1 ≤ T ≤ 100

1 ≤ N ≤ 200

Sample Input (Plaintext Link)

2

2

1

Sample Output (Plaintext Link)

0.25

0.5

Explanation

You need to print output in decimal form only. There is no limit on number of decimal digits in output.

So correct output of 100 will be "0.0000000000000000000000000000007888609052210118054117285652827862296732064351090230047702789306640625"

Time Limit1 sec(s) (Time limit is for each input file.)

Memory Limit256 MB

Source Limit1024 KB

- 0of 2 votes
Use smart ways to find prime factors and then arrive at the result for large A & B in input. Bruteforce won't work.

Given A,B print the number of pairs (a,b) such that GCD(a,b)=1 and 1<=a<=A and 1<=b<=B.

Input:

First line contains an integer T, the number of testcases. Each of next T lines contains two space separated integers denoting Aand B.

Output:

Output T lines, each containing single integer, the required output for each test-case.

Constraints:

1 <= T <= 10

1 <= A <= 10^5

1 <= B <= 10^5

Sample Input (Plaintext Link)

1

3 2

Sample Output (Plaintext Link)

5

Explanation

1,1

1,2

2,1

3,1

3,2

Time Limit5 sec(s) (Time limit is for each input file.)

Memory Limit256 MB

Source Limit1024 KB

- 1of 1 vote
Given a BST, find out the minimum length form root to leaf with sum S. Note that:

a) Path from root to leaf node.

b) Sum of node of the path is S.

c) if multiple such path exist, print minimum length path.

d) What is advantage of BST rather than BT used for this algorithm, how it improve the performance. in BST, is it required to explore both side ?

- 1of 1 vote
You have given M array each of size n all array are sorted separately write a program to make a big sorted array of size m*n . during discussion he told me to prove many lemma like height of tree is log(n)( for n elements) sum of n natural number is (n*n+1)/2 and many more. He modified problem many times don’t use extra space do it in space etc.

- 1of 1 vote
Write a program to convert a decimal number into binary your code should work on both big endian and small endian machine. U have given a variable which tell u whether machine is big endian or small endian

- 0of 0 votes
U have given 10 files and you have given a string suggest data structure which ll facilitate efficient search of string in the file if string appears more than ones in that case u have to print line number and file in which they appear.

- 4of 6 votes
You are given a sequence of black and white horses, and a set of k stables numbered 1 to k. You have to accommodate the horses into the stables in such a way that the following conditions are satisfied:

a. You fill the horses into the stables preserving the order of horses. For instance, you cannot put for horse 1 into stable 2 and horse 2 into stable 1. You have to preserve the ordering of horses.

b. No stable should be empty and No horse should be left unaccommodated.

c. Take the product (number of white horses * number of black horses) for each stable and take the sum of all these products. This value should be the minimum among all possible accommodation arrangements.

- 2of 2 votes
Given a floor of dimensions 2 x W and tiles of dimensions 2 x 1, write code to find the number of ways the floor can be tiled. Any suggession for this?

- 0of 0 votes
Let's say a website attracts a lot of traffic . How would you find at what instant of time (milliseconds or seconds , assume as you want) the traffic was super high ? What data structure would you go for and why ?

- -3of 3 votes
Draw a graph as a graph. Assume there is graphics library to draw lines and all. Just tell how will you order the vertices such that the edges don't intersect and they seem ordered.

- 0of 2 votes
Need to implement something like pastebin wherein you paste some text, you are given an url. The url can be used anywhere to access the text.

Various problems, features and design of this architecture were discussed.

- 0of 0 votes
There are N lanes, and the speed of each lane is given. There are many cars in all the lanes and the start position and the length of each car and its corresponding lane is given. There is a frog which an do 2 functions: wait() or jump().

Find if there is a path for the frog to go from lane 1 to lane N without getting hit by any of the moving cars.

- 0of 0 votes
You are given very huge file , with each line containing a single word. We have to give the count and word which is repeated most. I answer of using TRIE data structure to hold the word. I am reading a word at a time and incrementing the counter if i am getting the same word. I am keeping a global max count to keep the max count and the word. Complexity will be O(total letters in the file);

- 0of 0 votes
Given a binary search tree (BST) with each node having some value. You have to compute for each node the summation of all nodes whose value is greater than the current node.I have used the DFS kind of algorithm.

`Dictionary<node,bool> visited = new Dictionary<node,bool>(); int Traverse(node n ) { if(node.Right == null) if(node.Left != null && !visited(node.Left)) Traverse(node.Left); return node.value; node.Summation = Traverse(node.Right); if(node.Left != null && !visited(node.Left)) Traverse(node.Left); return node.Value + node.Summation; }`

- 0of 0 votes
Given a table of the form:

1 A,B,C,A,B

2 A,B,A,A,A

3 C,D,C

Give the number of duplicate characters, eg: for 1 there are 2 A's and 2 B's, so the result is 2

For 2 A is repeated 4 times so the result is 3

For 3, C is repeated twice so the result is 1

My suggestion was to use a CLRSQL function to calculate it

- 0of 0 votes
Provided a number dictionary and a number, x , which is formed from the number dictionary. Find the rank of the number x? Rank is defined as the position of the number x when all the number formed from the dictionary are sorted.

Example

Input :{4,1,5}

X : 451

Output : 4

(145,154,415,451,514,541). 451 comes at 4th position

- 0of 0 votes
Write a binary search function in C that will work for any datatype. You cannot accept the datatype in the function arguments.

- 0of 0 votes
write a program to generate random numbers without using the in-built functions?