Filter interviews by
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
Use Dijkstra's algorithm to find the shortest path to get all keys
Implement Dijkstra's algorithm to find the shortest path in a graph
Consider the keys as nodes in the graph and the paths between keys as edges
Keep track of the keys collected and update the shortest path accordingly
Top trending discussions
3 leetcode hards, followed by some system design
Designing Amazon involves creating a user-friendly e-commerce platform with a vast product selection, efficient search and recommendation algorithms, secure payment processing, and reliable delivery logistics.
Develop a user-friendly interface for easy navigation and product search
Implement recommendation algorithms based on user behavior and preferences
Integrate secure payment processing systems to protect customer inf...
To invert a binary search tree (BST), swap the left and right children of each node recursively.
Start from the root node and recursively swap the left and right children of each node.
Repeat this process for all nodes in the BST.
The final result will be the inverted BST.
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 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
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.
Nice interview experience with easy questions
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Business Analyst
27
salaries
| ₹9 L/yr - ₹24 L/yr |
Senior Analyst
27
salaries
| ₹7.7 L/yr - ₹20.4 L/yr |
Claims Specialist
24
salaries
| ₹5.1 L/yr - ₹10 L/yr |
Team Coordinator
20
salaries
| ₹6 L/yr - ₹20 L/yr |
Supervisor
19
salaries
| ₹8 L/yr - ₹23 L/yr |
Uber
Oyo Rooms