Q.1:- How will you implement Linked list with 1 million nodes? How will you access 999999th node?
Q.2:- Clone a linked list with next and random pointer.
Q.3:-Serialise and Deserialise a linked list with next and random pointer.
Q.4:-Given two sorted array(with repetitive elements) find kth minimum number from both array.
Q.5:-Given two linked list both represent a number.Create a linked list that create its sum.
Q.6:-Given a binary search tree, print the path which has sum equal to k and has minimum hopes.i.e. if there are multiple paths with the sum equal to k then print the path with minimum number of nodes.
Q.7:-Given an array, arrange the elements such that the number formed by concatenating the elements is highest.
Q.8:-Given an string find the longest sub string which is palindrome.
Q.9:-How would you create your own hash function?
Q.10:-How would you implement red-black tree?
Q.11:-Tell me what you think about Google Charging users $1 per month to use Gmail.
Q.2:- Clone a linked list with next and random pointer.
Q.3:-Serialise and Deserialise a linked list with next and random pointer.
Q.4:-Given two sorted array(with repetitive elements) find kth minimum number from both array.
Q.5:-Given two linked list both represent a number.Create a linked list that create its sum.
Q.6:-Given a binary search tree, print the path which has sum equal to k and has minimum hopes.i.e. if there are multiple paths with the sum equal to k then print the path with minimum number of nodes.
Q.7:-Given an array, arrange the elements such that the number formed by concatenating the elements is highest.
E.g.: input = [9, 93, 24, 6], the output should be: [9,93,6,24]. This is because if you concatenate all the numbers, 993624 is the highest number that can be formed. Q.8:-Given an string find the longest sub string which is palindrome.
Q.9:-How would you create your own hash function?
Q.10:-How would you implement red-black tree?
Q.11:-Tell me what you think about Google Charging users $1 per month to use Gmail.
No comments:
Post a Comment