Data Engineer || Media.net || 2 YOE

media.net logo
media.net
data engineer2 yearsRejected
September 22, 202520 reads

Summary

I recently interviewed for a Data Engineer position at media.net. Despite successfully answering all the questions, which I found to be easy, I was unfortunately not selected for the role.

Full Experience

I recently appeared for a Data Engineer interview at media.net. The process involved several rounds, primarily focusing on Data Structures & Algorithms and SQL. I found the overall interview experience manageable and was confident in my responses to all the posed questions. However, despite my performance, I received a rejection for the position.

Interview Questions (3)

Q1
Next Greater Element in Circular Array
Data Structures & Algorithms

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]

Q2
Customer Order Analysis with Discounts
Other

Given the following tables:

CUSTOMER_MASTER

Customer_idnamemob_no
1xyz1234567899

Product table:

product_keyprice(INR)
4100
5150
6200
10300

orders:

order_idcustomer_idproduct_iddatediscount_points
11510-02-20251
22610-02-20252
33512-02-20251
43405-02-2025NULL
51610-02-20251

discount_master:

discount_pointsdiscount(INR)
125
250
  1. Find the Top 10 orders
  2. Find avg product values of customer Day wise
Q3
Climbing Staircase with Max Steps
Data Structures & Algorithms

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

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!