Find the diameter of a binary tree.
Check whether a given binary tree is a Binary Search Tree (BST).
Search an element in a row-wise and column-wise sorted matrix
Design and implement an LRU Cache.
Find the next greater element for each element in an array.
Print the top view of a binary tree.
Print the left view of a binary tree.
Add two numbers represented by linked lists.
Find the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree.
Count the number of inversions in an array
Print the boundary traversal of a binary tree.
Find the first non-repeating character in a given string.
Reverse a linked list in groups of size k.
Clone a linked list with next and random pointer
Find the vertical sum in a binary tree
Reverse every k nodes in a linked list.
Print all permutations of a given string.
Perform boundary traversal of a binary tree.
Find the median of a stream of running integers
Search an element in a sorted and rotated array
Find the next greater number with the same set of digits
Find the longest palindromic substring in a given string.
Print a matrix in spiral order.
Find the row with the maximum number of 1s in a binary matrix
Find the Lowest Common Ancestor (LCA) in a Binary Tree.
Perform level order traversal of a binary tree in spiral (zigzag) form.
Serialize and deserialize a binary tree
Convert an infix expression to postfix expression
Design and implement an LRU (Least Recently Used) Cache.
Find the length of the longest substring without repeating characters.
Given a sorted dictionary of an alien language, find the order of characters.
Find the maximum path sum in a binary tree
Check whether a given linked list is a palindrome.
Check whether a binary tree is a binary search tree
Merge overlapping intervals.
Convert a given binary tree to a sum tree
Find an element in a rotated sorted array.
Print a binary tree in vertical order traversal.
Connect nodes at the same level in a binary tree.
Merge k sorted arrays into a single sorted array.
Perform zigzag (spiral) traversal of a binary tree
Perform zig-zag (spiral) traversal of a binary tree
Find the distance between two given nodes in a binary tree.
Find the first non-repeating character in a stream of characters