Connect nodes at the same level in a binary tree
Reverse a linked list in groups of size k.
Find the longest palindromic substring in a given string
Find the maximum subarray sum using Kadane’s Algorithm.
Print a given matrix in spiral order.
Find the maximum product subarray in a given array.
Find the majority element in an array
Detect and remove a loop in a linked list.
Find the Lowest Common Ancestor (LCA) in a Binary Tree
Find the Longest Increasing Subsequence (LIS) in an array.
Check whether a given binary tree is a Binary Search Tree (BST).
Find the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree
Find the length of the longest substring without repeating characters.
Find the minimum number of adjacent swaps required to make a given string a palindrome.
Clone a linked list with next and random pointer
Add 1 to a number represented as a linked list
Perform level order traversal of a binary tree
Perform inorder traversal of a binary tree without using recursion.
Reverse every k nodes in a linked list.
Longest Palindromic Subsequence in a string
Reverse a linked list in groups of given size
Find the median in a running stream of numbers
Search an element in a sorted and rotated array
Find the longest increasing subsequence in an array
Group all anagrams together from a list of strings.
Connect all nodes at the same level in a binary tree
Convert an infix expression to a postfix expression.
Find the kth largest element in a Binary Search Tree.
Swap two nodes in a doubly linked list using a hashmap.
Design and implement an LRU (Least Recently Used) Cache.
Find the number of islands in a binary matrix using DFS.
Construct a Binary Search Tree from its preorder traversal.
Design and implement an LRU Cache with optimal time complexity.
Given an array, find the maximum j - i such that arr[j] > arr[i]
Rotate a square matrix (image) by 90 degrees clockwise in-place.
Find the least common ancestor (LCA) of two nodes in a binary tree
Find all nodes at distance K from a given leaf node in a binary tree
Print the boundary traversal of a binary tree in clockwise direction.
Find the point of intersection of two line segments given their endpoints.