Filter interviews by
Clear (1)
I was interviewed 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
I was interviewed in Feb 2025.
posted on 29 Aug 2024
I applied via Campus Placement
Question on various topics
More questions on oops, coding
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Job Portal and was interviewed before Jan 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Easy DSA questions and some questions on resume
I applied via Campus Placement and was interviewed in Mar 2020. There was 1 interview round.
To get the second to last element from a SQL table, use the OFFSET-FETCH clause.
Use the ORDER BY clause to sort the table in descending order.
Use the OFFSET-FETCH clause to skip the last row and fetch the second to last row.
Example: SELECT column_name FROM table_name ORDER BY column_name DESC OFFSET 1 ROWS FETCH NEXT 1 ROWS ONLY;
based on 10 reviews
Rating in categories
Software Engineer
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
E-Commerce Analyst
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech