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

There are some natural number whose all permutation is greater than or equal to that number eg. 123, whose all the permutation (123, 231, 321)… Read More »

- Real-time application of Data Structures
- Stack of Pair in C++ STL with Examples
- C/C++ program for calling main() in main()
- Important functions of STL Components in C++
- Maximize sum of topmost elements of S stacks by popping at most N elements
- Min difference between maximum and minimum element in all Y size subarrays
- Range Sum and Update in Array : Segment Tree using Stack
- Generate Complete Binary Tree in such a way that sum of non-leaf nodes is minimum
- Static and Dynamic data structures in Java with Examples
- Append the elements of queue in mirror-inverse order
- Program to convert Infix notation to Expression Tree
- Minimum steps required to make an array decreasing
- Check whether there exists a triplet (i, j, k) such that arr[i] < arr[k] < arr[j] for i < j < k
- Difference between Stack and Array
- Sort array such that absolute difference of adjacent elements is in increasing order
- Print all K-sum levels in a Binary Tree
- Maximum of XOR of first and second maximum of all subarrays
- Output of Java Programs | Set 55 (Java Collections Framework)
- Calculate weight of parenthesis based on the given conditions
- Reverse the elements only at odd positions in the given Array
- Level order traversal in spiral form using stack and multimap
- Change the given string according to the given conditions
- Find cells in Matrix that are not visited by Robot for given movements
- Unique subsequences of length K with given sum
- Find number of subarrays ending with arr[i] where arr[i] is the minimum element of that subarray
- Minimum operation required to make a balanced sequence
- Sum of decomposition values of all suffixes of an Array
- Check if a string can be split into even length palindromic substrings
- Stack machine in Computer Organisation
- Difference between Array, Queue and Stack

There are some natural number whose all permutation is greater than or equal to that number eg. 123, whose all the permutation (123, 231, 321)… Read More »

Given three stack of the positive numbers, the task is to find the possible equal maximum sum of the stacks with removal of top elements… Read More »

Given array of integer, find the next smaller of next greater element of every element in array. Note : Elements for which no greater element… Read More »

It was a walk-in for experienced candidates actually. Round 1: Machine Coding Round (60 min) Q1. Infix to Postfix conversion e.g. A+(B-C)*D becomes ABC-D*+ Q2.… Read More »

Given an array of integers, the task is to find the maximum absolute difference between the nearest left and the right smaller element of every… Read More »

Hi, I recently appeared for the 1st round of Directi’s recruitment process. Students were divided into 2 slots. The questions for the slots were as… Read More »

Round 1: Online Multiple Choice Questions It comprised of two sections. First section consisted around 15-20 questions related to logical reasoning (Quantitative – Easy-medium-level) and… Read More »

VMWare visited an extension centre of our campus for hiring IT App Developer. Round 1 The first round a written one, conducted on HirePro platform.… Read More »

Accolite visited our campus for recruiting Full time employees as well as interns. The process started with pre-placement talks and then we had to undergo… Read More »

Round 1: ONLINE OBJECTIVE ROUND on HIREPRO platform This round comprised of 30 objective difficult and lengthy paragraph based aptitude questions to be solved in… Read More »

Given a balanced expression, find if it contains duplicate parenthesis or not. A set of parenthesis are duplicate if the same subexpression is surrounded by… Read More »

Intuit was the first company to visit our campus. They selected 6 students. Online Round ———————— Only people with CGPA of 9+ were allowed to… Read More »

I recently go interviewed for MakeMyTrip Developer position. I had 5 rounds: Round 1: 1) Reverse a Linked List – You should be able to… Read More »

We are given queue data structure, the task is to implement stack using only given queue data structure. We have discussed a solution that uses… Read More »

Question: Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return… Read More »