Filter interviews by
I was interviewed in Jan 2021.
Round duration - 105 minutes
Round difficulty - Medium
Yes, here comes the technical Round. Like other casual Interviews, it started with my introduction. and then the Interviewer asked me about OOPs Concepts and for every concept he asked for an example code. it took around 20 mins for this round and next he started asking questions from my project ( in which I mentioned ML Project ). From this he has asked Like why do you choose this algorithm and why did you learned ML. After That he moved to the problem solving part. He asked 6 questions on Problem solving. this took me around 30 mins to solve. I'll mention those problems in the below section. And he started asking me about tree's implementation. I answered him the theoretical part for the questions asked. and furtherly he asked me 6-7 SQL queries which took me around 20mins I remember. And from there he started asking questions about CN and OS. As I don't know about them- I replied Like i didn't have much Knowledge In these Sessions but I have Learned Some new technologies that are trending in the market. So, the key point for every Interview is like- we need not to be know everything it is up to us to in which area we are having interest and finally you should be able to show that you are expert in that and one more thing- Any job role is not expecting to be good at only one area of tech- So you should be able to convince the Interviewer that you are capable of understanding, learning new tech and to be have good team working skills.
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in O(N) time complexity and O(1) space complexity.
Start with two pointers, slow and fast, moving at different speeds. If they meet at some point, there is a cycle.
If the fast pointer reaches the end of the list (null), there is no cycle.
Check if the n...
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Merge Sort is a divide and conq...
Implement merge sort algorithm to sort a singly linked list of integers.
Divide the linked list into two halves using slow and fast pointers.
Recursively sort the two halves.
Merge the sorted halves using a merge function.
Handle the base case of empty or single node list.
Ensure the termination of the linked list with -1 at the end.
Example: For input 3 1 2 -1, output should be 1 2 3 -1.
You are provided with a square matrix. Your task is to determine if the matrix is symmetric. Return true
if it is symmetric, otherwise return false
.
A matrix is co...
Determine if a square matrix is symmetric by checking if its transpose is equal to itself.
Iterate through the matrix and compare each element with its corresponding element in the transpose
If any pair of elements are not equal, return false immediately
If all pairs are equal, return true at the end
You are given a N x M
matrix of integers. Your task is to return the spiral path of the matrix elements.
The first line contains an integer 'T' which denotes the nu...
The task is to return the spiral path of elements in a given matrix.
Iterate through the matrix in a spiral path by adjusting the boundaries at each step.
Keep track of the direction of traversal (right, down, left, up) to cover all elements.
Handle edge cases like when the matrix is a single row or column.
Implement a function that takes the matrix dimensions and elements as input and returns the spiral path.
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.
The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.
Consider edge cases like a single node tree or empty tree while calculating the height.
Round duration - 45 minutes
Round difficulty - Medium
In this round Company Director for India team and HR has joined.
I started with my Introduction and he has asked what I know about the Company. I started saying everything from google and Wikipedia and from their official site. As this is a off campus recruitment he started explaining about the company what they do and the job role I have applied for. He said that the job was very challenging one and we'll be closely dealing with clients and meeting their expectations is quite challenging for the role. and then he started asking some real HR questions. for which I have answered in a cool way
Tip 1 : Basics of technology you know and work proof ( can be projects or events you have conducted ) for that particular technology is must.
Tip 2 : Even if you are not good at a particular technology, try to be best at some other technology.
Tip 3 : Never show of your weakness. and never in technology. There must be some, be you good at a particular thing. so find it out and become expertise in that.
Tip 1 : Hide some interesting facts about you in the resume, So that you can impress the recruiter during the interview.
Tip 2 : Don't try online resumes, Instead you can make your own resume in MS Word to stand out from others. For me it took 2-3 hours to learn making resume in word and to complete it.
Quantitative Aptitude
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
I applied via Campus Placement and was interviewed in Nov 2021. There were 7 interview rounds.
Online education platforms have become popular in current society.
Online courses offered by universities and colleges
Platforms like Coursera, Udemy, and edX
Increased accessibility to education for people in remote areas
Flexible learning schedules for working professionals
Affordable education options
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
It's was MCQ based test
Some OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation details and showing only the necessary features
A Guid Id is a globally unique identifier used in software development to uniquely identify objects or entities.
Guid Ids are 128-bit integers represented as a hexadecimal string.
They are typically used in databases, APIs, and various software systems to ensure uniqueness.
Example: 6B29FC40-CA47-1067-B31D-00DD010662DA
I applied via Approached by Company and was interviewed before Oct 2023. There was 1 interview round.
I applied via Referral and was interviewed before Apr 2023. There was 1 interview round.
based on 1 review
Rating in categories
Senior Associate
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Randstad
Team Lease
Quess
ManpowerGroup