Filter interviews by
Be the first one to contribute and help others!
I applied via Recruitment Consultant and was interviewed before Oct 2020. There were 3 interview rounds.
I applied via Referral and was interviewed in Feb 2020. There were 6 interview rounds.
posted on 12 Jul 2016
I applied via Campus Placement
The question is about finding the minimum steps to reach from a source string to a destination string using three operations.
BFS and DFS are graph traversal techniques that can be used to solve this problem.
BFS is typically used when finding the shortest path or exploring all possible paths in a graph.
DFS is useful when searching for a specific path or exploring deeply into a graph.
In this case, BFS can be used to find...
posted on 14 Jul 2017
I applied via Recruitment Consultant and was interviewed before May 2020. There were 3 interview rounds.
Clone a linked list with random pointers.
Create a new node for each node in the original list.
Store the mapping between the original and cloned nodes in a hash table.
Traverse the original list again and set the random pointers in the cloned list using the hash table.
Return the head of the cloned list.
I applied via Referral and was interviewed in Nov 2023. There were 6 interview rounds.
Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.
Using Bitwise OR operation to find the smallest missing number in an array.
Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask
Iterate through the bitmask to find the first unset bit, which represents the smallest missing number
Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Pseudo code for a scenario
Define variables and data structures needed
Write the main logic using conditional statements and loops
Handle edge cases and error conditions
Test the pseudo code with sample inputs
I appeared for an interview in Feb 2025, where I was asked the following questions.
I have over 5 years of experience in software development, specializing in web applications and cloud technologies.
Developed a full-stack web application using React and Node.js, improving user engagement by 30%.
Led a team of 4 developers in creating a microservices architecture for a scalable e-commerce platform.
Implemented CI/CD pipelines using Jenkins and Docker, reducing deployment time by 50%.
Worked with Agile met...
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k
Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1
Note : consider array index starts with 1
based on 4 reviews
Rating in categories
Fashion Faculty
4
salaries
| ₹0.9 L/yr - ₹5 L/yr |
Finance Executive
3
salaries
| ₹3 L/yr - ₹3 L/yr |
Faculty
3
salaries
| ₹2 L/yr - ₹5 L/yr |
Senior Counsellor
3
salaries
| ₹4.2 L/yr - ₹4.2 L/yr |
Educomp Solutions
Pitney Bowes
Trivium Education Services
Global Edge Software