Sr Data Engineer Interview Questions

2,551 sr data engineer interview questions shared by candidates

You are given a sorted array with repeated numbers. [1,1,1,3,3,3,3,3,4,5,6,6,6] Your task is to return the array by not repeating any number more than twice. And the array count. (In place) Output : [1,1,3,3,4,5,6,6]
avatar

Senior Data Engineer

Interviewed at Delivery Hero

3.4
Nov 10, 2021

You are given a sorted array with repeated numbers. [1,1,1,3,3,3,3,3,4,5,6,6,6] Your task is to return the array by not repeating any number more than twice. And the array count. (In place) Output : [1,1,3,3,4,5,6,6]

SQL questions: 1. First question was based on the ranking and join to get the solution 2. Second follow up question used the same database and tables. The question asked for a rolling average based on last 3 days. 3. Third question was again based on a rolling sum and then count query based on that rolling sum. All of the SQLs required CTE statements Lastly the Python programming question was a basic for loop to search the position of a target number. Interviewer asked for a different approach of solving it.
avatar

Senior Data Engineer

Interviewed at Atlassian

3.1
May 5, 2025

SQL questions: 1. First question was based on the ranking and join to get the solution 2. Second follow up question used the same database and tables. The question asked for a rolling average based on last 3 days. 3. Third question was again based on a rolling sum and then count query based on that rolling sum. All of the SQLs required CTE statements Lastly the Python programming question was a basic for loop to search the position of a target number. Interviewer asked for a different approach of solving it.

Problem: o A traveler flies to many cities (airports) in an unbroken chain of flights with no loops i.e never revisiting an airport. o For every flight, she has a boarding pass with only a From (City) and To (City) printed on it but no date/time. o At the end of her journey, she hands you all her boarding passes but they’re shuffled, so you don’t know the starting or the ending city. Can you: o Write logic or pseudocode to print her whole journey in sequence. It should print e.g. (Starting) City1 -> City2 ->….-> (Ending) CityX o State the time complexity of your solution. o you’re given a Set of BoardingPass objects as input. o there could be as many as hundreds of thousands of unique cities/airports. o memory is no concern (i.e. you have infinite memory!). Optimize for execution time (time complexity).
May 19, 2016

Problem: o A traveler flies to many cities (airports) in an unbroken chain of flights with no loops i.e never revisiting an airport. o For every flight, she has a boarding pass with only a From (City) and To (City) printed on it but no date/time. o At the end of her journey, she hands you all her boarding passes but they’re shuffled, so you don’t know the starting or the ending city. Can you: o Write logic or pseudocode to print her whole journey in sequence. It should print e.g. (Starting) City1 -> City2 ->….-> (Ending) CityX o State the time complexity of your solution. o you’re given a Set of BoardingPass objects as input. o there could be as many as hundreds of thousands of unique cities/airports. o memory is no concern (i.e. you have infinite memory!). Optimize for execution time (time complexity).

Viewing 181 - 190 interview questions

Glassdoor has 2,551 interview questions and reports from Sr data engineer interviews. Prepare for your interview. Get hired. Love your job.