Intermediate level Programming and Algorithms

Data Structures and Algorithms in Python

Learn the data structures and algorithms behind fast software by implementing them yourself in Python: complexity, hashing, stacks, queues, trees, heaps, sorting and graphs, with tests and benchmarks.

  • 40hours of work
  • 19parts
  • Reviewedcapstone
  • Lifetimeaccess
  • Data structures
  • Algorithms
  • Big-O analysis
  • Recursion
  • Graph traversal
  • Python testing

At a glance

Who it is for

Learners who can already write Python functions, loops and classes and want a solid grounding in data structures and algorithms for interviews, university courses and real engineering work.

Before you start

Comfortable Python (functions, lists, dictionaries, classes) and a working Python 3.10+ setup with pytest. If you have finished Python Programming: Build Command-Line Tools and Games, you are ready.

How you finish

Pass the quizzes and labs, then submit a capstone project. The NIBVEDA team reviews it and either accepts it or sends it back with comments you can act on.

What you will be able to do

  1. 01Analyse the time and space cost of code using Big-O reasoning and measure it with benchmarks
  2. 02Choose and implement arrays, hash tables, stacks, queues, linked lists, trees, heaps and graphs
  3. 03Write and compare sorting and searching algorithms, including recursion
  4. 04Solve problems with two pointers, sliding windows, hashing, BFS and DFS
  5. 05Test algorithms thoroughly and document the trade-offs of your choices

Curriculum 40 hours in 19 parts

Select a kind to highlight its parts.

Stage 1A complexity detective and benchmark report7 parts · 11 h
  1. 1
    Why algorithms matter, and how to measure themLesson · Short, focused reading with questions to check yourself.
    1 hFree
  2. 2
    Arrays, strings and the two-pointer ideaLesson · Short, focused reading with questions to check yourself.
    1 h
  3. 3
    Two pointers and sliding windowsWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  4. 4
    Hash tables: dictionaries and setsLesson · Short, focused reading with questions to check yourself.
    1 h
  5. 5
    Solving problems with hash tablesWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  6. 6
    Check yourself: complexity, arrays and hashingQuiz · Twelve questions, marked at once, with the reason behind each answer.
    1 h
  7. 7
    A complexity detective and benchmark reportLab · Hands-on work. Many labs are checked automatically against what must exist.
    3 h
Stage 2A sorting and searching library with tests6 parts · 10 h
  1. 8
    Stacks, queues and linked listsLesson · Short, focused reading with questions to check yourself.
    1 h
  2. 9
    Build a stack, a queue and a linked listWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  3. 10
    Recursion, searching and sortingLesson · Short, focused reading with questions to check yourself.
    1 h
  4. 11
    Implement and compare sorting and searchingWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  5. 12
    Check yourself: stacks, queues, recursion and sortingQuiz · Twelve questions, marked at once, with the reason behind each answer.
    1 h
  6. 13
    A sorting and searching library with testsLab · Hands-on work. Many labs are checked automatically against what must exist.
    3 h
Stage 3Graph algorithms, a maze solver and a course planner4 parts · 8 h
  1. 14
    Binary trees, search trees and heapsWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  2. 15
    Graphs, BFS and DFSWorkshop · Follow along and build, with the steps and the traps written out.
    2 h
  3. 16
    Check yourself: trees, heaps and graphsQuiz · Twelve questions, marked at once, with the reason behind each answer.
    1 h
  4. 17
    Graph algorithms, a maze solver and a course plannerLab · Hands-on work. Many labs are checked automatically against what must exist.
    3 h
Stage 4An LRU cache and a priority scheduler1 part · 3 h
  1. 18
    An LRU cache and a priority schedulerLab · Hands-on work. Many labs are checked automatically against what must exist.
    3 h
FinishCapstone project1 part · 8 h
  1. 19
    A documented algorithms and data structures libraryCapstone · A full project for your portfolio.
    8 h
Free lessonWhy algorithms matter, and how to measure them
What you take away

An internship certificate with your skills on it.

Made for you automatically when you finish the last part, it names the internship programme, the level and the 40 hours, lists what you showed, and carries a number and a QR code. Anyone can check it on the NIBVEDA verification page, and it shows as withdrawn there if it is ever revoked.

  • Proof you completed all 40 hours of this internship programme
  • An Internship badge for your profile, CV or portfolio
  • Not a job, a stipend or an academic degree, and it says so
More in Programming and Algorithms

Keep building.

3 programmes in this track, from beginner to expert. Buy the learning path and save 15%.

BeginnerBeginner40 h Build Command-Line Tools and Games

Learn Python from scratch by building real programs: a unit converter, a to-do manager with saved data, a tested module and a text game, finishing with a command-line application of your own.

  • Python
  • Problem solving
  • Functions and modules
Rs. 249 + GST
ExpertExpert40 h Advanced Algorithms and Problem Solving

Master the techniques behind hard problems: dynamic programming, greedy proofs, shortest paths and spanning trees, advanced data structures, backtracking and string algorithms, ending with an algorithm-engineering project with benchmarks.

  • Dynamic programming
  • Graph algorithms
  • Algorithm design
Rs. 999 + GST

See all 3 programmes in Programming and Algorithms Take the placement test

Before you enrol

Quick answers.

The policies have the full detail.

Is this a real internship?

It is a virtual internship programme: a structured, self-paced course built around a real project, with checked assessments and a certificate. It is not employment, it does not carry a stipend and it is not an academic or AICTE-approved qualification. What it gives you is verified, project-based evidence of skills.

How does self-paced work?

You start when you like and move at your own speed. Each part unlocks when you finish the one before it. There are no live classes and no deadlines. Your access is shown on each programme page.

How is my work checked?

Quizzes are marked as soon as you submit them. Labs use a tick-list of tasks. Intermediate and Expert programmes finish with a capstone that the NIBVEDA team reviews and either accepts or sends back with comments.

Can I get a refund?

Please read the refund policy before you buy. It explains when a refund is possible.

Ready to start?

Rs. 706.82 including GST. Lifetime access. Read the first lesson free before you decide.