Data Structures Interview Questions in Java
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.

`Data Structures

DataStructures Interview Questions

  1. Reverse a Linked List -
  2. Get Square Root of a given number -
  3. Count Occurance of a given number in sorted array -
  4. Finding GCD of two numbers -
  5. Print all valid combinations of groups of parenthesis -
  6. Convert a double number to rational -
  7. String Permutation -
  8. Find the 1st index of a given number in a sorted array allowing duplicates -
  9. Verify if a binary tree is a Binary Search Tree (BST) -
  10. Print BTree in pre order, post order, in order and level order -
  11. Verify if a string is a rotated palindrome -
  12. Print all pairs in a sorted array that sum to M -
  13. Use stack (LIFO) to simulate queue (FIFO) -
  14. There are two sorted arrays. First one is of size m+n containing only m elements. Another one is of size n and contains n elements. Merge these two arrays into the first array of size m+n such that the output is sorted -
  15. Verify if strings are rotations of each other or not -
  16. To design a tiny URL or URL shortener -
  17. Write a Pseudo code to parse a String and and evaluate expressions -
  18. Code to find number of ways to cover n stairs when you can take 1 or 2 step at a time -
  19. Generic implementation of BlockingQueue -
  20. Simple thread pool implementation in Java -
  21. Merge an array of size n into another array of size m+n -
  22. Given a number n, print all primes smaller than or equal to n -
  23. Print BTree is spiral order -
  24. Given an array of positive integers, arrange the numbers to form the largest possible number -
  25. Give a circle with center (0,0) and a radius r (integer > 0), find the number of points (x,y) on the circumference such that x and y both are integers -
  26. Find if a given Singly Linked list is a palindrome or not -