Koo App Software Engineer II Interview Questions and Answers

Q1. Merge Sort based question
Add your answer

Q1. DP based question
Add your answer

Q1. Design API Rate Limiter
Ans. 
Design an API rate limiter to control the number of requests a user can make within a certain time frame.
• Implement a token bucket algorithm to track and limit the number of requests per user.

• Set a maximum limit of requests per user per time frame (e.g. 100 requests per hour).

• Use a sliding window to track the requests and reset the limit after the time frame expires.
Answered by AI
Add your answer

Q1. DSA round and medium level
Add your answer
Q2. Merge sort type/variation
Add your answer

Q1. Data Structure and Algorithms
Add your answer

Q1. System Design LLD round
Add your answer

Q1. Tell me something about yourself and your past experience if any
Add your answer
Q2. Introduce yourself and tell them briefly your achievements
Add your answer

Q1. Growth Opportunities and Last CTC
Add your answer
Q2. Wait them to pitch the salary then say your expectations as per market standards.
Add your answer

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

Q1. How was your day?
Add your answer
Q2. Why did you choose this?
Add your answer

Asked about DA role, asked about my past experience

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of DSA questions and they were looking for good coding practices.

Q1. 
Aggressive Cows Problem Statement
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...read more
Ans. 
The problem is to assign aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search for a ...read more
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in the given array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that are greater than the current element.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empt...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of React related questions, javascript questions.

It was a DSA ALGO Medium round

Q1. Design an analytics system
Ans. 
Designing an analytics system for data analysis and visualization
• Define the goals and objectives of the analytics system

• Identify the data sources and types of data to be collected

• Choose appropriate tools and technologies for data processing and analysis

• Design a data model and architecture for storing and accessing data

• Implement data visualization techniques for presenting insights to users
Answered by AI
Add your answer

Q1. General HR questions about salary, workstyle, motivation etc
Add your answer