1. Core Concepts
2. Steps to Solve Problems with Dynamic Programming
   • Define the State
   • Formulate the Transition
   • Initialize the Boundary Conditions
   • Choose an Order
   • Return the Final Result
3. Classic Examples
   • Fibonacci Sequence
   • 0/1 Knapsack Problem
4. Conclusion
   Read more »

Binary Tree

1. What is a Binary Tree?
2. Key Components and Terms
3. Types of Binary Tree On the basis of the completion of levels
4. Tree Traversal Techniques
   • Depth-First Search (DFS)
   • Breadth First Search (BFS)
5. Binary Search Tree (BST)
   • BST Implementation
   • How to delete Node in a BST
6. Maximum Depth of Binary Tree
7. Real-World Applications
   Read more »

The KMP Algorithm

1. Introduction to KMP Algorithm
2. Naive Pattern Searching Algorithm
3. Core Idea of the KMP Algorithm
   • How to generate the next array(LSP array)
   • KMP Matching Process
4. Code Implementation using Java
5. Complexity Analysis
   Read more »

Doubly Linked List in C#: A Fun and Practical Guide

1. What is a Doubly Linked List?
2. Creating a Doubly Linked List Class
3. Insertion Operations
   • Insert at the Beginning
   • Insert at the End
   • Insert after a spefific Node
4. Deletion Operations
   Read more »

Singly Linked List: Concepts and Operations

1. Overview of Singly Linked List
2. Advantages of Linked List
3. Types of Linked List
4. How to Create a Linked List
5. Various Operations on Linked List
   Read more »