Koo App Software Engineer II Interview Questions and Answers

Q1. Techical questions and coding questions related profile.
Add your answer
Q2. Basic concepts about your programming skills.
Add your answer

Q1. Delete nth node from end in linked list
Ans. 
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
• Use two pointers, one to traverse the list and another to keep track of the nth node from the end.

• Move the second pointer n steps ahead of the first pointer.

• When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.

• Adjust the pointers to delete the nth node.
Answered by AI
Add your answer
Q2. Project discussion
Add your answer

Q1. It was a DS round, he asked me about queue and internals of Hash Map in java and them android questions on work manager and MVVM
Add your answer

Q1. It was Android Fundamentals round, was asked on my work in current company and architectures.
Add your answer

Q1. It was a round with director, was asked a HLD question on how to create a driver monitoring app to calculate speed and then on how to design an app like blinkit.
Add your answer

Easy to medium, can solve with leetcode medium

Q1. Number of islands count
Ans. 
Count the number of islands in a grid of '1's and '0's
• Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited

• Increment the island count for each new island found

• Ensure to handle boundary cases and check for visited nodes
Answered by AI
Add your answer
Q2. First and last index of a particular element in an array
Ans. 
Find the first and last index of a specific element in an array of strings.
• Iterate through the array and keep track of the index of the first and last occurrence of the element.

• Return the first and last index once the iteration is complete.

• Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Answered by AI
Add your answer

Q1. React, React Native Basics
Add your answer
Q2. Coding Arrays & Objects
Add your answer

Q1. How set is implemented?
Ans. 
A set is implemented as a data structure that stores unique elements with no specific order.
• A set does not allow duplicate elements.

• Sets are commonly implemented using hash tables or binary search trees.

• Examples of set implementations include HashSet in Java and std::set in C++.
Answered by AI
Add your answer
Q2. How unordered set is implemented?
Ans. 
Unordered set is typically implemented using hash tables.
• Uses hash tables to store elements with unique keys

• Provides constant time complexity for insertion, deletion, and lookup operations

• Does not maintain any specific order of elements
Answered by AI
Add your answer

Easy level Basics were asked

Stacks queue leetcode easy level

Q1. Basic project discussion
Add your answer
Q2. Skills used in project
Ans. 
Used skills include Java, SQL, Spring Boot, RESTful APIs, and Git.
• Java programming for backend development

• SQL for database management

• Spring Boot for creating web applications

• RESTful APIs for communication between systems

• Git for version control
Answered by AI
Add your answer

Q1. Design api to buy books
Ans. 
Design an API for buying books
• Create endpoints for browsing books, adding to cart, and making payment

• Include authentication and authorization for secure transactions

• Implement search and filtering functionalities for easy book selection

• Provide endpoints for managing user profiles and order history
Answered by AI
Add your answer