Careem Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

Q1. 
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order

• Return the Kth element from the sorted array

• Handle multiple test cases
Answered by AI
Add your answer
Q2. 
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
• Value 0: Represents an empty cell.
• Value 1: Represents a fresh orang...read more
Ans. 
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
• Create a queue to store the rotten oranges and their time of rotting.

• Iterate through the grid to find the initial rotten oranges and add them to the queue.

• Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

• Continue until the queue is empty, ke...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Find the k-th Node from the End of a Linked List
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...read more
Ans. 
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
• Iterate through the linked list to determine its size.

• Calculate the position of the k-th node from the end based on the size of the list.

• Traverse the list again to reach the k-th node from the end.

• Return a pointer to the k-th node from the end.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

Q1. Can you design a system like Uber, explaining the various components and architecture involved?
Ans. 
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
• User app for booking rides and tracking

• Driver app for accepting rides and navigation

• Server for handling requests and communication between apps

• Database for storing user, driver, and ride information

• Algorithms for matching riders with drivers and routing
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions