SDE - Intern

You have been given an array/list ‘ARR’ of integers consisting of ‘N’ integers. You are also given an integer ‘X’. In one operation, you can either remove the leftmost or the rightmost element and add that to the sum of removed elements so far. Your task is to return the minimum number of operations such that the sum of removed elements becomes exactly ‘X’. If it is not possible return -1.

For Example :

Let’s say you have an array/list [1, 3, 5, 3] and ‘X’ is 7. 
We can first remove the rightmost element i.e. 3. The array becomes [1,3,5]. In the next step, we can remove the leftmost element i.e 1. The array becomes [3,5] and the sum of removed elements so far becomes 4. In the next step, we can remove the leftmost element i.e 3. The array becomes [5] and the sum of removed elements so far is 7. We have reached our target X i.e 7. Therefore the minimum number of operations to reach ‘X’ is 3.

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Write a SQL Query to find the Second Highest Salary.

Tell me the methods to implement atomicity and durability in transactions.

Explain deadlock and deadlock prevention methods. (Learn)

Design a data structure that satisfies the constraints of a Least Recently Used (LRU).

1. Get(int num): If the key exists, it will return the value of the key stored. Else, return -1.    
2. Put(int key, int value): If the key already exists, update the value of the key. Else add the key-value pair to the cache. If the number of keys is more than the capacity for this operation, delete the least recently key used. 

Example:

For the following input: 

4 2
2 1 4
1 1
1 4

We will initialize an empty LRU cache for the first operation with a maximum capacity of 2.
For the first operation, we need to add a key-value pair (1,4) to the cache.
For the second operation, we need to return the value stored for key 1, i.e., 4
For the third operation, we need to return -1, as we don't have any key 4 in the cache.

So, the final output will be: 
4  -1

Discuss all four pillars of OOP in depth. (Learn)

Designed a parking lot system and explained the SOLID principles.

Opinion-based question: “Is AI good or bad according to your perspective?”.

Explain Docker and Kubernetes.

Prepare the database schema of LinkedIn — focused on identifying tables, relationships, and scalability considerations.

Discussion on family background.

Multiple general HR questions (strengths, weaknesses, why UKG, etc.).

Asked about my preferred job location—I chose Noida.