SDE - 1

Design a class in C++ to implement a recent apps functionality. The expectation is to create a recent apps drawer that shows the last used apps in the order they were launched, always displaying the most recent apps first.

You are given a sorted array ‘arr’ of length ‘n’, which contains positive integer positions of ‘n’ gas stations on the X-axis.

You are also given an integer ‘k’.

You have to place 'k' new gas stations on the X-axis.

You can place them anywhere on the non-negative side of the X-axis, even on non-integer positions.

Let 'dist' be the maximum value of the distance between adjacent gas stations after adding 'k' new gas stations.

Find the minimum value of dist.

Example:

Input: ‘n' = 7 , ‘k’=6, ‘arr’ = {1,2,3,4,5,6,7}.

Answer: 0.5

Explanation:
We can place 6 gas stations at 1.5, 2.5, 3.5, 4.5, 5.5, 6.5. 

Thus the value of 'dist' will be 0.5. It can be shown that we can't get a lower value of 'dist' by placing 6 gas stations.

Note:

You will only see 1 or 0 in the output where:
  1 represents your answer is correct.
  0 represents your answer is wrong. 
Answers within 10^-6 of the actual answer will be accepted.

Design a train management system similar to IRCTC. The expectation was to design a proper ER diagram for the models and their relationships.

Explain the difference between monolithic and microservice architectures, including how and where each architecture should be used. (Learn)

• Questions were asked on database indexing and its implementation. (Learn)
• I suggested the B+ tree method but was not fully prepared on the topic. (Learn)

Some basic questions were asked about mutex locks, semaphores, etc. (Learn)