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.
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.
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.



ARR_2D = [
[0, 1],
[2, 3, 4],
[],
[5]
]
The computed ‘ARR_1D’ should be as follows:
ARR_1D = [0, 1, 2, 3, 4, 5]
So, the printed output will be: 0 1 2 3 4 5
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
Can be solved using closures.
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.



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.
- 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 enable alerting.

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