Similar Collections

We are trying to list out the most frequently asked interview problems or the problem given in the coding rounds of IT giants.

questions

Title
Given a pattern containing only (I)s and (D)s. (I) stands for increasing and (D) for decreasing. Devise an algorithm to print the minimum number following that pattern. Digits are from 1-9 and digits can not repeat
Given an expression exp of length n consisting of some brackets. The task is to print the bracket numbers when the expression is being parsed
The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stock\'s price for all n days
Given a string of balanced expression, find if it contains a redundant parenthesis or not. A set of parentheses is redundant if the same sub-expression is surrounded by unnecessary or multiple brackets. Print \"Yes\" if redundant else \"No\"
Given a postfix expression, the task is to evaluate the expression and print the final value. Operators will only include the basic arithmetic operators like *, / , +, and -
Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. For simplicity, assume that all bars have the same width and the width is 1 unit
Given a string S consisting only of ( and ) parentheses, we add the minimum number of parentheses ( or ) in any positions so that the resulting parentheses string is valid
Given two n-ary trees, the task is to check if they are mirrors of each other or not
total questions: 8

Questions

8

Views

256

Best Answers

299

Points

5