**Status: SDE-1 in a Startup
Location: Gurugram, Haryana
YOE: 3 yrs

First Round : DSA

1. Two Sum (common question)
   arr = [9, 4, 10, 13, 5, 3, 6]
   x = ? , x can be any given number.

   Check sum of two numbers in the array will be x or not?

2. Segregate all zeroes towards the end of the array using inplace. Can't use extra array.
   Input[] : [0, -7, 2, 11, 0, 0, 0, 13, 12, 0]
   Output[] : [-7, 2, 11, 13, 12, 0, 0, 0, 0, 0]

3. Flatten the nested list and return the output.
   Input: [5, [6, 7, [8], 4]
   Output: 5 * 1 + (6 + 7 + 8*3 + 4) * 2 = ?

Second Round: Technical Discussion

1. Find the next greater number with the same set of digits.
   Eg: 123456 -> 123465,
   Eg: 54321 -> -1

2. DB Design.

    In PayU we do assessments to decide whether a user can be given a loan or not, I need to run
    assessments for 1 million users on certain dates of a month. Design a jos scheduler to automate this process:
        1. business team can configure the frequency/dates of the run
        2. Our system should run assessment on the specified dates and save the assessment response in the database.
        3. Our system should be able to scale for more number of users and handle failures as well.
   
    Assumption:
    1. We dont have to build the internals of the "assessment" process. That is already handled.
    Assume that assessment is a function already built in your service.

   Tried to give best possible answers with follow up questions regarding scalability, query, fetching the data, structure of data, latency.