Skip to main content

Misc

39. Find first non repeating character in a string.
40. Find whether two arrays of same size have same values.
41. Given a minheap find the max element.
42. Convert an array to heap.
43. Kth element in a Min heap.
44. implement a stack using heap.
45. Implement queue using heap.
46. Find union of k sorted list.
47. Merge the two heap.
48. Fibonocci with memorization/ Dynamic programming.
49. Find no of BST can be formed with n nodes.
50. Find no of legeal path between x and y which does not include ‘+’
A
- + - - +
- - - - -
+ - + + -
- - - - -
B

51. Find the largest common subsequence between two given strings.
52. Find the shortest common super sequence.
53. In a string, find the longest substring which is palindrome.
54. Find the maximum sum subarray without selecting two consecutive number.
55. optimal matrix chain multiplication.
56. Generate binary sequence of constant ‘N’.
57. Given an array generate all the possibilities of array.
58. Given an array generate the permutation of array.
59. Given an array generate the combination of array.
60. Find distinct partitions of a number i.e. for 3(1,1,1)(1,2)
61. In a matrix find the largest square with all 1’s
0 0 0 0 1
0 1 1 0 1
0 0 1 0 1
1 1 0 0 1
0 1 1 1 0

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node is parent/grand parent of other. order should be O(1). tag root as 0 , tag left child as 00 , right child as 01. left child's left child as 000 , left's child's right child as 001 ... and so on. now let input be tags t1 and t2 if( (t1 == (t2>>1)) || (t2==(t1>>1))) return child parent relationship if( (t1 == (t2>>2)) || (t2==(t1>>2))) return child grand-parent relationship ... This solution can take a lot of space as the three grows. We can tag the node by number .. Root -0 1 -2-3-4 SO given two node get their tags.. Get Max of both t1, t2. Go for parent of that node if other node then return or check for parent of parent and check again for other node. With 2^32 value avaialable for indexing ..u wont run out of values.