Featured Lists

Top 20 Problems on Dynamic programming

Top 10 Problems on Backtracking

Top 20 Problems on Graph

Top 25 Problems on Trees

All Problems

# Status Problem Level Completes Likes
456

Find the subarray with sum to a Given Value.

Medium % 0
457

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Medium % 0
458

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Hard % 0
459

Find intersection between Two Sorted Arrays.

Beginner % 0
460

Find Kth Smallest or Largest element in an Array.

Medium % 0
461

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Medium % 0
462

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Hard % 0
463

Search an Element in a Rotated Sorted Array

Medium % 0
467

Find the Distance between Two Nodes of a Binary Tree.

Hard % 0
468

Find The Distance From Root To Given Node of a Binary Tree.

Medium % 0
469

Construct a binary tree from given Inorder and Postorder Traversal

Hard % 0
472

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Hard % 0
473

Lowest Common Ancestor in a Binary Search Tree.

Medium % 0
474

Make a Binary Tree from Given Inorder and Preorder Traveral.

Hard % 0
475

Given a binary tree, find out the maximum sum of value from root to each leaf.

Medium % 0
476

Reverse Alternate levels of a given Binary Tree.

Medium % 0
477

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Medium % 1
478

Given a binary tree, Convert it into its Mirror Tree

Beginner % 0
479

Given a binary tree, Print All the Nodes that don't have Siblings.

Beginner % 0
480

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 1
481

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

Medium % 0
484

In a Binary Tree, Check if Two nodes has the same parent or are siblings

Medium % 0
485

In a Binary Tree, Check if two nodes are Cousins

Medium % 0
486

Check if Two BST's are Identical

Beginner % 0
489

Sort an Given Array in the order defined by another array

Medium % 0
490

Sort an Array - odd numbers appear first in ascending order followed by the even numbers in descending order.

Medium % 0

Find the subarray with sum to a Given Value.

In an Array, find the Smallest Subarray with Sum Greater than the Given Value

Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space

Find intersection between Two Sorted Arrays.

Find Kth Smallest or Largest element in an Array.

Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Find All Elements in an Array which appears more than N/K times, N is Array Size and k is a Number.

Search an Element in a Rotated Sorted Array

Find the Distance between Two Nodes of a Binary Tree.

Find The Distance From Root To Given Node of a Binary Tree.

Construct a binary tree from given Inorder and Postorder Traversal

Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree).

Lowest Common Ancestor in a Binary Search Tree.

Make a Binary Tree from Given Inorder and Preorder Traveral.

Given a binary tree, find out the maximum sum of value from root to each leaf.

Reverse Alternate levels of a given Binary Tree.

Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Given a binary tree, Convert it into its Mirror Tree

Given a binary tree, Print All the Nodes that don't have Siblings.

Convert a Sorted Doubly Linked List to Balanced BST.

Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

In a Binary Tree, Check if Two nodes has the same parent or are siblings

In a Binary Tree, Check if two nodes are Cousins

Check if Two BST's are Identical

Sort an Given Array in the order defined by another array

Sort an Array - odd numbers appear first in ascending order followed by the even numbers in descending order.