Similar Topics

Web Technologies32.1K+ articles

Misc7.7K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Strings2.1K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Dynamic Programming1.1K+ articles

Searching1.0K+ articles

Tree911+ articles

DSA

20.3K+ posts

Check If There is an Edge Between Two Vertices

Last Updated: 29 October 2025

Given Undirected Graph represented by an adjacency list adj[][] and two vertices u and v. Find if there is an edge between two vertices.Adjacency List: A list of lists whe...read more

article_image

Short Notes: Graph

Last Updated: 28 October 2025

Graph Data Structure is a non-linear structure used to represent relationships between objects. It consists of a set of vertices (nodes) connected by edges (links). Unlike...read more

article_image

Topological sort using DFS

Last Updated: 31 October 2025

Given a Directed Acyclic Graph(DAG), find any Topological Sorted order of the graph.Topological Sorted order: It is a linear ordering of vertices such that for every direc...read more

article_image

Traverse BST in Sorted Order

Last Updated: 13 October 2025

Given the root node of a Binary Search Tree (BST), find the elements of the tree in sorted order.Examples: Input: Output: [5, 10, 12, 18]Explanation: The Sorted order of B...read more

article_image

Short Notes on Binary Search Tree

Last Updated: 11 October 2025

Binary Search Tree (BST) is a non-linear, hierarchical data structure in which each node has at most two children referred as a left child and a right child.It follows a s...read more

article_image

Short Notes: Heap

Last Updated: 17 October 2025

A Heap is a specialized tree-based data structure that satisfies two key properties:It is a complete binary tree, meaning all levels are completely filled except possibly ...read more

article_image

K closest values to target in BST

Last Updated: 14 October 2025

Given the root of a Binary Search Tree, a target value, and an integer k, find the k values in the BST that are closest to the target.The closest value is taken by choosin...read more

article_image

Short Notes: Tree

Last Updated: 06 October 2025

Tree data structureis a hierarchical structure that is used to represent and organize data in the form of parent child relationship.The topmost node of the tree is called ...read more

article_image

Count Subset With Target Sum II

Last Updated: 30 September 2025

Given an array arr[] and an integer k, find the count of subsets whose sum is equals to k.Note: The array size can be up to 30–40, and the values of arr[i] and k can be ve...read more

Short Notes on Recursion and Backtracking

Last Updated: 30 September 2025

Recursion is a programming technique where a function calls itself to solve a smaller or simpler version of the original problem until a base case is reached.How Recursion...read more

article_image

Short Notes on Stack

Last Updated: 22 September 2025

A stack is a linear data structure that stores elements in a sequential manner and follows the principle of Last-In, First-Out (LIFO). This means the most recently inserte...read more

article_image

Short Notes on Queue

Last Updated: 22 September 2025

Queue : A linear data structure that follows the FIFO (First In First Out) principle, where insertion takes place at the rear end and deletion takes place at the front end...read more

article_image

Introduction to Circular Queue

Last Updated: 20 September 2025

A Circular Queue is an advanced version of a linear queue where the last position is connected back to the first position, forming a circle. This allows the queue to effic...read more

article_image

Introduction of Deque

Last Updated: 20 September 2025

A Deque (Double-Ended Queue) is a linear data structure that allows insertion and deletion of elements from both ends. Unlike a stack or a queue, where operations are rest...read more

article_image

Rotate Deque By K

Last Updated: 22 September 2025

Given a deque dq[] (double-ended queue) of integers, along with two integers k and type, Rotate the deque circularly by k positions.If type = 1 → Right Rotation (Clockwise...read more

...