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).
970an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
954Give 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.
1001an 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 ].
1025Post New Data Structures Questions
List the types of tree.
What are linked lists used for?
Can arraylist have null values?
What are the 3 types of measurement?
What is a bubble sort and how do you perform it?
Why is quicksort so fast?
What is the complexity of selection sort?
Why do we use different types of data structures?
What are the non linear data structure?
What is entryset method in map?
What are all the classes and interfaces that are available in the collections?
What is difference between capacity and size of arraylist?
What is data structure and its classification?
Is learning data structures necessary?
Explain the internal working of a hash map?
