2191. Sort the Jumbled Numbers
You are given a 0-indexed integer array mapping which represents the mapping rule of a shuffled decimal system. mapping[i] = j means digit i should be mapped to […]
Check for BST
Given the root of a binary tree. Check whether it is a BST or not.Note: We are considering that BSTs can not
1636. Sort Array by Increasing Frequency
Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have
Merge two BST ‘s
Given two BSTs, return elements of merged BSTs in sorted form. Examples : Input: BST1: 5 / \ 3 6
2418. Sort the People
You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each
Largest BST
Given a binary tree. Find the size of its largest subtree which is a Binary Search Tree.Note: Here Size equals the number of
2392. Build a Matrix With Conditions
You are given a positive integer k. You are also given: a 2D integer array rowConditions of size n where rowConditions[i] = [abovei, belowi], and a 2D integer
Maximum product subset of an array
Given an array arr. The task is to find and return the maximum product possible with the subset of elements present in the
1605. Find Valid Matrix Given Row and Column Sums
You are given two arrays rowSum and colSum of non-negative integers where rowSum[i] is the sum of the elements in the ith row and colSum[j] is the sum of the
Remove Half Nodes
You are given a binary tree and you need to remove all the half nodes (which have only one child). Return the
1380. Lucky Numbers in a Matrix
Given an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order. A lucky number is an element of the matrix such that it
Count Smaller elements
Given an array arr containing positive integers. Count and return an array ans where ans[i] denotes the number of smaller elements on right side of arr[i]. Examples: