Topic -5 

STACKS AND QUEUES

  1. Implement Stack from Scratch
  2.  Implement Queue from Scratch
  3. Check the expression has valid or Balanced parenthesis or not.
  4. Reverse a String using Stack
  5. Implement 2 stack in an array
  6. find the middle element of a stack
  7. Implement "N" stacks in an Array
  8. Design a Stack that supports get Min() in O(1) time and O(1) extra space.
  9. Find the next Greater element
  10. The celebrity Problem
  11. Reverse a stack using recursion
  12. Sort a Stack using recursion
  13. Arithmetic Expression evaluation
  14. Evaluation of Postfix expression
  15. Implement a method to insert an element at its bottom without using any other data structure.
  16. Merge Overlapping Intervals
  17. Largest rectangular Area in Histogram
  18. Length of the Longest Valid Substring
  19. Expression contains redundant bracket or not
  20. Implement Stack using Queue
  21. Implement Stack using Deque
  22. Stack Permutations (Check if an array is stack permutation of other)
  23. Implement Queue using Stack  
  24. Implement "n" queue in an array
  25. Implement a Circular queue
  26. LRU Cache Implementation
  27. Reverse a Queue using recursion
  28. Reverse the first “K” elements of a queue
  29. Interleave the first half of the queue with second half
  30. Find the first circular tour that visits all Petrol Pumps
  31. Minimum time required to rot all oranges
  32. Distance of nearest cell having 1 in a binary matrix
  33. First negative integer in every window of size “k”
  34. Check if all levels of two trees are anagrams or not.
  35. Sum of minimum and maximum elements of all subarrays of size “k”.
  36. Minimum sum of squares of character counts in a given string after removing “k” characters.
  37. Queue based approach or first non-repeating character in a stream.
  38. Next Smaller Element

Topic -6

LINKED LIST

  1. Write a Program to reverse the Linked List. (Both Iterative and recursive)
  2. *Reverse a Linked List in group of Given Size.
  3. Write a program to Detect loop in a linked list.
  4. Write a program to Delete loop in a linked list.
  5. Find the starting point of the loop. 
  6. Remove Duplicates in a sorted Linked List.
  7. Remove Duplicates in a Un-sorted Linked List.
  8. Write a Program to Move the last element to Front in a Linked List.
  9. Add “1” to a number represented as a Linked List.
  10. Add two numbers represented by linked lists.
  11. Intersection of two Sorted Linked List.
  12. Intersection Point of two Linked Lists.
  13. Merge Sort For Linked lists.
  14. Quicksort for Linked Lists.
  15. Find the middle Element of a linked list.
  16. Check if a linked list is a circular linked list.
  17. Split a Circular linked list into two halves.
  18. Write a Program to check whether the Singly Linked list is a palindrome or not.
  19. Deletion from a Circular Linked List.
  20. Reverse a Doubly Linked list.
  21. Find pairs with a given sum in a DLL.
  22. Count triplets in a sorted DLL whose sum is equal to given value “X”.
  23. Sort a “k” sorted Doubly Linked list.
  24. Rotate Doubly Linked list by N nodes.
  25. Rotate a Doubly Linked list in group of Given Size.
  26. Can we reverse a linked list in less than O(n) ?
  27. Why Quicksort is preferred for. Arrays and Merge Sort for Linked Lists ?
  28. Flatten a Linked List
  29. Sort a LL of 0's, 1's and 2's
  30. Clone a linked list with next and random pointer
  31. Merge K sorted Linked list
  32. Multiply 2 no. represented by LL
  33. Delete nodes which have a greater value on right side
  34. Segregate even and odd nodes in a Linked List
  35. Program for n’ th node from the end of a Linked List
  36. Find the first non-repeating character from a stream of characters


Note - Questions in red are most Important ones and asked many times.

            Questions in BLUE are important Algorithms to be Considered.

** If having any sort of problems while Solving do let us know in the Comments Section Below**

ONLINE COMPILER ---



Link to part-1 : Take me to part-1

Link to part-2 : Take me to Part-2