Filter interviews by
I applied via Job Portal and was interviewed in May 2024. There were 2 interview rounds.
Medium Level of Leetcode like Leetcode 200 etc and Java Oops is very important
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Find the largest element in an array without using any STL functions.
Iterate through the array and compare each element with the current largest element.
Update the largest element if a larger element is found.
Return the largest element at the end.
Implement a queue using two stacks
Use two stacks - one for enqueue operation and one for dequeue operation
When dequeue is called, check if the second stack is empty. If it is, pop all elements from the first stack and push them onto the second stack
Time complexity for enqueue operation is O(1) and for dequeue operation is O(n)
I appeared for an interview in Nov 2024, where I was asked the following questions.
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
1 hour, 43 MCQ type questions
Reverse a given string
Use a loop to iterate through the characters of the string and build a new string in reverse order
Alternatively, you can use built-in functions like reverse() or StringBuilder in some programming languages
Make sure to handle edge cases like empty string or null input
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 55 minutes
Round difficulty - Medium
It was a coding interview that started with introducing myself. Two questions from data structures were asked.
You are provided with a matrix containing 'N' rows and 'M' columns filled with integers. Each row is sorted in non-decreasing order. Your task is to find the overall median...
Find the overall median of a matrix with sorted rows.
Merge all elements of the matrix into a single sorted array
Calculate the median of the merged array
Handle odd number of elements by directly finding the middle element
You are provided with an integer X
and a non-decreasing sorted doubly linked list consisting of distinct nodes.
Your task is to find and return the count of ...
Count triplets in a sorted doubly linked list that sum up to a given value.
Iterate through the list and for each node, find pairs that sum up to X-nodeValue.
Use two pointers approach to find pairs efficiently.
Keep track of count of triplets found while iterating through the list.
Tip 1 : Learn to explain your logic well.
Tip 2 : Learn to dry run your code.
Tip 3 : Solve as many data structures questions as you can.
Tip 1 : They did not shortlist resume .
Tip 2 : They did send link to everyone satisfying eligibility criteria.
I appeared for an interview before Sep 2016.
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Easy
The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
The first line contains an integer 'T' denoting the numb...
Find the remainder when a given number is divided by 11.
Convert the string number to an integer for easier calculation.
Use the property that the remainder when a number is divided by 11 is the same as the remainder when the alternating sum of its digits is divided by 11.
Repeat the process until you get a single digit number as the result.
You are provided with an array named BINARYNUMS
consisting of N
unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...
Given an array of unique binary strings representing integers from 0 to N, find and return the missing integer's binary representation.
Iterate through the binary strings and convert them to integers.
Calculate the sum of integers from 0 to N using the formula (N * (N + 1)) / 2.
Subtract the sum of the integers in the array from the total sum to find the missing integer.
Convert the missing integer to binary and return it ...
Round duration - 60 Minutes
Round difficulty - Medium
It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.
In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The sizes of these fishes are provided in an array c...
Given a river with fishes of different sizes and speeds, determine how many fishes survive after encounters.
Iterate through the array of fishes and simulate encounters between fishes to determine survivors
Use a stack to keep track of surviving fishes
Compare sizes of fishes to determine which fish eats the other
A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...
The Fishmonger Toll Optimization Problem involves minimizing toll costs while ensuring timely delivery of goods from a port to a market.
Given 'N' states and a time limit 'M', find the smallest toll amount to reach the market from the port within the given time.
Use dynamic programming to solve the problem efficiently.
Consider both time and toll matrices to calculate the minimum toll cost.
Return -1 if it is not possible ...
Round duration - 75 Minutes
Round difficulty - Medium
It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.
Given 'N' battalions and 'M' tanks, along with an array representing the number of soldiers in each battalion, you need to allocate the tanks such that the maximum r...
Allocate tanks to battalions to minimize maximum ratio of soldiers per tank.
Calculate the ratio of soldiers to tanks for each battalion.
Sort the ratios in ascending order.
Return the maximum ratio from the sorted list.
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Consider lines at a...
Diagonal traversal of a binary tree involves printing nodes at the same diagonal in a specific order.
Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.
Use a queue to keep track of nodes at each level of the tree.
Print the nodes in the order they are encountered while traversing the tree diagonally.
Tip 1 : Understand the concept for any algorithm you are studying, focus on how things are working even in single line of code, if you do that number of questions doesn't matter.
Tip 2 : Don't get confuse while choosing which online platform is good and which one is bad, Every platform has enough resources to crack any interview. Just make sure you completely finish atleast one platform. If you like CP then start practicing on SPOJ/Codeforces/TopCoder/CodeChef.
Tip 1 : Be confident about every single word written in your resume.
Tip 2 : Make sure your resume is of 1 page only.
I appeared for an interview before Sep 2020.
Round duration - 150 Minutes
Round difficulty - Easy
Debugging: This section had 7 debugging problems, which consist of code snippets that have some logical error that needs to be rectified.
Reasoning Ability: This section consists of some verbal reasoning questions and some aptitude questions.
Coding: This section consists of 2 coding problems.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N * N matrix, find the position of a target integer 'X'.
Iterate over each row and column to search for the target integer 'X'.
Utilize the sorted nature of the matrix to optimize the search process.
Return the position of 'X' if found, else return '-1 -1'.
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Deep copy a linked list with random pointers and return its head. Validate if the cloned linked list is an exact copy of the original.
Create a new node for each node in the original linked list and maintain a mapping between original and cloned nodes.
Update the next and random pointers of the cloned nodes based on the mapping.
Time complexity: O(N) where N is the number of nodes in the linked list.
Space complexity: O(N)...
Round duration - 60 minutes
Round difficulty - Medium
Around 30 candidates were shortlisted from my campus and over 150+ candidates were shortlisted from the university, and I was one of them. Then my first round of interviews was scheduled. I was pretty nervous before the interview.
Given a 2D array with dimensions N*M
, your task is to read the array elements in a row-wise manner and return a linear array that stores the elements in a 'wave' pattern. S...
Given a 2D array, return a linear array storing elements in a 'wave' pattern.
Read the array elements row-wise and store in wave pattern
Alternate direction for storing elements from each row
Handle edge cases like single row or single column arrays
Use nested loops to iterate through the 2D array
Given an array/list of integers PRE
representing the preorder traversal of a strict binary tree, and an array/list TYPENL
with values 'L' or 'N', where 'L' denotes a...
Given preorder traversal and node type information, construct a strict binary tree and return the root node.
Create a binary tree using preorder traversal and node type information
Use recursion to construct the tree
Handle leaf and non-leaf nodes separately
Ensure each node has 0 or 2 children
Round duration - 60 minutes
Round difficulty - Medium
My interviewer introduced himself in the beginning and asked for my introduction.
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
Given a sorted alien dictionary in an alien language, determine the character order of the language.
Iterate through the dictionary to build a graph of character dependencies.
Perform a topological sort on the graph to determine the character order.
Return the character array representing the order of characters in the alien language.
Tip 1 : Practice ds and algo
Tip 2 : Be confident
Tip 3 : Speak out loud and be clear
Tip 1 : Mention only what you know
Tip 2 : Having Cp ranks is a plus
I appeared for an interview in Dec 2020.
Round duration - 80 minutes
Round difficulty - Medium
This was Online interview
this is one and only interview which was based on totally DSA (Problem Solving Skills)
which was held on AMAZE CHIME
Timing : 12pm
Environment was very good
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the previous, current, and next nodes
Update the links while traversing the list to reverse it
Return the head of the reversed linked list
Imagine there are 'N' people at a party, each assigned a unique ID from 0 to N-1. A celebrity at the party is a person who is known by everyone but knows no one else.
Identify the celebrity at a party where one person knows everyone but is not known by anyone.
Use a two-pointer approach to eliminate non-celebrity candidates.
Start with two pointers at the beginning and end of the party.
If A knows B, A cannot be the celebrity; move A to B.
If A does not know B, B cannot be the celebrity; move B to A.
Repeat until only one person remains; check if this person is known by everyone.
Return t...
Tip 1 : Code Properly, and do more and more practice on DSA
Tip 2 : Understand the concept behind the problem
Tip 3 : Be confident
Tip 1 : Write only topics on which you are confident
Tip 2 : Write important stuff only and try to make one page resume only.
based on 4 interview experiences
Difficulty level
Duration
based on 1 review
Rating in categories
Senior Software Engineer
25
salaries
| ₹14 L/yr - ₹23 L/yr |
Software Engineer
21
salaries
| ₹8 L/yr - ₹12.5 L/yr |
Software Developer
10
salaries
| ₹6 L/yr - ₹18 L/yr |
Customer Success Associate
7
salaries
| ₹4.7 L/yr - ₹7.8 L/yr |
Product Manager
7
salaries
| ₹15 L/yr - ₹22 L/yr |
TCS
Accenture
Wipro
Cognizant