Koo App Interview Questions and Answers

Q1. Basic Kotlin and Android
Add your answer
Q2. MVVM clean Architecutres
Add your answer

Q1. About Jetpack Compose
Add your answer
Q2. Kotlin Coroutines
Add your answer
Q3. Android App Security
Add your answer

Q1. Tell us about your previous work experiences.
Add your answer

To check how customer centric

Q1. Salary discussion
Add your answer

Q1. What are you looking for at Koo?
Ans. Fast moving, growth opportunity, big impact and responsibilities
Answered Anonymously
Add your answer

Q1. 1. Max Sum subarray 2. Detect loop in linked list
Ans. 
Two technical questions related to algorithms and data structures.
• Max Sum subarray: Find the contiguous subarray with the largest sum. Kadane's algorithm is a popular solution.

• Detect loop in linked list: Use two pointers, one moving at twice the speed of the other. If they meet, there is a loop.
Answered by AI
Add your answer
Q2. 1. How is session authenticated in facebook and other websites when we login? 2. How to store large databases? Hashing related.
Ans. 
Session authentication in websites and storing large databases using hashing.
• Session authentication in websites involves creating a unique session ID for each user upon login and storing it in a cookie or server-side session storage.

• The session ID is then used to authenticate subsequent requests from the user.

• Large databases can be stored using hashing techniques such as sharding, consistent hashing, and hash tables.

• Sh...read more
Answered by AI
Add your answer
Q3. 1. Binary Search tree and B+ trees difference
Ans. 
Binary search trees are used for searching and sorting data, while B+ trees are used for indexing and storing data.
• Binary search trees have a maximum of two children per node, while B+ trees have multiple children per node.

• Binary search trees are best for small datasets, while B+ trees are better for large datasets.

• Binary search trees have a faster search time, while B+ trees have a faster insertion and deletion time.

• B...read more
Answered by AI
Add your answer

Q1. 1. Dynamic Programming on Longest Pallindromic Subsequence 2. Greedy Algorithm for Job Scheduling 3. DFS related graph problem
Add your answer
Q2. 1. Current company role 2. Most Challenging aspect
Add your answer

I have been asked 1 DSA question and 1 SQL question as the company came for campus recruitment.

Q1. Discussion on Java and its fundamentals.
Add your answer
Q2. Dynamic Programming question.
Add your answer
Q3. Discussion over projects.
Add your answer

Q1. Basic HR questions like why you want to join us and all.
Add your answer