DSA in Python for Campus Placements
Arrays to graphs with patterns that appear in Indian placement coding rounds, solved step by step
Ghosla Academy · Coding Team
This course teaches data structures and algorithms through patterns rather than memorised solutions. Each topic starts with the idea, moves to a dry run on paper and ends with Python code and practice problems typical of online assessments. We also prepare you for the test day itself: reading problem statements carefully, handling edge cases, managing time and explaining your approach clearly in a technical interview.
What you will be able to do
- Analyse time and space complexity with Big-O
- Solve array and string problems with two pointers and sliding window
- Use hashing, stacks, queues and linked lists confidently
- Apply recursion, binary search and sorting techniques
- Work with trees, heaps and graphs (BFS, DFS, shortest path)
- Approach dynamic programming problems with a repeatable method
What you build
- Personal solved-problems tracker with 100 classified questions
- Timed mock coding round (3 problems, 90 minutes)
What you need to start
- Python basics: loops, functions, lists, dictionaries
- A laptop with Python 3 installed
Curriculum · 8 sections, 33 lectures
Foundations4 lectures
- How placement coding rounds workFree preview10 min
- Big-O notation made simpleFree preview15 min
- Python features useful for DSA12 min
- Quiz: complexity6 min
Arrays and strings5 lectures
- Prefix sums16 min
- Two pointers18 min
- Sliding window18 min
- String manipulation patterns14 min
- Practice set: 15 array problems20 min
Hashing, stacks and queues4 lectures
- Dictionaries and sets for counting15 min
- Stack problems: brackets, next greater element15 min
- Queues and deque14 min
- Linked lists14 min
Recursion, searching and sorting5 lectures
- Thinking recursively16 min
- Binary search and its variations14 min
- Merge sort and quick sort15 min
- Backtracking basics14 min
- Quiz: recursion6 min
Trees and heaps3 lectures
- Binary trees and traversals16 min
- Binary search trees15 min
- Heaps with heapq14 min
Graphs4 lectures
- Representing graphs15 min
- BFS and DFS16 min
- Shortest paths with Dijkstra16 min
- Topological sort14 min
Dynamic programming4 lectures
- From recursion to memoisation16 min
- 1D DP problems16 min
- 2D DP: grids and strings18 min
- Practice set: 10 DP problems20 min
Test day strategy4 lectures
- Reading problems and finding edge cases10 min
- Topic-wise revision sheet10 min
- Mock coding round25 min
- Explaining your solution in interviews8 min
Who this is for
- Pre-final and final year students preparing for placements
- Freshers preparing for service and product company coding tests
- Self-taught programmers who want structured DSA practice