Omega Notation in Algorithm Analysis – Omega Notation Examples – Omega Notation Problems
Asymptotic Notations Asymptotic notations are mathematical tools to describe the efficiency of algorithms in terms of input size n. They […]
Data Structures and Algorithms
This category contains posts about Data Structures and Algorithms.
Asymptotic Notation Big o omega theta – Big o Notation in Data Structure – Asymptotic Bounds
Asymptotic Notations Asymptotic notations are mathematical tools to describe the efficiency of algorithms in terms of input size n. They
Reverse Polish Notation (RPN) – Reverse Polish Notation using stack – Reverse Polish Notation in Data Structure
🔁 Reverse Polish Notation (RPN) Definition:Reverse Polish Notation (RPN), also called postfix notation, is a mathematical notation in which operators
Prefix to Postfix conversion using stack – DSA Course – Playlist in C++ – Coding With Clicks
✅ Prefix to Postfix Conversion 💡 Rules: 🧠 Example: Prefix: + A * B C Steps: ✅ Postfix: A B
Prefix to Infix conversion using stack – DSA Course Playlist in C++ – Coding With Clicks
✅ Prefix to Infix Conversion 💡 Rules: 🧠 Example: Prefix: + A * B C Steps: ✅ Infix: (A +
Evaluation of Prefix and Postfix Expressions using stack – DSA Course playlist in C++
🔧 Evaluation Methods by Notation: Notation Evaluation Method Needs Stack? Infix Convert using precedence rules ❌ (uses parsing trees, not
Infix to prefix conversion example – Infix to prefix conversion using stack – DSA Course Playlist
✅ Step-by-Step: Infix to Prefix Conversion 📘 Goal: Convert an expression like (A + B) * C into * +
Infix to Postfix conversion rules using stack | Infix to Postfix conversion using stack | Step by Step | Example | DSA Course Playlist
✅ Step-by-Step: Infix to Postfix Conversion Rules: 🔑 Parentheses Are Not Operators Even though parentheses control precedence, they are not
Infix, Prefix and Postfix Expressions in Data Structure | Infix, Prefix and Postfix Notation | Coding With Clicks
Evaluation of Expressions Expression evaluation refers to the process of computing the result of a given mathematical or logical expression.
Expression Evaluation in Data Structures | Operators, Precedence & Boolean Logic Explained!
✅ What is Expression Evaluation? Expression evaluation is the process of calculating the result of a mathematical or logical expression.
Tower of Hanoi Algorithm | Tower of Hanoi problem in Data Structure | Tower of Hanoi Recursive Solution | Tower of Hanoi C++
🧠 1. What is Backtracking? Backtracking is a problem-solving technique used to build up a solution incrementally and remove those
Indirect Recursion & Nested Recursion in Data Structure | McCarthy 91 function | Recursion Playlist C++ | Coding With Clicks
🔁 Indirect Recursion 📖 Definition: Indirect recursion occurs when two or more functions call each other in a cycle. 📌
Tail vs Non Tail Recursion – Recursion Playlist C++ – Recursion Types in Data Structure
🔁 What is Recursion? Recursion is when a function calls itself to solve a smaller subproblem. 🧠 Tail Recursion vs
Tail Recursion in Data Structure – Tail Call Optimization – Recursion Types in Data Structure
🔁 What is Recursion? Recursion is when a function calls itself to solve a smaller subproblem. 🧠 Tail Recursion vs
Iteration and Recursion in Data Structure – Iteration and Recursion Difference – Coding With Clicks
🔁 Iteration Definition: Iteration is the process of repeatedly executing a set of instructions using loops like for, while, or
Quadratic Probing Hash Table – Quadratic Probing Collision – Quadratic Probing in Data Structures
Quadratic Probing – Explanation with Example Quadratic Probing is a collision resolution technique used in open addressing. Instead of checking
Linear Probing Hash Table – Linear Probing Collision – Linear Probing in Data Structures
Linear Probing Explained with Example Definition:Linear Probing is a collision resolution technique in open addressing where, when a collision occurs,
Collision Resolution Techniques in Hashing – Separate Chaining Hash Table – Coding With Clicks
Collision Resolution Techniques in Hashing When two keys hash to the same index in a hash table, a collision occurs.
Collision Resolution Techniques in Hashing – Open Addressing Hash Table – Coding With Clicks
Collision Resolution Techniques in Hashing When two keys hash to the same index in a hash table, a collision occurs.
Hashing in Data Structure – Hashing in DSA – Hash Table – Hash Function – Collisions – Load Factor
Hashing: Concept & Explanation Hashing is a technique used in computer science to store and retrieve data efficiently. It involves
Prim’s Algorithm | Prim’s Algorithm in Data Structure | Prim’s Algorithm for minimum spanning trees
Prim’s Algorithm – Minimum Spanning Tree (MST) Prim’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree
Kruskal’s Algorithm for Minimum Spanning Trees Kruskal’s Algorithm in Data Structure – DSA Course
Kruskal’s Algorithm (Minimum Spanning Tree – MST) Kruskal’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree
Floyd Warshall Algorithm – Floyd Warshall Algorithm in Data Structure – Floyd Warshall Algorithm in Graph Theory
Floyd-Warshall Algorithm The Floyd-Warshall Algorithm is an efficient way to find the shortest paths between all pairs of nodes in
Bellman ford algorithm | Bellman ford algorithm in daa | Bellman ford algorithm shortest path
The Bellman-Ford Algorithm is used to find the shortest path from a single source vertex to all other vertices in
Dijkstra Algorithm in Data Structure – Dijkstra Algorithm Shortest Path – Dijkstra Algorithm Example
Dijkstra’s algorithm finds the shortest path from a source vertex to all other vertices in a weighted graph with non-negative
Graph Algorithms – Shortest Path Algorithms (Dijkstra, Bellman-Ford) – MST (Kruskal, Prim’s) – Cycle Detection – Topological Sorting
Common Graph Algorithms 2. Minimum Spanning Tree (MST): 3. Cycle Detection: 4. Topological Sorting: 5. Connected Components:
Spanning Tree in Data Structure | Minimum Spanning Tree in Data Structure | Spanning Tree vs Minimum Spanning Tree
Spanning Tree A spanning tree is a sub-graph of a graph (undirected & connected), which includes all the vertices of
Graph Traversal in Data Structure | Graph Traversal BFS and DFS | BFS and DFS in Data Structure
Graph Traversal Techniques Graph traversal involves visiting all the vertices and edges in a graph. Common traversal techniques include: 2.
Graph Representation in Data Structure – Adjacency Matrix – Adjacency List – Edge List
Graph Representation Graphs can be represented in various ways: Matrix Representation: The adjacency matrix is a V×V table where: 2.
Types of Graphs in Data Structure – Directed vs Undirected – Cyclic vs Acyclic – Sparse vs Dense
Types of Graphs 2. Weighted vs. Unweighted Graphs: 3. Cyclic vs. Acyclic Graphs: 4. Sparse vs. Dense Graphs: 5. Special