← All courses
CS 310 · 4 credits
Algorithms
The LeetCode-readiness course. You finished Data Structures, and now you learn the algorithms and patterns interviews actually test: analysis in practice, binary search, sorting, two pointers, sliding window, prefix sums, recursion, backtracking, BFS and DFS, greedy, and dynamic programming. Every concept comes with runnable Python you execute and modify, and the course ends with a pattern-recognition checklist and a practice plan for the DSA platform.
Local progress0/30 lessons · 0%
What you'll learn
- ✓Compare two solutions by counting steps and reasoning about best case, worst case, and memory
- ✓Write binary search correctly, use bisect, and apply the binary-search-on-the-answer pattern
- ✓Explain how bubble sort, merge sort, and quicksort work, and use sorting as a setup step for harder problems
- ✓Solve array and string problems with two pointers and sliding windows
- ✓Use prefix sums, custom sort keys, and adjacency-list building as everyday setup moves
- ✓Write recursive functions with confidence, draw recursion trees, and speed them up with memoization
- ✓Generate subsets and permutations with backtracking
- ✓Traverse graphs and grids with BFS and DFS, and know when each one wins
- ✓Recognize greedy problems and avoid the classic greedy traps
- ✓Build 1-D and 2-D dynamic programming solutions, plus Dijkstra and topological sort
- ✓Walk into an interview with a pattern-recognition checklist and a practice plan
Unit 1Analysis in practice
Unit 2Searching
Unit 3Sorting
Unit 4Two pointers and sliding window
Unit 5Recursion from zero
Unit 6Backtracking
Unit 7BFS and DFS
Unit 8Greedy algorithms
Unit 9Dynamic programming I
Unit 10Dynamic programming II and graph algorithms
Unit 11Interview strategy capstone
Reviews
—
0 ratings
5
0
4
0
3
0
2
0
1
0
- No reviews yet.
Discussion
- No comments yet. Sign in to comment.