SDE - 1

I had to Implement an e-commerce platform application with following features

1. We would be able to onboard (add) users to the system

2. The application allows sellers to list products on the platform.

3. Users can either sell a product (Seller) or buy any listed product(Buyer).

4. Users(buyer) can select a product from multiple offered products using a selection strategy (You can assume buyer can only buy single quantity of a product at one time). Currently we have only two stratgies available;
-> One with best rating i.e. highest rating. If ratings are the same, then
choose the one with the lowest price.
-> One with lowest price i.e. lowest product price. If prices are the same,
then choose the one with the best rating.

5. List all products sold/bought by any user.

Bonus Feature
A buyer can cancel a specific product which he/she has purchased. Seller’s product quantity should increase after cancellation.

You have been given a long type array/list 'arr’ of size 'n’.

It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.

Print the total amount of rainwater that can be trapped in these elevations.

Note :

The width of each bar is the same and is equal to 1.

Example:

Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

1. get(key) - Return the value of the key if the key exists in the cache, otherwise return -1.

2. put(key, value), Insert the value in the cache if the key is not already present or update the value of the given key if the key is already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting the new item.

You will be given ‘Q’ queries. Each query will belong to one of these two types:

Type 0: for get(key) operation.
Type 1: for put(key, value) operation.

Note :

1. The cache is initialized with a capacity (the maximum number of unique keys it can hold at a time).

2. Access to an item or key is defined as a get or a put operation on the key. The least recently used key is the one with the oldest access time.

Who is your role model?

What is your expectation from this job?