By the end of this course, you will be able to solve those advanced level problems which are frequently asked in those coding interviews. So give your engineering career the head start it deserves!

What will you learn ?

• Accelerate your algorithmic thinking
• Become a 10x Problem Solver
• Sliding Window, Hashing, Maps & Sets
• Master Dynamic Programming & Graphs
• 150+ carefully curated problems
• Learn to write complex codes

• Arrays and Vectors

  View Details
• • Introduction to arrays and vectors in C++ programming
  • Working with arrays and vectors: insertion, deletion, and manipulation
  • Advanced techniques for arrays and vectors, such as binary search and dynamic programming

• String Implementation

  View Details
• • Introduction to strings in C++ programming
  • Manipulating and processing strings: concatenation, comparison, and conversion
  • Advanced techniques for string processing, such as regular expressions and pattern matching

• Sliding Windows Problems

  View Details
• • Introduction to the sliding window algorithm and its applications
  • Solving problems using the sliding window technique: finding maximum/minimum, counting elements, and substring problems
  • Advanced techniques for sliding window problems, such as two pointers and prefix sums

• Searching and sorting

  View Details
• • Introduction to searching and sorting algorithms: linear search, binary search, selection sort, insertion sort, and merge sort
  • Analysis of time and space complexity of searching and sorting algorithms
  • Advanced techniques for searching and sorting, such as quicksort and heap sort

• Recursion Problems

  View Details
• • Introduction to recursion and its applications
  • Solving problems using recursion: factorial, Fibonacci, and tree traversal
  • Advanced techniques for recursion problems, such as memoization and backtracking

• Linked list problems

  View Details
• • Introduction to linked lists and their implementation in C++ programming
  • Working with linked lists: insertion, deletion, and manipulation
  • Advanced techniques for linked list problems, such as two pointers and cycle detection

• Binary tree Problems

  View Details
• • Introduction to binary trees and their traversal algorithms: preorder, inorder, and postorder
  • Working with binary trees: insertion, deletion, and manipulation
  • Advanced techniques for binary tree problems, such as binary search trees and balanced trees

• Hashing Problems

  View Details
• • Introduction to hashing and its applications
  • Solving problems using hashing: counting elements, finding duplicates, and pattern matching
  • Advanced techniques for hashing problems, such as hash tables and collision resolution strategies

• Dynamic Programming (1D)

  View Details
• • Introduction to dynamic programming and its applications
  • Solving problems using 1D dynamic programming: coin change, knapsack, and rod cutting
  • Advanced techniques for 1D dynamic programming, such as state space compression and bit masking

• Dynamic Programming(2D)

  View Details
• • Solving problems using 2D dynamic programming: longest common subsequence, matrix chain multiplication, and edit distance
  • Advanced techniques for 2D dynamic programming, such as matrix exponentiation and bitset optimization

• Project

  View Details
• • Collaborative coding projects to apply learned concepts
  • Implementing real-world scenarios and problem-solving