Filter interviews by
I was interviewed in Apr 2022.
Round duration - 30 minutes
Round difficulty - Easy
This was just a screening round to check my intention and communication skills. They just asked me why was I looking for a job change, and told me a little bit about the profile.
Why are you looking for a job change? Are there any problems that you are facing in your current company?
Tip 1 : Keep the answers generic, do not bash or talk ill about your current company as it might create a bad impression.
Tip 2 : Some points that I presented were that I wanted to widen by domain, looking for better opportunities, etc.
Round duration - 45 Minutes
Round difficulty - Easy
Since I had applied for a full stack profile, this round mainly consisted of front-end questions and some basic DSA questions. They had scheduled a call in the afternoon around 14:00 and the call was on Google meet where I had to share my screen and type in some code, once I was happy with my code and it worked fine, I had to paste it into the google doc. Actually, they had outsourced the interview rounds to the Interview Vector.
Basic DFS.
- Create an empty array and call it the result.
- Loop over the content of the array if it's a number push it into the result array else recursively call the function.
- Return the resultant array.
Write a polyfill for JS Array.reduceReduce is a higher order function that operates on an array and returns 1 single value.
Create the custom reduce function and add it to Array.prototype
Implement the following function:sum(1)(2)(3)(4)() returns 10sum(1)() returns 1sum() returns 0
Round duration - 90 Minutes
Round difficulty - Easy
This round consisted of multiple easy DSA questions, some frontend questions, and one thought experiment related to design. Again, this round was conducted around 14:00 in the afternoon.
- Compare length of the strings and if they are not equal return false.
- Take a hashmap and store the number of occurrences of each letter in the first string.
- Iterate over the second string and if the ith character is not in the hashmap or the frequency is 0 then return false.
- return true.
Let's say that some of our clients are complaining that our website is really slow/crashing for them. What could be possible solutions and how would you identify the problems.
Tip 1 : Mention the common solutions like optimizing assets, and bundle size.
Tip 2 : Think out of the box, maybe the problem was faced by people of a certain geographic location, check your load balancers, pods, use CDN, etc.
Tip 3 : Provide some solutions, in case we can't figure out whats happening because we are not able to reproduce the problem, add some analytics and crashlytics like Sentry in the frontend and enab
Tip 1 : DSA is important, practice around 150+ questions minimum.
Tip 2 : For the front end, JS is a must! Learn the basics and how it works under the hood.
Tip 3 : Learn SOLID and Design patterns.
Tip 1 : Keep it short and simple. Specify your projects and/or experiences.
Tip 2 : Even naming your resume helps, instead of naming it "resume.pdf" name it like "____resume.pdf". It actually helps recruiters and I got positive feedback for this.
Top trending discussions
I applied via Job Fair and was interviewed in Dec 2024. There were 3 interview rounds.
OA test 3 Dsa questions 2 medium 1 hard you have to solve 1.5 questions in 120 minutes
DSA 2 question
1 -> Find Lca and traverse a tree path available on GFG
2 -> LinkedList pallindrome check (you have to solve that in 0(1) space complexity)
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
I applied via campus placement at Netaji Subhas Institute of Technology (NSIT) and was interviewed in Jul 2024. There were 4 interview rounds.
It was a coding round where i need to solve 3 DSA Questions in 1.5 hour
I applied via Newspaper Ad and was interviewed in Jul 2024. There was 1 interview round.
My previous organization was a fast-paced tech startup focused on developing cutting-edge software solutions.
Highly collaborative work environment
Emphasis on innovation and creativity
Agile development methodologies were followed
Regular team meetings and code reviews
Opportunities for professional growth and learning
Create a timer using React
Use useState hook to store the timer value
Use useEffect hook to update the timer every second
Display the timer value in the component's render method
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
3 question only simple
Use Floyd's Tortoise and Hare algorithm to detect loop in linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a loop in the linked list.
based on 10 reviews
Rating in categories
Operations Analyst
459
salaries
| ₹2.2 L/yr - ₹7 L/yr |
Relationship Manager
237
salaries
| ₹2.5 L/yr - ₹5.1 L/yr |
Team Lead
201
salaries
| ₹2.8 L/yr - ₹8.5 L/yr |
CAR Consultant
155
salaries
| ₹2.1 L/yr - ₹4.2 L/yr |
Assistant Manager
144
salaries
| ₹3.6 L/yr - ₹11 L/yr |
Truebil
CarDekho
Carwale
Cartrade.com