i
Ameyo
Filter interviews by
Sort a linked list by nodes whose alternate nodes are already sorted.
Traverse the linked list and identify the alternate nodes.
Sort the alternate nodes using any sorting algorithm.
Merge the sorted alternate nodes back into the original linked list.
The answer provides a solution to print all permutations of a given string.
Use recursion to generate all possible permutations
Swap characters at different positions to generate different permutations
Use a set to avoid duplicates
Merge two sorted arrays into one sorted array with one traversal.
Use two pointers to track the current elements in arrays A and B.
Compare the elements at the current pointers and insert the smaller one into array A.
Move the pointer of the array from which the smaller element was inserted.
Repeat the above steps until all elements are merged into array A.
Macros are preprocessor directives that replace code at compile time. They offer faster execution but can be error-prone.
Macros are faster than functions as they are replaced at compile time
Macros can be used for conditional compilation
Macros can be used to define constants
Macros can be error-prone as they do not undergo type-checking
Macros can make code harder to read and debug
To get the mth element of a stack with n elements, without using another stack.
Create a temporary variable to store the mth element
Pop the top (n-m) elements from the stack and discard them
Pop and store the mth element in the temporary variable
Push back the discarded elements to the stack
Return the temporary variable as the result
A function to delete nodes from a Dequeue.
Create a function that takes the Dequeue and the value of the node to be deleted as parameters.
Traverse the Dequeue to find the node with the given value.
If the node is found, update the pointers of the previous and next nodes to bypass the node to be deleted.
If the node is the first or last node, update the head or tail pointers accordingly.
Free the memory allocated to the nod...
I have completed my major training in computer science and have future plans to specialize in software development.
Completed major training in computer science
Future plans to specialize in software development
Continuously learning and updating skills
Attending relevant workshops and conferences
Building personal projects to enhance practical knowledge
Top trending discussions
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
I applied via Naukri.com and was interviewed before Jan 2024. There was 1 interview round.
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
posted on 22 Nov 2024
Application developement
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.
I appeared for an interview in Sep 2024.
Mixture of aptitude and coding questions
Implementing a design shown on paper, using php
I appeared for an interview before Mar 2024, where I was asked the following questions.
Some of the top questions asked at the Ameyo SDE interview -
Product Engineer
75
salaries
| ₹2.2 L/yr - ₹9 L/yr |
Senior Product Engineer
46
salaries
| ₹4.4 L/yr - ₹11.1 L/yr |
Product Support Engineer
29
salaries
| ₹3.2 L/yr - ₹10.9 L/yr |
Sales Manager
24
salaries
| ₹8.5 L/yr - ₹22.1 L/yr |
Associate Technical Leader
24
salaries
| ₹7.5 L/yr - ₹20.7 L/yr |
Aurigo
Prime Focus Technologies
Peel-works
Yodlee