Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Ameyo Team. If you also belong to the team, you can get access from here

Ameyo Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Ameyo SDE Interview Questions and Answers

Updated 8 Jun 2015

7 Interview questions

A SDE was asked
Q. How do you retrieve the mth element from a stack containing n elements (where n > m) without using an additional stack?
Ans. 

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 SDE was asked
Q. Given a string, print all permutations of the string.
Ans. 

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

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Amazon
Q4. Describe a scenario where you were given updates on repaired road ... read more
asked in Nagarro
Q5. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
A SDE was asked
Q. How would you sort a linked list where alternate nodes are already sorted?
Ans. 

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 SDE was asked
Q. Write a function to delete nodes from a Dequeue.
Ans. 

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

A SDE was asked
Q. Given a sorted array A of size m+n, where the first m elements are filled with sorted elements, and another sorted array B of size n, merge the elements of B into A such that A contains all m+n elements in ...
Ans. 

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.

A SDE was asked
Q. What are the uses, advantages, and disadvantages of macros compared to functions?
Ans. 

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

A SDE was asked
Q. Major training Future plans n all
Ans. 

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

Are these interview questions helpful?

Ameyo SDE Interview Experiences

1 interview found

SDE Interview Questions & Answers

user image Anonymous

posted on 8 Jun 2015

Interview Questionnaire 

12 Questions

  • Q1. Sort the linklist by node whose alternate nodes are already sorted
  • Ans. 

    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.

  • Answered by AI
  • Q2. Print all permutations of string
  • Ans. 

    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

  • Answered by AI
  • Q3. An array A of size m+n is given whose first m elements are filled up with sorted elements. Another array B with size n filled with sorted elements. Now we have to fill all m+n elements of both array in arr...
  • Ans. 

    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.

  • Answered by AI
  • Q4. Function pointers
  • Q5. Uses and advantages and disadvantages Macros over functions
  • Ans. 

    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

  • Answered by AI
  • Q6. Get mth element of an stack which is filled up with n elements. where n>m without using another stack
  • Ans. 

    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

  • Answered by AI
  • Q7. Make a function to delete nodes from Dequeue
  • Ans. 

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

  • Answered by AI
  • Q8. Started with tell me about yourself
  • Q9. Then asked why my pointer are 7.8 only
  • Q10. From my extracurricular he said that I was not focused to study only
  • Q11. Then he started asking about my project and other technical stuffs I did in my college life
  • Q12. Major training Future plans n all
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about Ameyo?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Hourglass Pattern Problem Statement

    Given an integer 'N', print an hourglass pattern based on the value of 'N'.

    Input:

    The first and only line of input contains an integer, denoting the value of N.

    Out...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    BFS Traversal in a Graph

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

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Sort a Stack Problem Statement

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

  • Ans. 

    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.

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

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.

  • Q1. 

    Next Smaller Palindrome Problem Statement

    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.

    Example:

    Input:
    T...
  • Ans. 

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

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Development in GurgaonEligibility criteriaAbove 7 cgpaZIGRAM interview preparation:Topics to prepare for the interview - OOPS , Data Structures, Dynamic Programming, Algorithms from variuos coding platforms , Database Management System, Operating System, Web developmentTime required to prepare for the interview - 2 monthInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Amazon
Q4. Describe a scenario where you were given updates on repaired road ... read more
asked in Nagarro
Q5. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Implement tail -f command

Round 2 - Technical 

(2 Questions)

  • Q1. Kafka partitions
  • Q2. Elasticsearch queries
Round 3 - HR 

(2 Questions)

  • Q1. Why Browserstack?
  • Ans. 

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

  • Answered by AI
  • Q2. Any challenge you faced at current company?
  • Ans. 

    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

  • Answered by AI
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Explain basics of c#
  • Ans. 

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

  • Answered by AI
  • Q2. C# basics oops sql server

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare basics

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Implement tail f
  • Ans. 

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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn development along with DSA
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Walk-in and was interviewed in Jun 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Basic Logical programs

Round 2 - Technical 

(4 Questions)

  • Q1. Explain laravel Structure
  • Ans. 

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

  • Answered by AI
  • Q2. Database migration
  • Q3. What is indexing in database
  • Ans. 

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

  • Answered by AI
  • Q4. What is controller ,What is Route
Round 3 - HR 

(2 Questions)

  • Q1. Why you leave your previous Company
  • Q2. What is your role in previous company

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.

Round 1 - Aptitude Test 

Simple aptitude think logically

Round 2 - Coding Test 

Basic coding string and array concepts

Round 3 - Technical 

(2 Questions)

  • Q1. Object Oriented concepts
  • Q2. Basic coding questions
Round 4 - HR 

(1 Question)

  • Q1. Object Oriented concepts

Interview Preparation Tips

Interview preparation tips for other job seekers - Strong in oops and basic coding questions
Are these interview questions helpful?
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I appeared for an interview in Sep 2024.

Round 1 - Aptitude Test 

Mixture of aptitude and coding questions

Round 2 - Assignment 

Implementing a design shown on paper, using php

Interview Preparation Tips

Interview preparation tips for other job seekers - avoid this company one of the worst.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Mar 2024, where I was asked the following questions.

  • Q1. Technical questions asked
  • Q2. And also about last company experiences

Interview Preparation Tips

Interview preparation tips for other job seekers - Ask for Sandwich leave policy, Work from home and Resignation terms
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview in Feb 2025.

Round 1 - Aptitude Test 

It was simple and easily solvable.

Round 2 - Coding Test 

There was 2 programs must pass the testcases.

Round 3 - Coding Test 

There was written test of programming.

Round 4 - HR 

(2 Questions)

  • Q1. Why you choose infiniti
  • Ans. 

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

  • Answered by AI
  • Q2. Share about your self
  • Ans. 

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

  • Answered by AI
Round 5 - Technical 

(2 Questions)

  • Q1. Oops concepts in java
  • Q2. Features

Skills evaluated in this interview

Ameyo Interview FAQs

What are the top questions asked in Ameyo SDE interview?

Some of the top questions asked at the Ameyo SDE interview -

  1. An array A of size m+n is given whose first m elements are filled up with sorte...read more
  2. Get mth element of an stack which is filled up with n elements. where n>m witho...read more
  3. Sort the linklist by node whose alternate nodes are already sor...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Ginesys Interview Questions
3.8
 • 64 Interviews
BrowserStack Interview Questions
3.6
 • 50 Interviews
ZIGRAM Interview Questions
3.5
 • 42 Interviews
Fleetx.io Interview Questions
3.6
 • 29 Interviews
RGBSI Interview Questions
3.3
 • 27 Interviews
LambdaTest Interview Questions
4.5
 • 26 Interviews
Fingent Interview Questions
4.2
 • 25 Interviews
View all
Product Engineer
70 salaries
unlock blur

₹2.5 L/yr - ₹9 L/yr

Senior Product Engineer
42 salaries
unlock blur

₹4.4 L/yr - ₹12.6 L/yr

Product Support Engineer
33 salaries
unlock blur

₹3.2 L/yr - ₹9.1 L/yr

Associate Technical Leader
25 salaries
unlock blur

₹7.5 L/yr - ₹20.7 L/yr

Sales Manager
20 salaries
unlock blur

₹8.5 L/yr - ₹26 L/yr

Explore more salaries
Compare Ameyo with

Aurigo

4.7
Compare

Prime Focus Technologies

3.3
Compare

Peel-works

3.6
Compare

Yodlee

3.9
Compare
write
Share an Interview