Topics

• Getting started with C++
• Operators
• Returning several values from a function
• File I/O
• Function Overloading
• std::vector
• Graph
• Dynamic Programming
• The ISO C++ Standard
• Greedy Algorithms
• JOINS
• Bellman–Ford Algorithm
• Insertion Sort
• Substring Search
• Dijkstra’s Algorithm
• Trie (Prefix Tree/Radix Tree)
• Floyd-Warshall Algorithm
• Breadth-First Search
• Quicksort
• Depth First Search
• Knapsack Problem
• Counting Sort
• Prim's Algorithm
• Matrix Exponentiation
• Longest Common Subsequence
• Dynamic Time Warping
• Segment Tree
• Getting started with dynamic-programming
• Dynamic Time Warping
• Subsequence Related Algorithms
• Knapsack Problem
• Solving Graph Problems Using Dynamic Programming
• Matrix Chain Multiplication
• Weighted Activity Selection
• Coin Changing Problem

Examples

• Hello World
• Using Output Parameters
• Opening modes
• What is Function Overloading?
• Inserting Elements
• Iterating Over std::vector
• Accessing Elements
• Using std::vector as a C array
• Iterator/Pointer Invalidation
• Deleting Elements
• Finding an Element in std::vector
• vector<bool>: The Exception To So Many, So Many Rules
• Using struct
• Structured Bindings
• Using a Function Object Consumer
• Concatenating Vectors
• Reducing the Capacity of a Vector
• Return Type in Function Overloading
• Bitwise Operators
• Using Output Iterator
• Using a Sorted Vector for Fast Element Lookup
• Functions Returning Large Vectors
• Find max and min Element and Respective Index in a Vector
• Member Function cv-qualifier Overloading
• CROSS JOIN
• LEFT OUTER JOIN
• RIGHT OUTER JOIN
• FULL OUTER JOIN
• ANTIJOIN
• C++11
• Matrices Using Vectors
• Comments
• Dijkstra's Shortest Path Algorithm
• Introduction To Graph Theory
• Weighted Job Scheduling Algorithm
• Storing Graphs (Adjacency Matrix)
• Huffman Coding
• Introduction To Trie
• Longest Common Subsequence Explanation
• Implementation of Trie
• Single Source Shortest Path Algorithm (Given there is a negative cycle in a graph)
• Why do we need to relax all the edges at most (V-1) times
• Detecting Negative Cycle in a Graph
• Storing Graphs (Adjacency List)
• All Pair Shortest Path Algorithm
• Finding the Shortest Path from Source to other Nodes
• Finding Shortest Path from Source in a 2D graph
• Quicksort Basics
• Introduction To Depth-First Search
• Knapsack Problem Basics
• Counting Sort Basic Information
• Introduction To Prim's Algorithm
• Matrix Exponentiation to Solve Example Problems
• Introduction to Rabin-Karp Algorithm
• Introduction To Dynamic Time Warping
• Function
• Introduction To Knuth-Morris-Pratt (KMP) Algorithm
• Introduction To Segment Tree
• Implementation of Segment Tree Using Array
• Performing a Range Minimum Query
• Visibility of function prototypes and declarations
• Lazy Propagation
• Introduction To Dynamic Programming
• Introduction To Dynamic Time Warping
• Floyd-Warshall Algorithm
• Longest Common Subsequence
• Weighted Job Scheduling Algorithm
• 0-1 Knapsack Problem
• Understanding State in Dynamic Programming
• Constructing a DP Solution
• Minimum Vertex Cover
• Recursive Solution
• Longest Increasing Subsequence
• Longest Palindromic Subsequence
• Number of Ways to Get Total
• Minimum Number of Coins to Get Total