Data Structures & Algorithms with C++
Data Structures & Algorithms with C++

A practical, problem-first Data Structures & Algorithms program using C++. Start with C++ fundamentals, then learn searching and sorting, strings, arrays, linked lists and recursion before progressing to graphs, trees and dynamic programming. Build problem-solving skills through pattern-based learning, dry runs, clean C++ code and hands-on live project work. No prior programming knowledge required.

₹9999₹499950% OFF
What is included
44 hours of live online learning across nine modules
Recordings available of all live classes
Hands-on live project
Certification and Letter of Recommendation
Dedicated doubt resolution sessions
Pattern-based learning with dry runs and clean C++ code
Graphs, trees and dynamic programming
Beginner friendly — no prior programming knowledge required
Certificate included

Data Structures & Algorithms with C++

Loading student count...

Hands-on live project
Certificate of completion
No Prerequisites
44 Hours of Content

Course Syllabus

Module 1: C++ Fundamentals

Just enough C++ to start solving problems — no prior coding needed. (5 hours)

  • Setup: compiler, VS Code, first program
  • Variables, data types & operators
  • Input / output with cin & cout
  • Conditionals & loops
  • Functions & parameter passing
  • Pointers & references basics
  • STL intro: vector, pair, map
  • Time & space complexity (Big-O)

Module 2: Searching & Sorting

Find fast, sort smart — the base of every interview. (5 hours)

  • Linear vs Binary Search
  • Binary Search on answer
  • Merge Sort
  • Quick Sort & partitioning
  • Heap Sort & heaps
  • Comparing sort complexities
  • STL sort & custom comparators
  • Stable & in-place sorting

Module 3: Strings

Text problems made simple — patterns you can reuse. (3 hours)

  • Strings in C++ (std::string)
  • Traversal & character counting
  • Palindromes & reversal
  • Anagrams & frequency arrays
  • Substrings & subsequences
  • Two-pointer technique
  • Sliding window on strings
  • Pattern matching basics

Module 4: Arrays

The most-asked topic — master it first. (4 hours)

  • Array basics & traversal
  • Prefix sum technique
  • Two pointers
  • Sliding window
  • Kadane's algorithm
  • Rotations & reversals
  • 2D arrays & matrices
  • Hashing with unordered_map

Module 5: Linked Lists

Pointers in action — think in nodes. (4 hours)

  • Singly linked list & node structure
  • Insert, delete & traverse
  • Reverse a linked list
  • Fast & slow pointers
  • Detect & remove a cycle
  • Merge two sorted lists
  • Middle node & nth from end
  • Doubly & circular lists

Module 6: Recursion

Think small, solve big — the key to trees and DP. (4 hours)

  • How recursion works: the call stack
  • Base case & recursive case
  • Recursion trees & dry runs
  • Time & space of recursion
  • Subsets & subsequences
  • Permutations
  • Backtracking basics
  • Classic: N-Queens

Module 7: Graphs

Model anything as nodes and edges — then solve it. (7 hours)

  • Graph basics & representation
  • BFS (Breadth-First Search)
  • DFS (Depth-First Search)
  • Topological Sorting
  • Shortest Paths: Dijkstra, Bellman-Ford
  • Minimum Spanning Trees: Prim, Kruskal
  • Cycle detection
  • Connected components

Module 8: Trees

Tree-based questions show up in almost every interview. (6 hours)

  • Binary Trees
  • Binary Search Trees (BST)
  • Tree Traversals
  • Level order traversal
  • Lowest Common Ancestor
  • Height, diameter & balance
  • Trees + recursion patterns
  • Tree-based problem solving

Module 9: Dynamic Programming

Turn slow recursion into fast, optimised solutions. (6 hours)

  • What is DP & when to use it
  • Overlapping subproblems
  • Memoization (top-down)
  • Tabulation (bottom-up)
  • Fibonacci & climbing stairs
  • 1D & 2D DP problems
  • Knapsack pattern
  • LCS, LIS & string DP
Enroll Now  ₹999950% OFF
₹4999
  • Get taught by industry experts having years of experience in their respective fields.
  • Hands-on live project
  • Mentor support and doubt clearing sessions.
  • Course completion certificate included.

₹1,000 pre-registration adjusted toward your fee

Frequently asked questions

What does the DSA course cover?
The course covers C++ Fundamentals, Searching & Sorting, Strings, Arrays, Linked Lists, Recursion, Graphs, Trees and Dynamic Programming across nine modules and 44 hours.
Do I need programming experience?
No prior programming knowledge is required. The course starts with C++ fundamentals.
What is the course fee?
The course fee is ₹4,999. Pay in full, choose ₹2,499 now and ₹2,500 one month later, or pre-register with ₹1,000 adjusted toward your fee. Course access unlocks after the first ₹2,499 on the installment plan. A valid DSA-specific coupon can change your final fee.
Are classes live?
Classes are held live online, with recordings and dedicated doubt-resolution support. The next batch is Upcoming, with 25 seats, following the same batch and seat rules as other Effilearn courses.
Does the course include projects or an internship?
The course includes hands-on live project work. It does not include a guaranteed internship.
What do I receive on completion?
A course completion certificate and Letter of Recommendation, under the same completion requirements as other Effilearn courses.
Which refund and cancellation policies apply?
The existing Effilearn Refund Policy and Cancellation Policy apply. Please review them using the links in the website footer before paying.
Data Structures & Algorithms with C++

Ready to transform your career? Join hundreds of successful students.

Reserve your seat with ₹1,000

whatsapp
whatsapp