Interested to Buy Any Domain ? << Click Here >> for more details...
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
926an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
905Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
936an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
979Post New Data Structures Questions
List out the disadvantages of using a linked list?
Which is faster arraylist or linked list?
Define left-in threaded tree?
What is merge sort and how it works?
Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?
Which is the slowest sorting algorithm?
Which type of sorting is best?
How do I sort a hashmap key?
Is linked list faster than array?
What is the limit of arraylist?
What are the advantages and disadvantages of linked list over array?
What are the collision resolution methods?
How to reference all the elements in a one-dimension array?
Which is faster array or linked list?
Name few collections map implementations?
