i
Soroco
Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
2 questions on hakerrank
1) dp question to calculate the frequency of the elements of a tree
2) graph problem to calculate the cost to buy at one city and sell at another
Create a family tree with nodes having at most 2 parents and n children. Implement functions to find preceding and following nodes.
Create a tree structure where each node has references to its parents and children
Implement a function to find all nodes preceding a given node by traversing up the tree
Implement a function to find all nodes following a given node by traversing down the tree
Consider using depth-first search
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
To center a div without using flexbox, use margin auto and set width
Set the width of the div
Use margin: 0 auto; to center horizontally
For vertical centering, use position: absolute; top: 50%; transform: translateY(-50%);
REST APIs work by allowing clients to interact with server resources using standard HTTP methods.
REST stands for Representational State Transfer
Clients make requests to the server using standard HTTP methods like GET, POST, PUT, DELETE
Responses from the server are typically in JSON or XML format
REST APIs are stateless, meaning each request from a client to the server must contain all the information necessary to unders
Top trending discussions
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
In Mu Sigma APT round is divided into 3 sections Quant, Logical and verbal
I applied via Referral and was interviewed before Dec 2023. There were 2 interview rounds.
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include classes, objects, inheritance, polymorphism, and encapsulation.
Classes are blueprints for creating objects, while objects are instances of classes.
Inheritance allows a class to i...
Coding was good and it was based on bubble sort
I was interviewed before Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql
Given two strings, S
and T
with respective lengths M
and N
, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...
The task is to find the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with leng
Round duration - 15 minutes
Round difficulty - Medium
The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.
Round duration - 20 Minutes
Round difficulty - Medium
Similar to first round
For Shortlists after elimination from first round.
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...
Determine if it is possible to accommodate all passenger trips within a car's capacity without exceeding it at any point.
Iterate through each trip and keep track of the total number of passengers in the car at each point.
Check if the total number of passengers exceeds the car capacity at any point.
Return 'True' if all trips can be accommodated within the car capacity, otherwise return 'False'.
Round duration - 20 minutes
Round difficulty - Easy
After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Tip 1 : Be fast ans accurate on your aptitude amd verbal tests.
Tip 2 : In coding round, depending on the difficulty of the questions the time in which you complete solving them should decrease .If almost everyone can solve them timming comes in to the equation for shortlisting
Tip 3 : While submitting your resume, please be honest about the projects you have done and do not bluff about it because in the interview when you ate drilled abt it, they can catch you easily.
Tip 4 : be confident and answer every question to the best of your ability and if u don't know something, tell them you don't know abt it .
Tip 1 : Research the company and put the most revalent projects and skills that the company os looking for specifically
Tip 2 : Do not bluff or lie on your resume. It show's during the interview.
posted on 22 Sep 2023
Coding testing with 15 questions MCQ based
based on 3 interviews
Interview experience
based on 21 reviews
Rating in categories
Software Engineer
117
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Fractal Analytics
Mu Sigma
Tiger Analytics
LatentView Analytics