Skip to content
Start free
Menu
Opening soonWeek 1 freeIntermediate12 weeksWorks on a phone

DSA for Placements

Weekly problem sets and projects for campus placements.

What you'll be able to do

  • Analyse time and space complexity with Big-O
  • Solve array, string and hashing problems with standard patterns
  • Use recursion, sorting and binary search with confidence
  • Work with linked lists, stacks, queues, trees, heaps and graphs
  • Apply dynamic programming to classic interview problems

About this course

Twelve weeks of the data structures and algorithms that campus placement tests and technical interviews ask about. Each week has short explanations, a quiz, and a problem set scored automatically against hidden tests, plus small projects that use what you learned.

Week 1 is free.

You need: basic Python (variables, loops, functions and lists). Python Foundations covers it.

Week by week

The planned syllabus. Lessons appear here as each week is published.

  1. Week 1Big-O and arrays

    Time and space complexity, and array basics. Project: problem set 1, scored against hidden tests.

  2. Week 2Two pointers, prefix sums and sliding window

    Three patterns behind many array questions. Project: problem set 2.

  3. Week 3Strings and frequency maps

    String manipulation, counting, and anagram and palindrome patterns. Project: problem set 3.

  4. Week 4Hash maps and sets

    Hashing, fast lookups and classic hash-map problems. Project: problem set 4.

  5. Week 5Recursion and backtracking

    Thinking recursively, base cases and backtracking. Project: problem set 5.

  6. Week 6Sorting and binary search

    Sorting algorithms and binary search, including searching on the answer. Project: problem set 6.

  7. Week 7Linked lists

    Singly and doubly linked lists and pointer techniques. Project: an LRU cache.

  8. Week 8Stacks and queues

    Stacks, queues, deques and monotonic stacks. Project: an expression evaluator.

  9. Week 9Trees and binary search trees

    Traversals, recursion on trees and BST operations. Project: a file-system tree explorer.

  10. Week 10Heaps and greedy algorithms

    Priority queues and greedy choices. Project: a task scheduler.

  11. Week 11Graphs

    Graph representations, BFS, DFS and shortest paths. Project: a bus route finder.

  12. Week 12Dynamic programming

    Memoisation, tabulation and classic DP problems. Project: a timed mock placement test.

Questions

Is Week 1 really free?
Yes. Sign in and do Week 1’s lessons and quiz without paying.
Who scores my projects?
A published rubric, applied the same way to every learner on your own GitHub repository. No AI decides your score, and paying never changes it.
How long can I use it?
It's self-paced: your schedule is built from the time you have each day, and you keep access for as long as we offer the course.
What if it isn't for me?
Ask within 7 days of paying for a full refund, no questions asked. Refund policy

Not sure where to start?

Answer ten quick questions and we'll build a plan that fits your time, your level and your goal.

Build my free plan