📄️ Backtracking
Backtracking is a recursive algorithm used to solve problems by building a solution incrementally, one piece at a time, and removing solutions that fail to satisfy constraints of the problem.
📄️ Breadth-First Search
Breadth-First Search (BFS) is a graph traversal algorithm that explores all vertices in a graph by visiting them in layers.
📄️ Binary Search
In this chapter you will learn the basics of binary search and how to apply it in a different problems.
📄️ Binary Tree
In this chapter you will learn the basics of binary tree it's implementation and different applications.
📄️ Depth-First Search
Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
📄️ Heap
In this chapter you will learn the basics of Heap data structure and how to apply it in a different problems.
📄️ Linked List
In this chapter you will learn the basics of linked list and how to apply it in a different problems.
📄️ Trie
In this chapter you will learn the basics of Trie data structure and how to apply it in a different problems.
📄️ Two Pointers
In this chapter you will learn the basics of Two Pointers technique and how to apply it in a different problems.