NerdyCoder | Practice Problems

Construct a binary tree from inorder and postorder traversals

You are given inorder and postorder traversals, you need to construct the binary tree. Input : Inorder = {4, 8, 2, 5, 1, 6, 3,

You are given a binary tree which can have negative elements also and an integer k, you need to print all the paths in the

You are given a 2D grid of 1’s and 0’s where 1’s denotes the land and 0’s denote the water. You need to return the

You are given an array containing n integers (n>1), you need to return an output array such that output [i] is equal to the product

You are given an array of integers, you need to return the pivot index of the array if it exists, else return -1. Pivot index

You are given an integer array, sorted in ascending order and a target integer. Suppose that the array is rotated at some pivot point that

« 1 2 3 4 … 9 »