Skip to content

Latest commit

 

History

History
105 lines (84 loc) · 3.17 KB

README.md

File metadata and controls

105 lines (84 loc) · 3.17 KB

Computer Science problems in .NET.

Problem areas

  • Fast Fourier Transform
  • Sliding Window and Two Pointer
  • Greedy (Mostly Sorting)
  • Binary Search on Answer
  • All Combinations/Permutations/Ways
  • K Smallest / K Largest → Heaps
  • Prefix/Suffix/Word Search → Tries
  • Graph - DFS / BFS
  • Topological Sort
  • Bitwise XOR
  • Tree - DFS/BFS
  • Slow and Fast Pointers - LinkedList
  • Parenthesis Problems - Stack
  • DP - Knapsack Problem

Interview Timeline:

✅Build a strong foundation (WEEKS 1-4)

🎯 Focus on the most frequently asked topics:

  • Arrays: Prefix sum, sliding window problems.
  • Strings: Two-pointer technique, pattern matching.
  • Linked Lists: Reversal, cycle detection.
  • Stacks/Queues: Monotonic stacks, bracket problems. 🎯 Resources:
  • Neetcode 150 for a structured problem set.
  • Cracking the Coding Interview: Chapters 1-4 for basics.
  • Take U Forward (YouTube): Great explanation for each video.
  • GFG: Topic-wise problems with solutions.

✅Practice Problems Strategically (WEEKS 5-12)

🎯 Tackle problems in three stages:

  • Stage 1: Solve 50 easy problems to get comfortable.
  • Stage 2: Solve 75 medium problems, focusing on optimization.
  • Stage 3: Solve 15 hard problems if targeting FAANG.

🎯 Platforms to Practice:

  • LeetCode: Sort by difficulty or tags (arrays, DP). and contests
  • HackerRank: For warm-ups and hirimg contests.

✅ Master Core Algorithms and Data Structures (WEEKS 13-16)

🎯Key Focus Areas:

  • Binary Search: Search in rotated arrays, peak elements.
  • Recursion and Backtracking: Subsets, permutations, Sudoku solver.
  • Dynamic Programming:
  • Classic problems like Fibonacci, Knapsack, LIS.
  • Understand bottom-up and top-down approaches.
  • Trees and Graphs:
  • BFS/DFS traversal, shortest path (Dijkstra).

🎯 Resources:

  • Neetcode Playlists: Trees, DP, and Graphs.
  • Tushar Roy YouTube Channel: Algorithm deep dives.
  • LeetCode Discussion Forums: Optimized solutions and hints.

✅ Learn System Design Basics (WEEKS 17-20)

🎯 What to Focus On:

  • Scalability: Load balancing, horizontal scaling.
  • Caching: Strategies like LRU cache.
  • Databases: SQL VS. NOSQL, partitioning, sharding.
  • Design Patterns: Singleton, Observer, Factory.

🎯 Resources:

  • System Design Primer (GitHub): Beginner to advanced.
  • Grokking the System Design Interview: Simplified concepts.
  • Designing Data-Intensive Applications: Real-world system insights.

✅ Mock Interviews and Communication (WEEKS 21-24)

🎯 What to Do:

  • Pair up with peers or mentors for mock interviews.

🎯 Use platforms:

  • Pramp: Peer-to-peer interviews.
  • InterviewBit: Mock interviews with industry experts.
  • Record yourself solving problems and analyze

✅ Behavioral Questions (ONGOING)

🎯 What to Expect:

  • Questions around teamwork, challenges, and problem-solving.
  • Example:
  • Tell me about a time you resolved a conflict in a team.
  • How do you prioritize tasks under tight deadlines?

🎯 How to Prepare:

  • Use the STAR method: Situation, Task, Action, Result.
  • Focus on stories that highlight leadership, impact, and learning.
  • Mock practice with peers or record yourself.

🎯 Resources:

  • Big Interview (Behavioral Prep): Comprehensive practice.
  • Google common behavioral interview questions.