Data Structures and Algorithms using C++

Learn basic types and loops in C++ by demonstrating modulus, unary operations, string concatenation, if and else, and for and while loops through a divisibles counting exercise.

Parse the 2d vector of characters (matrix), split words by spaces or row ends, record word lengths, then compute the minimum, maximum, and the net difference from the maximum.

Explore the standard template library's map, queue, priority queue, and stack in C++, with their key methods such as insert, count, erase, and iteration to build a task manager.

Explore queue operations, frequency mapping with a priority-based task processor, and a stack of processed tasks: insert tasks, track priority frequencies, process highest priority, and print processed tasks.

Explore array manipulation in c++ by computing the maximum running sum and its index, with demonstrations of running sums and two animation examples, last-two-product and battle power.

rotate an array in place by reversing the entire array, then reversing the first k elements and the remaining elements; uses an in-place two-pointer reversal.

Learn how prefix sums reveal zero-sum subarrays in an array, using a running total and a frequency map to count repeating sums and compute the result.

Convert a numeric string to an integer using a for loop and ASCII arithmetic, and transform vowels to indices while collecting digits and counting vowels.

learn to build a frequency map in c++ using a 26-element frequency vector and a map to tally lowercase letter counts, with index calculation by ch - 'a'.

Explore single pointer linked lists, measure size, remove the kth element by adjusting pointers, handle edge cases with size checks and k mod size, and delete nodes safely.

Explore multi-pointer techniques on linked lists, including detecting cycles with fast and slow pointers, locating the cycle start, removing the cycle, and reversing and printing the list.

Apply a recursive traversal from the root to sum all node values into a global variable, visiting left then root then right, yielding six for the sample tree.

Explore pre-order, in-order, and postorder traversals of a tree, tracing root, left, and right visits with depth-first search and recursion.

Explore breadth first search for binary trees by implementing level order traversal using a queue, processing nodes level by level and building a 2D vector result of each level.

Explore how binary search trees insert nodes and perform in-order traversal to produce sorted output, illustrated with a BST rooted at four and nodes two, six, one, three, five, seven.

Perform inorder traversal of a binary search tree by recursion and via an iterative stack approach, visiting left nodes, printing values, then traversing right to produce a sorted sequence.

Explore matrix manipulation by performing a spiral order traversal on a two-dimensional vector using a solution class, returning an array of numbers.

Explore a matrix graph pattern by using depth-first search to convert connected 1s into 2s in a two-dimensional grid, traversing in four directions with proper boundary checks.

Explore union find, a graph data structure, learning path compression and union and find operations to merge components and count connected components.

Learn to implement a DAG template with adjacency lists and indegree counting, using a BFS queue to produce a valid topological order of courses.

Explore dynamic programming templates for knapsack problems, defining states and transitions, applying sorting, and using memoization to implement an optimal coin change solution in C++.

Learn the dynamic programming pattern to compute the length of the longest common subsequence for two strings, using a memoized two-dimensional dynamic programming approach over index pairs and recursive transitions.

Explore the 2d grid pattern in dynamic programming by counting escape routes from a starting cell within a number of steps using dfs with memoization and four-direction moves, modulo 1e9-1.