Skip to Content
Coding (Legacy)

Coding Interview Preparation

Master data structures, algorithms, and problem-solving patterns essential for technical interviews at top companies.

🚧

Coming Soon

This section is under development. Content will be added soon.

Expected topics:

  • DSA Patterns (Sliding Window, Two Pointers, BFS/DFS)
  • Dynamic Programming Patterns
  • Graph Algorithms
  • Tree and Binary Search Tree Problems
  • LeetCode Solutions with Explanations
  • Concurrency and Multithreading
  • Language-Specific Idioms (Java, Go, Python)

Planned Categories

DSA Patterns

📋Planned

Core algorithmic patterns: sliding window, two pointers, BFS/DFS, and more.

ArraysTreesGraphsDP

LeetCode Solutions

📋Planned

Curated problem sets with detailed explanations and complexity analysis.

EasyMediumHardCompany Tags

Concurrency

📋Planned

Multithreading, locks, async patterns, and concurrent data structures.

ThreadsLocksAsync/AwaitRace Conditions

Language Specific

📋Planned

Java, Go, Python idioms and best practices for coding interviews.

Java StreamsGo ConcurrencyPython Collections

Problem-Solving Framework

When approaching coding problems:

  1. Understand – Clarify inputs, outputs, constraints, edge cases
  2. Plan – Think of approach before coding, consider time/space
  3. Implement – Write clean, readable code
  4. Test – Walk through examples, verify edge cases
  5. Optimize – Can you improve time or space complexity?

Time Complexity Cheat Sheet

ComplexityExample Operations
O(1)Hash table lookup, array access
O(log n)Binary search
O(n)Linear search, single loop
O(n log n)Efficient sorting (merge, quick)
O(n²)Nested loops, bubble sort
O(2ⁿ)Recursive subsets
O(n!)Permutations
Last updated on