Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

## Delete consecutive same words in a sequence

Problem statement Given an array of strings, if two consecutive strings are the same they will destroy each other. Your task is to find the number of remaining strings from...

## Count natural numbers whose all permutation are greater than that number

Problem statement Given a number n, you have to find the count of all such numbers that satisfies the following condition: For any number x, all the permutations of x...

## Tracking the Current Maximum Element in the Stack

Problem Statement: You will be given a stack of integer values. You have to keep a track of the maximum value in the stack. For instance, the element that is...

## Stack Permutations (Check if an Array is Stack Permutation of Another)

Problem Statement: You will be given 2 arrays. You have to tell whether the 2 arrays are stack permutations of each other or not. Basically, there will be 2 input...

## Iterative Method to find Ancestors of a Given Binary Tree

Problem Statement: Given a Binary Tree, you need to find all the ancestors of a particular node of that binary tree. You will be given the value that is stored...

## Largest rectangular Area in Histogram – Set 2

Problem Statement You will be given an array that represents a histogram. The values of the array represent the height of the bars of the histogram and the width of...

## Merge Overlapping Intervals

Problem Statement You will be given an array of time intervals that will be in any random order. You have to merge all the overlapping intervals and print only the...

## Iterative Postorder Traversal | Set 2 (Using One Stack)

Problem Statement: You are given a binary tree. Your task is to print the postorder traversal of the binary tree using just 1 stack. Example Consider the tree given below....