Add office photos
Filter interviews by
Koo App Software Engineer II Interview Questions and Answers
Koo App Software Engineer II Interview Experiences
1 interview found
Anonymous
Selected
I applied via Approached by Company and was interviewed in Dec 2022. There were 4 interview rounds.
(1 Question)
- Q1. What are you looking for at Koo?
- Ans. Fast moving, growth opportunity, big impact and responsibilities
(3 Questions)
- 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.
- 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...
- 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...
(2 Questions)
- Q1. 1. Dynamic Programming on Longest Pallindromic Subsequence 2. Greedy Algorithm for Job Scheduling 3. DFS related graph problem
- Q2. 1. Current company role 2. Most Challenging aspect
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Selected
(2 Questions)
- Q1. Explain hoisting in js
- Ans.
Hoisting in JavaScript is the behavior where variable and function declarations are moved to the top of their containing scope during the compilation phase.
Variable declarations are hoisted to the top of their scope, but not their assignments.
Function declarations are fully hoisted, meaning they can be called before they are declared.
Hoisting can lead to unexpected behavior if not understood properly.
- Q2. Explain closures in js
- Ans.
Closures in JavaScript allow functions to access variables from their outer scope even after the outer function has finished executing.
Closures are created when a function is defined within another function and the inner function has access to the outer function's variables.
Closures can be used to create private variables and functions in JavaScript.
Closures can also be used to maintain state in asynchronous operations
(1 Question)
- Q1. Javascript polyfills
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
(1 Question)
- Q1. Flatten a binary tree
- Ans.
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Skills evaluated in this interview
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
(2 Questions)
- Q1. Explain call, apply , bind
- Ans.
Call, apply, and bind are methods in JavaScript used to manipulate the context of a function.
Call: Invokes a function with a specified 'this' value and arguments provided individually.
Apply: Invokes a function with a specified 'this' value and arguments provided as an array.
Bind: Creates a new function that, when called, has its 'this' keyword set to a specific value.
- Q2. Explain closures
- Ans.
Closures are functions that have access to variables from their containing scope even after the scope has closed.
Closures allow functions to access variables from their outer function even after the outer function has finished executing.
They are commonly used in event handlers, callbacks, and asynchronous programming.
Closures help in maintaining state in functional programming.
Interview Preparation Tips
Skills evaluated in this interview
Akash Das
Selected
I applied via Referral and was interviewed in Apr 2024. There were 5 interview rounds.
2 dsa questions of easy/medium
(1 Question)
- Q1. Asked two dsa questions of leetcodeeasy/medium
(1 Question)
- Q1. Asked two dsa questions of leetcode easy/medium
(1 Question)
- Q1. Asked one dsa question on tree and discussion on resume and dbms os
(1 Question)
- Q1. Salary Discussion
(2 Questions)
- Q1. Techical questions and coding questions related profile.
- Q2. Basic concepts about your programming skills.
Interview Preparation Tips
Selected
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Solving normal Puzzles to test aptitude.
Sample app was asked to create.
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
They have their own coding platform. The questions are basically from tree.
Tree of space question
(2 Questions)
- Q1. Previous round question solution
- Q2. System design was asked.
Interview Preparation Tips
- tree
- graph
- system design
(2 Questions)
- 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.
- Q2. Project discussion
Interview Preparation Tips
Skills evaluated in this interview
(2 Questions)
- Q1. React, React Native Basics
- Q2. Coding Arrays & Objects
Interview Preparation Tips
Koo App Interview FAQs
Tell us how to improve this page.
Koo App Interviews By Designations
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer III Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Development Engineer Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Operations Manager
8
salaries
|  ₹11 L/yr - ₹20 L/yr |
|
SDE (Software Development Engineer)
7
salaries
| ₹10 L/yr - ₹18 L/yr |
|
growth manager
5
salaries
| ₹12 L/yr - ₹16 L/yr |
|
Software Developer
5
salaries
| ₹10 L/yr - ₹23 L/yr |
|
Product Manager
5
salaries
| ₹20 L/yr - ₹30.5 L/yr |
ShareChat
Chingari
Roposo
MOJ
Calculate your in-hand salary
- Home >
- Interviews >
- Koo App Interview Questions >
- Koo App Software Engineer II Interview Questions
