ash0x0 / interviews

Interview prep and study material

Websites

Exercise

• HackerRank
• LeetCode
• Aonecode

Answers

• TutorialCup

Tutorials

• Visualgo.net

Coaching & Preparation

• AlgoExpert
• InterviewGenie
• InterviewKickstart
• AlgoMonster

Informational

• TeamBlind

General

• Lexicographical order
• Evenly divisible
• Arithmetic loop-around

Cryptography

• Caesar Cipher

Compression

• Huffman coding

Data Structures

Binary Trees

Traversal

Programiz

• In-order - LNR (Left Node Right)
  • Visit all nodes in left subtree
  • Visit root/current node
  • Visit all nodes in right subtree
• Pre-order - NLR (Node Left Right)
  • Visit root/current node
  • Visit all nodes in the left subtree
  • Visit all nodes in the right subtree
• Post-order - LRN (Left Right Node)
  • Visit all nodes in the left subtree
  • Visit all nodes in the right subtree
  • Visit root/current node
• Reverse In-order - RNL (Right Node Left)
  • Visit all nodes in right subtree
  • Visit root/current node
  • Visit all nodes in left subtree
• Reverse Pre-order - NRL (Node Right Left)
  • Visit root/current node
  • Visit all nodes in the right subtree
  • Visit all nodes in the left subtree
• Reverse Post-order - RLN (Right Left Node)
  • Visit all nodes in the right subtree
  • Visit all nodes in the left subtree
  • Visit root/current node

Search

• Breadth-first Search (BFS)
• Depth-first Search (DFS)
• Lowest Common Ancestor (LCA)