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.
946an 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 are the collision resolution methods?
Which sort algorithm is best?
Is unordered_map a hash table?
What is two-dimensional array?
What is the need for priority queue?
What is meant by arraylist?
What are different techniques for making hash function?
How will you check the validity of an expression containing nested parentheses?
How many types of sorting algorithms are there?
Are linked lists considered linear or non-linear data structure?
How is the front of the queue calculated ?
What is the difference between data types and data structures?
Is array a data type?
What are the Differences between map and hashmap?
How to reverse a linked list iterative algorithm?
