Search in Rotated Sorted Array Leetcode Solution

Consider a sorted array but one index was picked and the array was rotated at that point. Now, once the array has been rotated you are required to find a particular target element and return its index. In case, the element is not present, return -1. The problem is generally …

Read moreSearch in Rotated Sorted Array Leetcode Solution

An Interesting Method to generate Binary Numbers from 1 to n

Problem Statement The problem “An Interesting Method to generate Binary Numbers from 1 to n” states that you are given a number n, print all the numbers from 1 to n in binary form. Examples 3 1 10 11   6 1 10 11 100 101 110 Algorithm The generation …

Read moreAn Interesting Method to generate Binary Numbers from 1 to n

BST to a Tree with Sum of all Smaller Keys

In this problem we have given a Binary Search Tree, write an algorithm to convert best to a tree with sum of all smaller keys. Example Input Output Pre-order : 19 7 1 54 34 88 Naive Approach Traverse all the nodes one by one in any traversal form, and …

Read moreBST to a Tree with Sum of all Smaller Keys

Remove Minimum Number of Elements Such That no Common Element Exist in both Array

Given two arrays A and B consisting of n and m elements respectively. Remove minimum number of elements such that no common element exist in both array and print the count of elements which removed. Example Input: A[]={ 1, 2, 1, 1} B[]= {1, 1} Output: Minimum elements to remove …

Read moreRemove Minimum Number of Elements Such That no Common Element Exist in both Array

Level order Traversal in Spiral Form

In this problem we have given a binary tree,  print its level order traversal in a spiral form. Examples Input Output 10 30 20 40 50 80 70 60 Naive Approach for Level order Traversal in Spiral Form The idea is to do a normal level order traversal using a …

Read moreLevel order Traversal in Spiral Form

Trapping Rain Water

In Trapping Rain Water problem we have given N non-negative integers representing an elevation map and the width of each bar is 1. We have to find the amount of water that can be trapped in the above structure. Example Let’s understand that by an example For the above elevation …

Read moreTrapping Rain Water

Binary Tree zigzag level order Traversal

Given a binary tree, print the zigzag level order traversal of its node values. (ie, from left to right, then right to left for the next level and alternate between). Example consider the binary tree given below Below is the zigzag level order traversal of the above binary tree Types …

Read moreBinary Tree zigzag level order Traversal