## Intuit Interview Experience | Set 11 (On-Campus)

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 »

- Real-time application of Data Structures
- Stack of Pair in C++ STL with Examples
- Important functions of STL Components in C++
- C/C++ program for calling main() in main()
- 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
- Difference between Stack and Array
- Program to convert Infix notation to Expression Tree
- Check whether there exists a triplet (i, j, k) such that arr[i] < arr[k] < arr[j] for i < j < k
- Append the elements of queue in mirror-inverse order
- Minimum steps required to make an array decreasing
- Unique subsequences of length K with given sum
- Sort array such that absolute difference of adjacent elements is in increasing order
- Calculate weight of parenthesis based on the given conditions
- 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)
- Lexicographically largest possible String after removal of K characters
- Count of Array elements greater than all elements on its left and next K elements on its right
- 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
- What happens when we call a Function
- Check if a string can be split into even length palindromic substrings
- 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

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 »

Given two Binary Trees, write a function that returns true if two trees are mirror of each other, else false. For example, the function should… Read More »

Given a binary matrix, find the maximum size rectangle binary-sub-matrix with all 1’s. Example: Input: 0 1 1 0 1 1 1 1 1 1… Read More »

Java Collection framework provides a Stack class which models and implements Stack data structure. The class is based on the basic principle of last-in-first-out. In… Read More »

Given a pattern containing only I’s and D’s. I for increasing and D for decreasing. Devise an algorithm to print the minimum number following that… Read More »

1. Written Round : 1) 30 Aptitude questions(30 min). 2) 2-Coding questions(30 min). 2-a) Write an algorithm for dutch national flag problem 2-b) Write an… Read More »

Round 1 (Coding round): 1) Range [L, R] is given. Need to find what is the maximum repeating digit in prime numbers between L and… Read More »

Given an array of numbers, return true if given array can represent preorder traversal of a Binary Search Tree, else return false. Expected time complexity… Read More »

Given an expression with only ‘}’ and ‘{‘. The expression may not be balanced. Find minimum number of bracket reversals to make the expression balanced.… Read More »

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal (DFS) of a tree. The only catch here is, unlike trees,… Read More »

Given a stack, sort it using recursion. Use of any loop constructs like while, for..etc is not allowed. We can only use the following ADT… Read More »

Given a string consisting of opening and closing parenthesis, find the length of the longest valid parenthesis substring. Examples: Input : ((() Output : 2… Read More »