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).
929an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
908Give 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.
943an 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 ].
982Post New Data Structures Questions
what is a balanced tree.
What are the Advantages and disadvantages of Array?
How to inverting a function in sort and searching?
Tell me about the different sorting techniques.
Write a Program for Insert in a sorted list
What do you mean by data types?
What is a graph?
how to add an item to the beginning of the list?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
Differentiate between priorityqueue and treeset.
What is stack and its operations?
Which type of memory allocation is referred for linked list?
What is two-dimensional array?
What are the different types of linked list?
What is a static structure?
