What is mergesort and hashtable?
How do we find duplicate elements in an array?
What sorting algorithm does arrays sort use?
Write an algorithm to check if there is a loop in a doubly linked list.
Is quicksort faster than merge sort?
How do I sort hashset?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
Two linked lists are given, find out the sum of them without altering the linked list?
What is the height of a binary tree?
Where will be the free node available while inserting a new node in a linked list?
How do I start preparing for placement?
How many sorting algorithms are there?
What is the difference between one and two dimensional?
Can treemap have null values?
What is the difference between hashmap and treemap?