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

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server.  To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...