Serving schools, colleges & students across India Sign inRegister freeFAQsHelpcontact@ghosla.io
GHOSLAGrowth Hub for Opportunities, Skills, Learning & AchievementGrow•Learn•Achieve Login Get Started

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
  1. How placement coding rounds workFree preview10 min
  2. Big-O notation made simpleFree preview15 min
  3. Python features useful for DSA12 min
  4. Quiz: complexity6 min
Arrays and strings5 lectures
  1. Prefix sums16 min
  2. Two pointers18 min
  3. Sliding window18 min
  4. String manipulation patterns14 min
  5. Practice set: 15 array problems20 min
Hashing, stacks and queues4 lectures
  1. Dictionaries and sets for counting15 min
  2. Stack problems: brackets, next greater element15 min
  3. Queues and deque14 min
  4. Linked lists14 min
Recursion, searching and sorting5 lectures
  1. Thinking recursively16 min
  2. Binary search and its variations14 min
  3. Merge sort and quick sort15 min
  4. Backtracking basics14 min
  5. Quiz: recursion6 min
Trees and heaps3 lectures
  1. Binary trees and traversals16 min
  2. Binary search trees15 min
  3. Heaps with heapq14 min
Graphs4 lectures
  1. Representing graphs15 min
  2. BFS and DFS16 min
  3. Shortest paths with Dijkstra16 min
  4. Topological sort14 min
Dynamic programming4 lectures
  1. From recursion to memoisation16 min
  2. 1D DP problems16 min
  3. 2D DP: grids and strings18 min
  4. Practice set: 10 DP problems20 min
Test day strategy4 lectures
  1. Reading problems and finding edge cases10 min
  2. Topic-wise revision sheet10 min
  3. Mock coding round25 min
  4. 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