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

Two numbers with minimum difference

Find the two numbers whose difference is minimum among the set of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, 4, 19 The algorithm should return min diff = 20-19 = 1. Make an efficient algorithm, yeah best could be O(n). Not sure if i could use DP here, will post a solution tommorow. Let me know if you find a answer. Algorithm:MiniMumDiffN Get the size of array , say n. Get the range of array, range. Bucket Sort the above array. Search the above sorted array for minimum difference. This will be the minimum difference numbers. Now question comes where the range of above given array is very big. Algorithm:DivideArray Take an random element. Search for its position in array. Return the index of element. Algorithm:MiniMumDiff if array_range > MAXRANGE int mid = divideArray (arr,start,end); d1,max1 = MiniMumDiff( arr,start,mid-1); d2,max2 = MiniMumDIff(arr,mid+1,end); d3 = difference max1 and arr[mid] d4 = difference max2 and arr[mid] return minimum( d1,d2...

Merge two sorted array inplace

Given an integer array of which both first half and second half are sorted. Write a function to merge the two parts to create one single sorted array in place [do not use any extra space]. e.g. If input array is [1,3,6,8,-5,-2,3,8] It should be converted to: [-5,-2,1,3,3,6,8,8]