Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
Basic Aptitude questions and some questions related to testing faulty code.
I applied via Campus Placement and was interviewed in Jan 2024. There were 2 interview rounds.
It was good and easy test, all are aptitude questions, at least one coding question was there
Developed a web application for tracking personal fitness goals and progress.
Used HTML, CSS, and JavaScript for front-end development
Implemented a RESTful API using Node.js and Express for back-end functionality
Utilized MongoDB for database management
Incorporated chart.js for visualizing progress data
Reverse a string
Use a loop to iterate through the characters of the string
Swap the characters from start to end of the string
Repeat until the entire string is reversed
Top trending discussions
posted on 29 May 2024
I was interviewed in Dec 2020.
Round duration - 30 Minutes
Round difficulty - Easy
he interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components.
Maintain a visited array to keep track of visited vertices.
For each unvisited vertex, perform DFS to explore all connected vertices and form a connected component.
Given two sorted arrays A
and B
of sizes N
and M
, find the median of the merged array formed by combining arrays A
and B
. If the total number of elements, N + M
, is even, the m...
Find the median of two sorted arrays by merging them and calculating the middle element(s).
Merge the two sorted arrays into one sorted array.
Calculate the median based on the total number of elements in the merged array.
If the total number of elements is even, take the mean of the two middle elements as the median.
Tip 1 : Don't forget to revise OOPS, OS, DBMS too.
Tip 2 : During the interview, one thing that is asked for sure is the time complexity of your solution, so always know the complexity of your algorithms.
Tip 3 : Try out mock interviews with friends, that's the best thing you can do for yourself other than practicing
questions
Tip 1 : Make sure that there are no formatting errors
Tip 2 : Have your projects clearly mentioned and well explained
I was interviewed in Oct 2020.
Round duration - 120 mintues
Round difficulty - Medium
Aptitude round was in afternoon around 3 pm and every person who has given aptitude round was also given an other chance which was coding round. There was a time gap of 1 hr between two test. both of these went online. Environment was good without any lag. Webcam was on throughout the test. There were 3 coding questions, of which 2 were medium and one was easy. I attempted all of them.
You are given a string named str
and an integer D
. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string by D
units, start...
Implement left and right string rotations by D units on a given string.
Implement leftRotate() function to return string after left rotation by D units.
Implement rightRotate() function to return string after right rotation by D units.
Consider handling edge cases like empty string or D exceeding string length.
Example: For input 'coding', D=2, leftRotate() should return 'dingco' and rightRotate() should return 'ngcodi'.
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...
Calculate 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 when calculating the height.
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
The first line contains an integer 'T' representin...
The task is to find and output the common strings present in both given arrays of lowercase alphabets for each test case.
Iterate through the elements of the second array and check if they are present in the first array.
Use a hash set or map to efficiently check for common elements.
Return the common strings in the order they appear in the second array.
Round duration - 40 minutes
Round difficulty - Medium
This round was at 12 pm. Interviewer and I greeted each other and then he asked me to explain all the questions I had done during test. He shared screen with my report of test which was having the solutions I typed during coding rounds. It took around 20 minutes to explain all three questions. Interviewer was happy with my explanation. Then he had asked me one coding question and various questions based on my project. I answered him all with a smile.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum efficiently.
Initialize two variables, one for current sum and one for maximum sum.
Iterate through the array and update the current sum and maximum sum accordingly.
Return the maximum sum as the result.
Round duration - 30 minutes
Round difficulty - Medium
It was in afternoon. HR called to me to fix a meeting on Microsoft teams. He was very polite with experience of corporate environment.
Tip 1 : Properly grasp Data Structures and Algorithms from basics. Cramming problems would not help.
Tip 2 : Try platforms like code-zen for practice. Its a good platform with selected questions.
Tip 3 : Do at least 2 projects in which you are confident enough to answer anything the interviewer ask.
Tip 4 : Be confident with a smile on face during interviews.
Tip 1 : Just one page resume, not more than that for freshers.
Tip 2 : Make it as attractive/catchy as you can. Interviewers don't spend much time while reading your resume.
I was interviewed in Sep 2020.
Round duration - One hour aptitude,1.5 hour coding
Round difficulty - Medium
First round was of aptitude that was easy and second round was of coding which had medium level questions.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for efficient prime number identification
Optimize by only checking up to the square root of N for divisors
Round duration - 20 minutes
Round difficulty - Medium
First I was asked about my projects and then 2 questions on array were given.
Given an integer array/list arr
and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
The first line c...
Count the total number of unique pairs in an array whose elements sum up to a given value.
Use a hashmap to store the frequency of each element in the array.
Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.
Increment the count of pairs if the complement exists in the hashmap.
Divide the count by 2 to avoid counting duplicates (arr[i], arr[j]) and (arr[j], arr[i]) separ
Tip 1 : Data structures should be on your tips.
Tip 2 : Learn how to make logic.
Tip 3 : Be confident while giving the interview.
Tip 1 : Add projects with description.
Tip 2 : Be true to yourself in resume.
DSA questions of array and strings
posted on 19 May 2022
I was interviewed before May 2021.
Round duration - 120 minutes
Round difficulty - Medium
It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)
Generate a pattern based on the input number of rows N. Each row i should start with the i-th letter of the alphabet, and the number of letters in the row should match ...
Generate a character pattern based on the input number of rows N, where each row starts with the i-th letter of the alphabet and contains i letters.
Create an array to store each row of the pattern
Iterate from 1 to N, for each row i, generate the string starting with the i-th letter of the alphabet and containing i letters
Add each generated string to the array
Return the array of strings as the output
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values with specified functions.
Use two queues to simulate stack operations efficiently.
Maintain one queue for storing elements and another for temporary storage during push operation.
Ensure to handle edge cases like empty stack and maximum size limit.
Example: Push operation involves transferring elements from one queue to another before adding the new element.
Example...
Round duration - 60 minutes
Round difficulty - Medium
My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the input string length and number of test cases.
Round duration - 150 minutes
Round difficulty - Easy
This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them
Tip 1 : Be confident, clear and calm with the answers during interview
Tip 2 : Practice coding questions on based on different difficulty
Tip 3 : Prepare the topics thoroughly the questions might not be tough but they would be based on the core concept
Tip 4 : You should have at least 2 projects - JAVA and database related or Data Analytics
Tip 1 : Projects are mandatory you can steer the interview in that direction
Tip 2 : Resume should only have what you actually know and did
Tip 3 : Add extra-curriculars (for Sapient it really matters if you have incidents related team building, leadership, conflict resolution experiences)
I applied via Campus Placement and was interviewed before Oct 2022. There were 5 interview rounds.
Normal MCQ style questions involving basic concepts
2 coding questions: 1st one average, 2nd one slightly better than average.
posted on 16 Sep 2021
I was interviewed in Dec 2020.
Round duration - 45 Minutes
Round difficulty - Easy
This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
An E-R Diagram for Uber would include entities like User, Driver, Ride, Payment, and Location.
Entities: User, Driver, Ride, Payment, Location
Relationships: User requests Ride, Driver provides Ride, Payment for Ride
Attributes: User ID, Driver ID, Ride ID, Payment ID, Location ID
Example: User (1) requests Ride (A) from Location (X) to Location (Y) with Driver (Z) providing the Ride and Payment (123) made for the Ride.
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
All the possibl...
Find the path from a leaf node to the root node with the maximum sum in a binary tree.
Traverse the binary tree from leaf nodes to the root while keeping track of the sum of each path.
Compare the sums of all paths and return the path with the maximum sum.
Use recursion to traverse the tree efficiently.
Consider edge cases such as when the tree is empty or has only one node.
Round duration - 30 Minutes
Round difficulty - Easy
The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum digits
Handle cases where one list is longer than the other by adding remaining digits with carry
Remember to handle the case where there is a carry after adding all digits
Round duration - 15 Minutes
Round difficulty - Easy
Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.
Tip 1 : Contribute time for course subjects also like OS,DBMS,OOPS.
Tip 2 : Start practicing on Leetcode and InterviewBit 1 month before your Placement Drive and try solving approx 300+ questions.
Tip 3 : Regularly Participate in Coding Contests on CodeForces and try to be Expert.
Tip 1 : Don't try to lie in resume as questions can be asked on the same in depth.
Tip 2 : Mention atleast 1 project or past work experience.
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Associate Technical Support Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
RateGain
RezNext Global Solutions
AxisRooms
Hotelogix