Filter interviews by
I applied via Approached by Company and was interviewed before Dec 2023. There were 7 interview rounds.
Link for an Hacker rank test provided with a mix of Medium & Hard Leetcode style problems
Full-Stack Application assignment was provided
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
I applied via Job Portal and was interviewed before Nov 2021. There were 5 interview rounds.
A generic problem solving scenario.
Alation interview questions for popular designations
posted on 19 Sep 2021
I applied via Naukri.com and was interviewed before Sep 2020. There were 6 interview rounds.
I appeared for an interview in Jun 2021.
Round duration - 180 minutes
Round difficulty - Hard
The test link had 3 days expiry so I could attempt test anytime. It was conducted on doselect.com
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
An equilibr...
The task is to find the equilibrium indices of a given sequence, where the sum of elements at lower indices is equal to the sum of elements at higher indices.
Iterate through the sequence and calculate the total sum of all elements
Initialize a left sum and right sum as 0
For each index, update the left sum and right sum and check if they are equal
If they are equal, add the index to the equilibrium indices
Return the equil
Round duration - 60 minutes
Round difficulty - Medium
Video interview round wherein I was asked to wrote code for the problem statements given by the interviewer. The problems were mainly focused on advanced JS concepts like asynchonous progamming, timers, closures, and data structure problems around arrays, sets, linked list etc.
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...
The task is to rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
Iterate through the linked list to find the middle node using the slow and fast pointer technique.
Reverse the second half of the linked list.
Merge the first and reversed second half of the linked list alternatively to get the desired order.
Round duration - 30 minutes
Round difficulty - Easy
This was the last round with HR wherein they judged cultural fit and there was discussion on things like my expectations v/s their expectations etc.
Tip 1 : Get well versed with the fundamentals of Javascript including advanced concepts like promises, async/await, generators, higher order functions, closures, currying etc.
Tip 2 : Do some projects on MERN Stack because a lot of projects here use some or all of those technologies
Tip 3 : Do prepare for behavioral/cultural-fit questions especially around how you'll handle various stituations during work or how will you manage productivity while working remotely.
Tip 1 : Having projects on MERN stack will give you advantage
Tip 2 : Do mention if you have any AWS experience.
Tip 3 : Mention all your internships/past experiences. Keep them crisp and talk about what you did and it's impact/outcome.
Tip 4 : Any experience/exposure to blockchain will definitely give brownie points.
I appeared for an interview in Nov 2021.
Round duration - 30 minutes
Round difficulty - Easy
This round mainly consisted of some questions on advanced JS topics like Execution Context, Callback queue, Micro task queue, Promises, etc.
Round duration - 60 minutes
Round difficulty - Medium
This round was more technical compared to the previous one. The interviewer was a senior developer. If questions were not answered, answers would be given/explained.
Aggregate operators in MongoDB are used for data aggregation and manipulation.
Some aggregate operators in MongoDB include $sum, $avg, $min, $max, $push, $addToSet, $first, $last, $project, $match, $group, $sort, $limit, $skip.
Example: db.collection.aggregate([{$group: {_id: '$field', total: {$sum: '$value'}}}])
Round duration - 30 minutes
Round difficulty - Easy
This round was mainly to assess my experience level, roles, and responsibilities from my previous company. Salary negotiations also happened here.
Tip 1 : Learn about Execution Context, Promises in JS
Tip 2 : Learn about indices, Difference between different databases
Tip 3 : Error handling and Exceptions
Tip 1 : Put in what you’ve done and not what you could have done.
Tip 2 : Keep it short and simple
posted on 11 Sep 2024
I appeared for an interview before Sep 2023.
A function in C to check if a number is prime or not
Create a function that takes an integer as input
Check if the input number is divisible by any number from 2 to its square root
If it is not divisible by any number, return true (prime), else return false (not prime)
Basic codes for array manipulation including sorting, searching, and filtering.
Use built-in functions like sort() for sorting arrays.
Implement algorithms like binary search for searching in arrays.
Utilize filter() method for filtering arrays based on specific criteria.
Always be confident and make an effort to listen before you speak.
based on 3 interviews
Interview experience
Software Engineer
9
salaries
| ₹19 L/yr - ₹35 L/yr |
Sdet
9
salaries
| ₹14 L/yr - ₹27 L/yr |
Senior Software Engineer
8
salaries
| ₹25.5 L/yr - ₹40 L/yr |
Senior Technical Support Engineer
5
salaries
| ₹24.8 L/yr - ₹27.3 L/yr |
Technical Support Engineer
4
salaries
| ₹18.8 L/yr - ₹25.1 L/yr |
Yalamanchili Software Exports
Global Edge Software
Fleetx.io
SurePrep