Round 1

Duration Of Round(in minutes)
90

Description Of Round
The interview took place on google meet. The interviewer gave 1 coding question on google docs and have to write the code on google doc itself.
After 45 minutes a second interviewer came in the same meeting and he also gave a coding question in the same google doc.

Problem 1
Imagine you are reading in a stream of integers. Periodically,you wish to be able to look up the rank of a number x (the number of values less than or equal to x). implement the data structures and algorithms to support these operations. That is, implement the method track ( int
x), which is called when each number is generated, and the method getRankOfNumber(int x), which returns the number of values less than or equal to x (not including x itself).

EXAMPLE
1, 4, 4, 5, 9, 7, 13, 3
getRankOfNumber(1) = 0
getRankOfNumber(3) = 1
getRankOfNumber(4) = 3

Constraints:
1 <= Number of inegers <= 1000000

Problem 2
Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

You have the following three operations permitted on a word:

Insert a character
Delete a character
Replace a character

Input: word1 = "horse", word2 = "ros"
Output: 3

Explanation:
horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Constraints:
0 <= word1.length, word2.length <= 500
word1 and word2 consist of lowercase English letters.

Problem 3 (CS fundamentals)
Process vs thread
why we do threading, advantages of multithreading.
What is context switching?
Where do we store the process data when we do the context switching.
Memory layout of process.
What fields change when we do context switching (process context switching and thread context switching both)
What is concurrency control is dbms.
How is synchronization done with concurrent reads and writes.

Round 2

Duration Of Round(in minutes)
60

Problem 1
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].

Example 1:
Input: nums = [5,2,6,1]

Output: [2,1,1,0]

Explanation:
To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.

Constraints:

1 <= nums.length <= 100000
-1000000000 <= nums[i] <= 1000000000

Problem 2 (CS fundamantals)
What is critical section.
How does mutex work.
How does semaphores work and how it is implemented.
Binary vs counting semaphores.
Difference betweek mutex and binary semaphore.
Can we replace a code written with mutex by semaphores.
what are spinlocks.
Advantages and disadvantages of spinlocks.

Round 3 (HR)

Duration Of Round(in minutes)
15
Questions:
Introduce yourself.
Tell me about your family and friends.
Tell me somthing that you love to do.
What do you expect from Sprinklr.
Where do you want to see yourself from 3-4 years from now.