Problems

# Status Problem Level Completes Likes
456

Find intersection between Two Sorted Arrays.

Beginner % 0
457

Find Kth Smallest or Largest element in an Array.

Medium % 0
458

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

Medium % 0
459

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

Hard % 0
460

Search an Element in a Rotated Sorted Array

Medium % 0
464

Find the Distance between Two Nodes of a Binary Tree.

Hard % 0
465

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

Medium % 0
466

Construct a binary tree from given Inorder and Postorder Traversal

Hard % 0
469

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

Hard % 0
470

Lowest Common Ancestor in a Binary Search Tree.

Medium % 0
471

Make a Binary Tree from Given Inorder and Preorder Traveral.

Hard % 0
472

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

Medium % 0
473

Reverse Alternate levels of a given Binary Tree.

Medium % 0
474

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

Medium % 0
475

Given a binary tree, Convert it into its Mirror Tree

Beginner % 0
476

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

Beginner % 0
477

Convert a Sorted Doubly Linked List to Balanced BST.

Medium % 0
478

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

Medium % 0
481

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

Medium % 0
482

In a Binary Tree, Check if two nodes are Cousins

Medium % 0
483

Check if Two BST's are Identical

Beginner % 1
486

Sort an Given Array in the order defined by another array

Medium % 0
487

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

Medium % 0
489

Find the maximum width of a binary tree

Medium % 0
490

Find the number of occurrences of a number in a given sorted array.

Medium % 0

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.

Find the maximum width of a binary tree

Find the number of occurrences of a number in a given sorted array.