i
Ameyo
Filter interviews by
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
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
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.
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 th...
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
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
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 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
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
posted on 30 Oct 2023
C# is a programming language developed by Microsoft for building a wide range of applications on the .NET framework.
C# is an object-oriented language with features like classes, inheritance, and polymorphism.
It is strongly typed, meaning variables must be declared with a specific data type.
C# supports modern programming concepts like async/await for asynchronous programming.
It is commonly used for developing desktop, w...
Implementing 'tail -f' allows real-time monitoring of file changes, displaying new lines as they are added.
Use file handling in Python to open a file in read mode.
Utilize a loop to continuously read new lines from the file.
Implement a sleep function to avoid busy waiting and reduce CPU usage.
Example: Use 'with open(filename) as f:' to manage file context.
Use 'f.seek(0, 2)' to move to the end of the file before reading ...
posted on 6 Dec 2024
I applied via Walk-in and was interviewed in Jun 2024. There were 3 interview rounds.
Basic Logical programs
Laravel is a PHP framework with a structured architecture for building web applications efficiently.
MVC Architecture: Laravel follows the Model-View-Controller pattern, separating logic, presentation, and data.
Directory Structure: Key directories include app (application logic), config (configuration files), and routes (URL definitions).
Eloquent ORM: Laravel provides an Object-Relational Mapping system for database int...
Indexing in databases improves data retrieval speed by creating a data structure that allows quick access to rows in a table.
Indexes are like a book's index, allowing quick location of data without scanning the entire table.
Common types of indexes include B-trees, hash indexes, and full-text indexes.
For example, a B-tree index allows efficient range queries, while a hash index is optimal for equality searches.
Indexes c...
posted on 6 May 2024
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Simple aptitude think logically
Basic coding string and array concepts
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.
posted on 11 Mar 2025
I appeared for an interview in Feb 2025.
It was simple and easily solvable.
There was 2 programs must pass the testcases.
There was written test of programming.
I chose Infiniti for its innovative culture, commitment to excellence, and opportunities for professional growth in software development.
Innovative Culture: Infiniti fosters creativity, allowing developers to work on cutting-edge technologies like AI and machine learning.
Commitment to Excellence: The company's focus on high-quality software aligns with my personal values of delivering robust and reliable solutions.
Prof...
I am a passionate software developer with a strong background in full-stack development and a love for problem-solving.
Education: Bachelor's degree in Computer Science from XYZ University.
Experience: 3 years of experience in developing web applications using React and Node.js.
Projects: Developed an e-commerce platform that increased sales by 30% within the first quarter.
Skills: Proficient in JavaScript, Python, and SQL...
Some of the top questions asked at the Ameyo SDE interview -
Product Engineer
70
salaries
| ₹2.5 L/yr - ₹9 L/yr |
Senior Product Engineer
42
salaries
| ₹4.4 L/yr - ₹12.6 L/yr |
Product Support Engineer
33
salaries
| ₹3.2 L/yr - ₹9.1 L/yr |
Associate Technical Leader
25
salaries
| ₹7.5 L/yr - ₹20.7 L/yr |
Sales Manager
20
salaries
| ₹8.5 L/yr - ₹26 L/yr |
Aurigo
Prime Focus Technologies
Peel-works
Yodlee