Filter interviews by
I appeared for an interview in Jan 2021.
Round duration - 125 minutes
Round difficulty - Easy
This round consist of coding questions and they were of good level based on strings and dynamic programming.
This round was the online coding test conducted on the platform Amcat. The languages allowed were C, C++, Java and Python.
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
The task is to find the Kth largest element from a given list of numbers for each test case.
Read the number of test cases 'T'
For each test case, read the number of elements 'N' and the Kth largest number to find 'K'
Sort the array in descending order and output the Kth element
Given an arithmetic expression EXP
containing integer values separated by any of the operators ‘+’, ‘-’, and ‘*’, your task is to place parentheses such that the value of the exp...
Given an arithmetic expression, place parentheses to maximize the value of the expression.
Identify the operators in the expression ('+', '-', '*').
Consider the precedence of operators to determine where to place parentheses.
Calculate the value of the expression with different placements of parentheses to find the maximum value.
Round duration - 45 minutes
Round difficulty - Easy
The interview took place in the morning and the interviewer was very friendly.
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...
The task is to determine the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree weight.
Sort the edges based on their weights in non-decreasing order.
Iterate through the sorted edges and add them to the MST if they don't form a cycle.
Keep track of the total weight of the MST and return it as the output.
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return the preorder traversal of the sum tree.
Traverse the tree in a bottom-up manner to calculate the sum of children for each node.
Set leaf nodes to 0 and update non-leaf nodes with the sum of their children.
Return the preorder traversal of the modified tree.
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
To determine the left view of a binary tree, we need to find the nodes that are visible when the tree is viewed from the left side.
Traverse the binary tree in a level order manner and keep track of the first node at each level (leftmost node).
Store the leftmost nodes in an array as they are encountered during the traversal.
Return the array containing the left view of the binary tree.
Tip 1 : Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer. The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding. Also you may practice on Geeks For Geeks or any other interview portal.
Tip 2 : Try to do as much as Data structures related questions as practice made a man perfect.
Tip 3 : If you have already done similar types of questions then you will get a solution approach very fastly during the interview.
Tip 1 : Mention all internships which you have done, as it increases your chances of shortlisting your resume.
Tip 2 : Keep resume short and up to the point and try to keep it on a single page.
Tip 3 : Also just write that skills which you are pretty confident about.
Top trending discussions
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
posted on 11 Jan 2025
Coding Rount
DSA Round + Puzzle
SQL + Project Discussion
JS
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
Count the maximum continuous occurrences of '1' in a binary string.
Initialize a counter to track current streak of '1's.
Use a variable to store the maximum streak found.
Iterate through each character in the string.
If the character is '1', increment the current counter.
If the character is '0', compare and reset the current counter.
At the end of the iteration, ensure to check the last streak.
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
Basic Aptitude questions like quantitative and logical
Programs have to written for given questions
I applied via Company Website and was interviewed in May 2022. There were 4 interview rounds.
The test contains basic programming output questions and some aptitude questions.
We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.
Three technical questions related to string manipulation and clock calculations.
For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.
To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.
To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H ...
The question asks to check if a number is prime and add all its digits.
To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.
If the number is divisible by any of these numbers, it is not prime.
To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
20 questions were given.
aptitude + simple coding output based.
5 questions were shared on a doc file. We need to code them paste their solutions in the file. Level was easy to medium. Array-string based Questions.
Find minimum angle between hour and minute hand.
Calculate the angle made by hour hand with 12 o'clock position and minute hand with 12 o'clock position.
Calculate the difference between the two angles.
If the difference is greater than 180 degrees, subtract it from 360 degrees to get the minimum angle.
Find the maximum span of 1 in a 0,1 array.
Iterate through the array and keep track of the first and last occurrence of 1.
Calculate the difference between the last and first occurrence of 1.
Repeat the process for all 1's in the array and return the maximum difference.
Sort a binary array using one traversal and no extra space.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap the elements if the left pointer points to 1 and the right pointer points to 0.
Continue traversing until the pointers meet in the middle.
posted on 22 Oct 2023
I applied via Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
Very easy basic logical questions
Easy level array string questions
2 questions asked should give optimized approach
based on 12 reviews
Rating in categories
Software Engineer
76
salaries
| ₹5 L/yr - ₹10 L/yr |
Senior Software Engineer
37
salaries
| ₹8 L/yr - ₹20.5 L/yr |
E-Commerce Analyst
37
salaries
| ₹4 L/yr - ₹7 L/yr |
QA Engineer
21
salaries
| ₹4 L/yr - ₹9.7 L/yr |
Business Analyst
20
salaries
| ₹2.4 L/yr - ₹11 L/yr |
Maxgen Technologies
JoulestoWatts Business Solutions
Value Point Systems
F1 Info Solutions and Services