C++ Algorithms & Data Structures

Welcome to the C++ Algorithms & Data Structures repository! 💻

This repository contains 272 C++ source files covering algorithms, data structures, dynamic programming, graph theory, recursion, sorting/searching, OOP concepts, and problem-solving exercises.

About

This repository is intended for learning, practicing, and experimenting with C++ programming. It is suitable for beginners, intermediate coders, and anyone preparing for coding interviews or competitive programming.

Topics covered include:

• Graph Algorithms (BFS, DFS, Dijkstra, Bellman-Ford, Kruskal, Tarjan, Kosaraju, etc.)
• Sorting & Searching Algorithms
• Recursion & Dynamic Programming
• Binary Trees, Binary Search Trees & Heaps
• Object-Oriented Programming (OOP) Examples
• Linked Lists, Queues, Stacks
• String Manipulation & Pattern Problems
• Games, Interactive Programs, and Utility Programs

C++ Scripts Index

• ARRANGE-Arranging Amplifiers

• Abstract Class

• Add 1 to Number Represented by List

• Area of Shapes

• Articulation Point using Tarjans Algo

• BFS Graph using Queue

• BFS of Binary Tree

• Bank Menu

• Bellman-Ford Algorithm

• Binary Search Tree

• Binary Tree

• Bloom Filter

• Bubble Sort

• Bucket or Bin Sort

• Car Game

• Catalan Number DP

• Chatbot

• Check Bipartite Graph using Coloring

• Check Bipartite Graph using 2 colors BFS

• Check Bipartite Graph using 2 colors

• Check for Path More Than K Length from Source

• Check if Directed Graph is Connected

• Check if Undirected Graph is Connected

• Check if a Graph is Tree

• Check if All Levels of Two Trees are Anagrams

• Check if it is Possible to Survive on Island

• Check if Strings are Rotations

• Check if Number is Square

• Circle

• Coin Change Problem Greedy Algo

• Coin Change Problem Least Coins DP

• Coin Change Problem Number of Ways DP

• Color Circle

• Conflicting Appointments

• Connected Components of Graph

• Construct BST from Preorder

• Construct Binary Tree from Bracket String

• Constructor Example

• Constructor Overloading

• Constructors

• Container Class

• Convert BST to Balanced BST

• Count Triplets in Sorted DLL with Sum Equal to X

• Currency Converter

• Cut-Bridge or Critical Point using Tarjans Algo

• DEQueue using Array

• DFS Graph using Recursion

• DFS Graph using Stack

• DFS of Binary Tree

• Decimal to Binary

• Defense of Kingdom DEFKIN

• Deletion from Circular Linked List

• Destructor

• Destructor in Inheritance

• Detect Cycle in Directed Graph using BFS KHANS ALGO

• Detect Cycle in Directed Graph using DFS

• Detect Cycle in Undirected Graph using BFS

• Detect Cycle in Undirected Graph using DFS

• Detect Negative Weight Cycle in Graph

• Diagonal Traversal of Binary Tree

• Diameter of Tree

• DieHard

• Dijkstras Algorithm

• Directed Graph Matrix

• Disjoint Set DS Optimized

• Disjoint Set Data Structure

• Double Hashing

• Duplicates in Array

• Dutch National Flag / 3-way Partition SEAGATE

• Elements Between 2 Levels in Binary Tree

• Elements Between 2 Levels in Binary Tree using Queue

• Encode String with Count of Letters

• Euler Graph Check

• Expression Contains Redundant Bracket or Not

• Expression Tree

• Extra

• Factorial DP Bottom-up

• Factorial DP Top-down

• Factorial Improved

• Fibonacci Improved

• Fibonacci DP Bottom-up

• Fibonacci DP Top-down

• Find Duplicate Characters in String

• Find Duplicates in Array

• Find Maximum Meetings in One Room Greedy

• Find Maximum Sum Possible Equal Sum of Three Stacks

• Find Whether it is Possible to Finish All Tasks from Dependencies

• First Node of Loop in List

• Flatten BST to a List

• Flatten BST to a Sorted List

• Floyd Warshall Algo DP

• Frequency of Elements of Array

• Friend Class Example

• Friend Function Example

• Friend Function of Other Class Example

• Function Overloading

• GERGOVIA Wine Trading

• Generic Trees

• Graph Adjacency List

• Graph Adjacency List using Class

• Graph Matrix

• Graph Coloring

• Graphs

• Hamiltonian Path

• Hashing Separate Chaining

• Heap and Heap Sort

• Hierarchical Inheritance

• Huffman Coding Algorithm

• Huffman Data Compression

• Hybrid Inheritance

• Inorder Traversal Iterative

• Insertion Sort

• Insertion at the End of Stack

• Interleave First Half of Queue with Second Half

• K Smallest or Largest Elements in Array

• K Smallest or Largest Elements in Array HEAP

• K to Power n

• Kadane's Algorithm

• Khans Algorithm Topological Sorting BFS

• Knapsack Problem 0-1 DP

• Knapsack Problem Fractional Greedy

• Knapsack Problem Unbounded DP

• Kosaraju Algorithm

• Kruskal's Algorithm

• Kth Ancestor of a Node in BT

• Largest BST in Binary Tree

• Largest Subtree Sum in a Tree

• Last and Second Last

• Linear Probing

• Linked List

• Longest Common Subsequence DP

• Longest Common Subsequence Brute Force

• Longest Increasing Subsequence DP

• Longest Increasing Substring DP

• Longest Palindromic Sequence DP

• Longest Path Length in DAG DP

• Longest Path in DAG from Source to Each Vertex

• M-coloring Problem

• Matrix Chain Multiplication DP

• Max of Three

• Maximum Stocks if i Stocks Bought on i-th Day

• Maximum Distance Array

• Maximum Level Sum of Binary Tree

• Maximum Product Subset of an Array

• Maximum Size Square Matrix DP

• Maximum Sum of Absolute Difference of Any Permutation

• Maximum Sum of Non-adjacent Nodes of BT

• Maximum Sum Rectangle in 2D Matrix DP

• Maximum Trains for Which Stoppage Can Be Provided

• Maximum Level Sum of Binary Tree (Typo)

• Median of BST without Extra Space

• Median of Two Sorted Arrays D&C

• Merge Overlapping Intervals

• Merge Sort Array

• Merge Sort List Pointers

• Merge Sort List

• Merge Two Balanced BSTs

• Minimum Cost to Cut Board into Squares

• Minimum Edit Distance DP

• Minimum Edges to Reverse to Make Path from Source to Destination

• Minimum Number of Squares DP

• Minimum Sum of Absolute Difference of Pairs of Two Arrays

• Minimum Swap to Convert Binary Tree to BST

• Minimum Time Taken by Each Job in DAG

• Mirror of Binary Tree

• Monk and Class Marks

• Moore Voting Algorithm

• Move Last Element of Linked List to Front

• Multi-level Inheritance

• Multiple Inheritance

• Next Smaller Element

• Next Smallest Element

• Number of Components in Graph

• Optimal Binary Search Tree DP

• Optimal Merge Pattern

• Optimal Strategy Game DP

• Optimal Number of Jump Path DP

• Pairs with Given Sum in Doubly Linked List

• Parametrized Constructor in Inheritance

• Parametrized Constructor in Multiple Inheritance

• Partition Problem DP

• Password Strength Checker

• Perfect Number

• Pickup Chicks

• Postorder Traversal Iterative 1 STACK

• Postorder Traversal Iterative 2 STACK

• Preorder Traversal Iterative

• Prims Algorithm MST

• Print All K-sum Paths in BT

• Print All Paths from One Vertex to Other

• Print Longest Subsequence

• Print Path from One Vertex to Other

• Print Unique Strings

• Program for Shortest Job First

• Project Euler Multiples of 3 or 5

• Quadratic Probing

• Queue Linked List

• Queue using 2 Stacks

• Queue using Array

• Queue using Circular Array

• Queue using Circular Linked List

• Quick Sort

• Quiz Game

• README

• Rearrange Array a1-b1-a2-b2

• Rearrange Queue by Interleaving

• Remove Duplicates from String

• Replace Element with Greatest Element on its Right

• Replace Spaces in String

• Reverse DLL in Groups of Given Size

• Reverse a Stack using Recursion

• Reverse n Elements of Queue

• Reverse Words in String

• Rotate DLL by N Nodes

• Row Column Sorted Array

• Second Largest Element in Array

• Second Maximum of Three

• Selection Sort

• Separate Even Odd

• Separate Pos and Neg in Array 2 Pointer

• Separate Pos and Neg in Array Partition

• Shuffle Array a1-b1-a2-b2

• Single-level Inheritance Private

• Single-level Inheritance Public

• Sliding Window Substring Problem

• Smallest and Largest Element in Array

• Smallest Subset with Sum Greater Than All Other Elements

• Separate Pos and Neg in Array 2 Pointer

• Separate Pos and Neg in Array Partition

• Shuffle Array a1-b1-a2-b2

• Single-level Inheritance Private

• Single-level Inheritance Public

• Sliding Window Substring Problem

• Smallest and Largest Element in Array

• Smallest Subset with Sum Greater Than All Other Elements

• Snake Ladder

• Sort a K Sorted DLL

• Square

• Square of Number

• Stack Queue using DEQueue of Linked List

• Stack and Queue using DEQueue STL

• Stack Using Class

• Stack with Operations on Middle Element

• Static Function Example

• Stock Buy-Sell Problem

• String Match Brute Force

• String Match KMP Algorithm

• String Match Rabin-Karp Algo

• String Permutations

• String is Shuffled Substring of Another String

• String is Valid Shuffle of 2 Strings

• String Reverse Without Temp Variable

• Subset Sum Target DP

• Successive Pair in Stack

• Sum

• Sum2

• Sum of Min and Max Elements of All Subarrays of Size K

• Tarjans Algorithm

• Ternary Search Tree

• Thread

• Threaded Binary Tree

• Tiling 2xn DP

• Tiling 2xn Recursion

• Tiling m xn DP

• Tiling m xn Recursion

• Top View of Binary Tree

• Topological Sorting DFS

• Topological Sorting BFS

• Travelling Salesman Problem

• Trie

• Type of Eulerian Graph

• Weighted Graph

• Weird Numbers

• Zig-Zag View of Tree O(n)

• Zig-zag Array using Flag

• Zig-zag Array using Sorting

• N Prime Numbers

• Zig Zag Pattern

Getting Started

1. Clone the repository

git clone https://github.com/<your-username>/<repo-name>.git
cd <repo-name>

2. Compile & Run a C++ Program

g++ -std=c++17 ProgramName.cpp -o ProgramName
./ProgramName

Example:

g++ -std=c++17 Fibonacci_DP--Bottom-up.cpp -o Fibonacci_DP
./Fibonacci_DP

Contributing

Contributions are welcome! Fork the repo, create a branch, and open a pull request with your changes.

Happy Coding! 🚀