0% found this document useful (0 votes)
4 views5 pages

DSA Coding Interview Course

The 'Crack the Coding Interview in 6 Weeks' course is a structured program starting on August 4, 2025, focusing on data structures and algorithms (DSA) with a weekly format of concept teaching and problem-solving. Each week covers different topics such as arrays, binary search, linked lists, hash tables, recursion, and graphs, along with student presentations to reinforce learning. The course aims to build strong foundations in DSA concepts, master coding patterns, and prepare participants for technical interviews by solving over 75 curated LeetCode problems.

Uploaded by

rasad2735
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views5 pages

DSA Coding Interview Course

The 'Crack the Coding Interview in 6 Weeks' course is a structured program starting on August 4, 2025, focusing on data structures and algorithms (DSA) with a weekly format of concept teaching and problem-solving. Each week covers different topics such as arrays, binary search, linked lists, hash tables, recursion, and graphs, along with student presentations to reinforce learning. The course aims to build strong foundations in DSA concepts, master coding patterns, and prepare participants for technical interviews by solving over 75 curated LeetCode problems.

Uploaded by

rasad2735
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

📘 Crack the Coding Interview in 6 Weeks: DSA +

Pattern-Based Prep
🗓 Duration: 6 Weeks​
📍 Start Date: August 4, 2025​
🎓 Trainers: Eesha Tariq, Abdul Rafay
⏱ Weekly Format:

●​ Mon–Thu: Concept teaching + 2–3 LeetCode problems (live solving)​

●​ Fri: Student presentations (1 concept + problem explained)​

✅ Week 1: Arrays, Strings & Two Pointers (Beginner


Foundation)
Patterns Covered: Arrays, Strings, Two Pointers

Day Topic LeetCode Problems

Mon Arrays Basics + 1480. Running Sum, 283. Move Zeroes, 26. Remove
Practice Duplicates, 169. Majority Element (Q1)

Tue String Manipulation 125. Valid Palindrome, 344. Reverse String, 14. Longest
Common Prefix, 242. Valid Anagram (STR3)

Wed Two Pointer 167. Two Sum II, 27. Remove Element, 11. Container with
Technique Most Water (Q8), 15. 3Sum (Q10)

Thu Real-world 121. Best Time to Buy and Sell Stock (Q5), 118. Pascal's
Interview Arrays Triangle, 53. Maximum Subarray (Q22)

Fri Student Arrays/String or 2-pointer problem explained by students


Presentations
✅ Week 2: Binary Search + Sorting Techniques
Patterns Covered: Binary Search, Sorting, Searching

Day Topic LeetCode Problems

Mon Binary Search 704. Binary Search, 35. Search Insert Position, 33. Search in
Basics Rotated Sorted Array (BS1)

Tue Search Variants 34. First and Last Position, 852. Peak Index (BS2), 74. Search a
2D Matrix (Q12)

Wed Advanced 69. Sqrt(x), 744. Smallest Letter, 875. Koko Eating Bananas,
Variants 410. Split Array Largest Sum (Painter’s Partition - BS5)

Thu Sorting 912. Sort an Array, 147. Insertion Sort List, 75. Sort Colors (Q9),
Fundamentals 88. Merge Sorted Array (Q3)

Fri Student Binary Search Variant / Sorting problem


Presentations

✅ Week 3: Linked Lists + Stack & Queue


Patterns Covered: Linked List Tricks, Stacks, Queues

Day Topic LeetCode Problems

Mon Linked List Basics 206. Reverse LL, 876. Middle of LL, 21. Merge LL, 141.
Linked List Cycle (Q5)

Tue Linked List Variants 234. Palindrome LL, 142. Detect Cycle, 138. Copy List
with Random Pointer (LL8)
Wed Stack Operations & 20. Valid Parentheses, 739. Daily Temperatures, 496. Next
NGE Greater Element I (SQ3)

Thu Queue Use Cases & 994. Rotting Oranges (SQ13), 286. Walls and Gates, 542.
BFS Prep 01 Matrix

Fri Student Presentations LL/Stack/Queue Problem and Walkthrough

✅ Week 4: Hash Tables + Sliding Window


Patterns Covered: Hash Maps, Frequency Counting, Sliding Window

Day Topic LeetCode Problems

Mon Hash Maps & 1. Two Sum, 383. Ransom Note, 13. Roman to Int, 136.
Frequencies Single Number (Q4)

Tue Anagrams & Character 242. Valid Anagram, 49. Group Anagrams, 49. Group
Counting Anagrams (STR8)

Wed Sliding Window Basics 3. Longest Substring Without Repeat (Q15), 567.
Permutation in String (STR6)

Thu Advanced Window + 76. Minimum Window Substring (STR9), 438. Find All
HashMap Use Anagrams, 560. Subarray Sum Equals K (Q19)

Fri Student Presentations Sliding window or hashing-related problems

✅ Week 5: Recursion, Backtracking & Divide &


Conquer
Patterns Covered: Recursion, Backtracking, Subsets, Merging
Day Topic LeetCode Problems

Mon Recursion Basics 509. Fibonacci, 344. Reverse String, 50. Pow(x, n) (Q7)

Tue Backtracking - 78. Subsets, 90. Subsets II, 131. Palindrome Partitioning
Subsets (RB3)

Wed Backtracking 46. Permutations, 39. Combination Sum (RB1), 22. Generate
Advanced Parentheses

Thu Merge Sort + Recap 21. Merge Two Sorted Lists, Count Inversions (Q21), 56.
Merge Intervals (Q14)

Fri Student Recursive/backtracking trace & explanation


Presentations

✅ Week 6: Graphs + Dynamic Programming


Patterns Covered: BFS, DFS, Tabulation, Memoization

Day Topic LeetCode Problems

Mon Graph Traversal (BFS + 200. Number of Islands, 133. Clone Graph
DFS)

Tue Cycle Detection & 207. Course Schedule, 785. Is Graph Bipartite, 797. All
Toposort Paths From Source to Target

Wed DP Basics + 70. Climbing Stairs, 198. House Robber


Memoization

Thu Tabulation + Advanced 322. Coin Change, 53. Maximum Subarray (Q22), 300.
Problems Longest Increasing Subsequence

Fri Student Presentations Graph/DP concept with real interview question


🎯 Course Takeaways & Goals
●​ Build strong foundations in core DSA concepts: arrays, strings, recursion,
backtracking, sorting, searching, graphs, DP, etc.​

●​ Master the 10 most frequently asked coding patterns to recognize and apply
optimal solutions in interviews.​

●​ Solve over 75+ curated LeetCode problems, including real company-tagged


questions.​

●​ Develop problem-solving strategies through concept breakdowns and live


walk-throughs.​

●​ Practice presenting algorithms — a key skill for technical interviews.​

●​ Gain confidence to crack product-based interviews and coding assessments.​

●​ Graduate with a structured roadmap to continue your DSA prep independently.​

This course is designed not just to teach you syntax — but to help you think like a problem
solver.

You might also like