Recently, I appeared for DE interview at Media.net
Question 1: DSA
Given an array arr[] of integers, the task is to find the Next Greater Element for each element of the array in order of their appearance in the circular array.
Input: arr[] = [2, 5, -3, -4, 6, 7, 2]
Output: [5, 6, 6, 6, 7, -1, 5]
Question 2: SQL
CUSTOMER_MASTER
Customer_id, name, mob_no
1 xyz 1234567899
+-------------+-------------+
Product table:
+-------------+
| product_key | price(INR)
+-------------+
| 4 | 100
| 5 | 150
| 6 | 200
| 10 | 300
+-------------+
orders:
+-------------+-------------+
order_id| customer_id | product_id | date | discount_points
+-------------+-------------+
1 | 1 | 5 | 10-02-2025 | 1
2 | 2 | 6 | 10-02-2025 | 2
3 | 3 | 5 | 12-02-2025 | 1
4 | 3 | 4 | 05-02-2025 | NULL
5 | 1 | 6 | 10-02-2025 | 1
discount_master
discount_points , discount(INR)
1 , 25
2 , 50
- Find the Top 10 orders
- Find avg product values of customer Day wise
Question 3: DSA
You're given two positive integers representing the height of a staircase and the maximum number of steps that you can advance up the staircase at a time. Write a function that returns the number of ways in which you can climb the staircase.
Note that maxSteps <= height will always be true.
Input : height = 4, maxSteps = 2
Output : 5
Verdict : Overall interview was easy, still not selected even though I answered all the questions.