Udaan
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Create APIs for a Quiz platform
Design RESTful APIs for creating, updating, deleting, and retrieving quizzes
Include endpoints for managing quiz questions, answers, and user responses
Implement authentication and authorization mechanisms for secure access
Utilize JSON format for data exchange between client and server
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
Implement your own state management in React and integrate it into a React application.
I applied via Approached by Company and was interviewed before Jan 2023. There were 3 interview rounds.
Design and code a parking lot application
To ensure no data corruption during asynchronous streaming and processing, use data validation, error handling, and checksums.
Implement data validation techniques to check the integrity of the streamed data.
Handle errors and exceptions properly to prevent data corruption.
Use checksums or hash functions to verify the integrity of the data.
Implement reliable communication protocols like TCP/IP to ensure data integrity.
Co...
Top trending discussions
I applied via Campus Placement
3 questions of dsa
1 of api
Logical reasoning, Quantitative aptitude
Array,Strings,DSA concepts like searching algorithm
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
based on 3 interviews
Interview experience
based on 11 reviews
Rating in categories
Business Development Executive
2.1k
salaries
| ₹1.5 L/yr - ₹5.5 L/yr |
Team Lead
530
salaries
| ₹1.3 L/yr - ₹7.2 L/yr |
MIS Executive
480
salaries
| ₹1.7 L/yr - ₹5.3 L/yr |
Operations Executive
446
salaries
| ₹1.6 L/yr - ₹4.8 L/yr |
Sales Officer
339
salaries
| ₹2 L/yr - ₹6.6 L/yr |
Meesho
Flipkart
Amazon
Snapdeal