Tip 1 : Practice basic DSA questions
Tip 2 : Make sure you are giving most optimized solution
Tip 1 : Keep your resume on one page only
Tip 2 : Explain your previous work exp in detail
Before sharing the interview experience, I would suggest all of you prepare for a better product-based company rather than applying to these small startups.
They rejected me after taking 6 rounds without giving any feedback.
============================================================
The interviewer started with an introduction and then moved on to the projects on which I have worked in the company and asked me to explain the last working feature I have developed in my company.
We kept on discussing that feature only like why did you choose hooks or how you like to increase the performance of the order flow.
I answered him by saying we can go with async programming, he was satisfied with it but asked me to learn more about worker threads.
Then for the other 30 mins, he asked me to design Linkedln as it was my very first system design interview so I was quite nervous but I managed to create all the tables and how we will be designing them.
He asked me how would you increase the performance of the database if the no. of records are in millions.
I gave him approach of elastic search but he wanted me to talk about indexes.
Design Linkedin
This round was more focused on my problem-solving skills and all the questions were of DSA only.
The interviewer directly jumped into google docs for asking the question after taking the introduction.



Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.
'triangle' and 'integral'
'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
It was a pretty basic problem, I explained to him multiple solutions and also did a dry run on some sample cases so that he can get an idea of what I am writing.
I took 2 frequency arrays and solved it though it could be done by a single array also.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
This problem was also quite basic, I created one class in which I kept two pointer one for head and other for tail.
I wrote code for reversing the Linkedlist in O(n) time complexity and O(1) space complexity.
He asked me to run it on some inputs and it worked perfectly fine.
This round was taken by the head of engineering, this round was a mixture of DSA as well as system design.



1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
4. If no such index is present in the array, return -1.
I came up with a naive approach using two loops with quadratic time complexity, as expected he asked me to improve it.
I came up with another approach using two arrays so the time complexity was reduced to o(n) and space was increased to o(n).
He asked me to improve this, I did the same thing using a single array and time complexity was still linear only.
He wanted me to improve this further so that we can reduce it to o(n) time and o(1) space with some hints from him I was able to do it using two pointers.
Explain to me the last feature on which you have worked, the discussion on Node.JS, and some tech-related discussions.
HR asked me to complete one gaming round before moving to a further round.
The test was conducted on their own platform and it was just to test your cognitive skills.
Introduction
Salary expectations
Hobbies
Why do you want to leave your current org?
This round was easily passed and I was pretty sure that it went well.
This round was taken by their CEO, he started with an introduction, and how was my overall experience with Grappus?
What do I know about their company/ their services?
What are the best practices that you follow in your org when writing code and why do you want to leave your current org.
I answered everything in the best possible manner and I was expecting an offer letter from them.
I waited for their reply and they mailed me that I was rejected, I asked HR by calling her but she said that we don't have any feedback, I was ready to negotiate in terms of salary also.
I wasted my 2-3 weeks, I wanted to know the reason at least.
I would not recommend anyone to waste their time in such companies rather than that keep preparing for some product-based companies.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?