Interested to Buy Any Domain ? << Click Here >> for more details...
What is the time complexity of hashmap get () and put () method?
- 0 Answers
- 898 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
What is sorting and its types?
What is meant by binary tree?
What do you mean by 2-3-4 tree?
Does hashset guarantee order?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
Should I use hashmap or hashtable?
What is hash data type?
What method is used to place a value onto the top of a stack?
Can we increase the size of statically allocated array?
What is time complexity of quick sort?
Windows 
