Learners who are comfortable with data structures (trees, heaps, graphs, recursion) and want to solve hard problems, prepare for demanding technical interviews and contests, or build performance-critical software.
Expert level
Programming and Algorithms
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.
- 40hours of work
- 19parts
- Reviewedcapstone
- Lifetimeaccess
- Dynamic programming
- Graph algorithms
- Algorithm design
- Backtracking
- String algorithms
- Performance benchmarking
At a glance
Solid Python and the content of Data Structures and Algorithms in Python (Big-O, hash tables, trees, heaps, BFS and DFS, sorting). You should be able to implement a heap and BFS without looking them up.
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
- 01Design algorithms with dynamic programming, greedy choices, divide and conquer and backtracking, and argue that they are correct
- 02Implement shortest-path, spanning-tree and union-find algorithms and choose between them by cost
- 03Use tries, Fenwick trees and monotonic structures to answer queries efficiently
- 04Recognise hard (NP-hard) problems and apply pruning, approximation or heuristics
- 05Benchmark and report on competing algorithms like an engineer
Curriculum 40 hours in 19 parts
Select a kind to highlight its parts.
Stage 1A dynamic programming toolkit7 parts · 11 h
- 1Algorithm design paradigms and proving correctnessLesson · Short, focused reading with questions to check yourself.1 hFree
- 2Dynamic programmingLesson · Short, focused reading with questions to check yourself.1 h
- 3Dynamic programming problemsWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 4Greedy algorithms and their proofsLesson · Short, focused reading with questions to check yourself.1 h
- 5Greedy problems and Huffman codingWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 6Check yourself: dynamic programming and greedy algorithmsQuiz · Twelve questions, marked at once, with the reason behind each answer.1 h
- 7A dynamic programming toolkitLab · Hands-on work. Many labs are checked automatically against what must exist.3 h
Stage 2A weighted route planner with Dijkstra and A*6 parts · 10 h
- 8Shortest paths and minimum spanning treesLesson · Short, focused reading with questions to check yourself.1 h
- 9Dijkstra, Kruskal and union-findWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 10Advanced data structures: tries, Fenwick trees and monotonic stacksLesson · Short, focused reading with questions to check yourself.1 h
- 11Autocomplete and range queriesWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 12Check yourself: shortest paths, spanning trees and advanced structuresQuiz · Twelve questions, marked at once, with the reason behind each answer.1 h
- 13A weighted route planner with Dijkstra and A*Lab · Hands-on work. Many labs are checked automatically against what must exist.3 h
Stage 3A constraint solver for Sudoku and N-Queens4 parts · 8 h
- 14Backtracking, pruning and searchWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 15String matching and hard problemsWorkshop · Follow along and build, with the steps and the traps written out.2 h
- 16Check yourself: backtracking, strings and hard problemsQuiz · Twelve questions, marked at once, with the reason behind each answer.1 h
- 17A constraint solver for Sudoku and N-QueensLab · Hands-on work. Many labs are checked automatically against what must exist.3 h
Stage 4A timed problem-solving set with write-ups1 part · 3 h
- 18A timed problem-solving set with write-upsLab · Hands-on work. Many labs are checked automatically against what must exist.3 h
FinishCapstone project1 part · 8 h
- 19An algorithm engineering projectCapstone · A full project for your portfolio.8 h
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
Keep building.
3 programmes in this track, from beginner to expert. Buy the learning path and save 15%.
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.
- Data structures
- Algorithms
- Big-O analysis
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
See all 3 programmes in Programming and Algorithms Take the placement test
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. 1,178.82 including GST. Lifetime access. Read the first lesson free before you decide.