Collection of interview questions with Unit Tests. Problems includes Data Structures, Logical and few Classical problems.

• Singly Linked List

  • N Element From Last
  • Middle Node
  • Detect Loop
  • Reverse Linked List

• Stack

  • Implement Queue Using Stack
  • Baseball Game
  • Find minimum in the Stack
  • Balanced Parenthesis
  • Postfix Expression Evaluation
  • Remove Consecutive Repeated Digits
  • Implement 2 Stacks using Single Array

• Queue

  • Weave
  • Reverse First K Elements of a Queue
  • Generate all Binary Numbers from 1 to N
  • Queue using Stack

• Doubly Linked List

• Trees

  • Binary Search Tree
    • Find k^th maximum in a BinarySearchTree
    • Find k^th minimum in a BinarySearchTree
    • Find Ancestors of a Node
    • Find Height of BST
    • Find k Nodes from Root of BST
  • Suffix Tree

• Anagrams
• Array Chunk
• Count Vowels
• Find 2 numbers that add upto N
• Find 2nd Maxinum from an Array
• FizzBuzz
• String Permutaions
• Get Subsequence
• Get Maze Path
• Get longest consecutive 1s
• Get Max Char
• Get Smallest Common Number
• Merge 2 Sorted Arrays
• Palindrome
• Product of Elements
• Remove Duplicates
• Reverse String
• Maximum Product of Three Numbers
• Next Greater for Every Element in an Array

• Binary Search

• LRU Cache

• A*

• Caeser Cipher
• Fibonacci

It's great to know that you want to contribute to this repo. Thanks for taking interest. Before you start, read the following carefully.

• When adding a new problem with solution

  • Take care of the filename convention (Very Important)
  • Problem statement should be there with examples
  • Make sure you add the Run Time complexity of your solution
  • Please take care of the segregation of the Problems as per the given Folder Structure
  • It's great if you can add the Unit Tests to verify your solutions as well
  • Strictly follow ESLINT rules

• When adding a Unit Test

  • Take care of the file name convention
  • Make sure CI (Travis) is passing

Keep an eye on this guide, it's subjected to change frequently.