Filter interviews by
Clear (1)
DSA DSA DSA DSA DAS DSA DSa
20 min 50 question done selected
Top trending discussions
I applied via Campus Placement
ATM transaction involves multiple background processes including authentication, authorization, and communication with bank servers.
Customer inserts card and enters PIN
ATM authenticates the card and PIN
ATM requests authorization from bank server
Bank server verifies account balance and approves or denies transaction
ATM dispenses cash or completes other requested transaction
ATM updates account balance and sends transacti
Cut cake into 8 pieces using knife 3 times only.
First, cut the cake horizontally into two equal halves.
Then, cut the cake vertically into four equal pieces.
Finally, cut the cake horizontally again into eight equal pieces.
Make sure to use the knife efficiently to minimize the number of cuts.
Practice visualization before making the cuts to avoid mistakes.
The one bird was already dead.
The bird was already dead before the shot was fired.
The bird was injured and unable to fly away with the rest of the birds.
The bird was a decoy bird used for hunting purposes.
The bird was a trained bird used for falconry.
Developed a web-based attendance management system and a mobile app for event management.
Created a database schema and implemented CRUD operations using PHP and MySQL.
Designed the user interface using HTML, CSS, and JavaScript.
Integrated Google Maps API for location tracking in the mobile app.
Implemented push notifications using Firebase Cloud Messaging.
Collaborated with a team of four to complete the projects within t
I applied via Campus Placement
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were 33 questions in total. The objective questions were simple.
Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.
Sort a list of event dates in ascending order based on year, month, and day.
Sort the list of dates based on year, then month, and finally day.
Use a sorting algorithm to rearrange the dates in ascending order.
Ensure the constraints are met for each date in the list.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find all pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the pairs based on the first element and then the second element.
Handle edge cases like duplicate elements and pairs with the same values.
Example...
Given an integer N
, your task is to recursively break it into three integer parts: N / 2
, N / 3
, and N / 4
. You need to compute the maximum sum possible by dividing the numbe...
Given an integer N, recursively break it into three parts and find the maximum sum possible.
Recursively divide N into N/2, N/3, and N/4 to find the maximum sum
Compare the sum obtained by dividing N with the sum of N itself
Return the maximum sum for each test case
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
Given an array ARR
of size N
, containing each number between 1 and N-1
at least once, identify the single integer that appears twice.
The first line contains an integer...
Identify the duplicate integer in an array containing numbers between 1 and N-1.
Iterate through the array and keep track of the frequency of each element using a hashmap.
Return the element with a frequency greater than 1 as the duplicate integer.
Ensure the constraints are met and a duplicate number is guaranteed to be present.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current node value to the path sum and multiply by 10 for each level
When reaching a leaf node, add the final path sum to the total sum
Return the total sum modulo (10^9 + 7)
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
A directed acyclic g...
Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.
Create a graph data structure to represent the DAG
Use depth-first search (DFS) to perform topological sorting
Maintain a visited array to keep track of visited nodes
Return the ordering of nodes after DFS traversal
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on DSA.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...
Implement a function to find the minimum number in a rotated sorted array efficiently.
Use binary search to find the minimum element in the rotated array.
Compare the mid element with the start and end elements to determine which half of the array to search next.
Continue the binary search until the minimum element is found.
Given an array TREE
of 'N' unique integers, construct a maximum binary tree using the following rules:
TREE
.Construct a maximum binary tree from an array of unique integers following specific rules.
Find the maximum number in the array to set as the root of the tree.
Recursively construct the left subtree with elements before the maximum number.
Recursively construct the right subtree with elements after the maximum number.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 2 Dec 2015
posted on 13 May 2017
I was interviewed before May 2016.
I was interviewed in Dec 2016.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
56
salaries
| ₹0 L/yr - ₹0 L/yr |
Officer
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Morgan Stanley
Goldman Sachs
JPMorgan Chase & Co.
Bank of America