Upload Button Icon Add office photos

Filter interviews by

Soho House Mumbai Senior ETL Developer Interview Questions and Answers

Updated 2 Apr 2022

Soho House Mumbai Senior ETL Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed in Oct 2021. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. What difference between temporary table and global temporary table?
  • Ans. 

    Temporary tables are session-specific while global temporary tables are accessible across sessions.

    • Temporary tables are created in a user's temporary tablespace and are automatically dropped at the end of the session.

    • Global temporary tables are created in a user's temporary tablespace but are not automatically dropped at the end of the session.

    • Temporary tables are only accessible within the session that created them.

    • Gl...

  • Answered by AI
  • Q2. Different between function and Store procedure?
  • Ans. 

    Functions return a single value while stored procedures can return multiple values and perform complex operations.

    • Functions are used to perform a single operation and return a single value.

    • Stored procedures can perform complex operations and return multiple values.

    • Functions can be used in SQL statements while stored procedures cannot.

    • Functions are faster than stored procedures as they do not require compilation.

    • Stored ...

  • Answered by AI
  • Q3. Drawback of SSIS packages?
  • Ans. 

    SSIS packages can be complex and difficult to troubleshoot.

    • Debugging can be time-consuming and challenging.

    • SSIS packages can be resource-intensive and slow down other processes.

    • Version control can be difficult to manage.

    • SSIS packages may not be suitable for real-time data integration.

    • SSIS packages may require additional licensing costs for advanced features.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn new things and understand basic knowledge of Sql

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA , medium n easy leetcode question was there

Round 2 - One-on-one 

(2 Questions)

  • Q1. Low level design
  • Q2. DSA and computer fundamental
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Merge sort algorithm and divide array in the chunks
  • Ans. 

    Merge sort is a sorting algorithm that divides an array into smaller chunks and then merges them in sorted order.

    • Merge sort is a divide-and-conquer algorithm.

    • It recursively divides the array into two halves until each subarray has only one element.

    • Then it merges the subarrays in sorted order.

    • The merge step compares elements from both subarrays and places them in the correct order.

    • It has a time complexity of O(n log n).

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Coding Questions and SQL

Round 3 - Technical 

(1 Question)

  • Q1. Topics : Trees and LinkedList
Round 4 - Technical 

(1 Question)

  • Q1. Trees, LinkedList and SQL queries
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Two medium graph questions from leetcode
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Some medium Graph problems from leetcode
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Dictionary Sort , DFS, BFS
Round 3 - Technical 

(1 Question)

  • Q1. Reverse a LinkedList from m to n
  • Ans. 

    Reverse a LinkedList from m to n

    • Traverse the list to m-1th node

    • Reverse the nodes from m to n

    • Connect the reversed list to the original list

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA as the rounds are only technical. No projects were asked

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

This round was conducted on the HackerEarth platform. It had 2 sections and candidates were given a time of 1 hour 30 minutes. 

Programming MCQs — 18 MCQs (each of 2 marks)
Questions were a little tricky. it tested upon one’s programming fundamentals. It had C/C++ output questions, pseudocode questions, Operating systems, and SQL queries.
Coding — 2 ( one contains 75 marks and the other contains 100 marks )

Our scores of the first 2 sections weren’t revealed. My MCQs went really well. I solved 2 coding questions in the coding section. Only 15 students got selected for the interview round, and I was one of them.

  • Q1. Count Ways To Travel Triangular Pyramid

    Bob has been given a triangular pyramid with its vertices marked as ‘O’, ‘X’, ‘Y’ and ‘Z’ and provided with another integer ‘N’. In a single step, Bob can go to any ...

  • Ans. Brute Force

    The idea is very simple, as standing at any point we will always have three choices to move. So we will make a recursive function and call it for all three choices and decrease ‘N’ by 1 each time. So when ‘N’ will reach 0 then we will check the current position, if it is ‘O’ then we can say we have found a way.

     

    Complete Algorithm :

    • We will make a helper recursive function named ‘SOLVE’ which will receive...
  • Answered by CodingNinjas
  • Q2. Maximum Profit

    Mukesh is a hard worker and has a good running business. He has a list of profits he made in the last ‘N’ days. Mukesh wants to know what maximum profit he made in the few consecutive days. ...

  • Ans. Brute Force

    The basic idea is to iterate through the given array/list ‘profit’ and check for each index as a starting point, if any possible consecutive days in the range [ ‘A’, ‘B’ ] is possible, calculate its ‘sum’ and update the ‘maxProfit’ if the ‘sum’ is greater than ‘maxProfit’ ( where ‘maxProfit’ denotes the Maximum possible profit from the array/list ‘profit’ under the given range).

     

    Algorithm:

     

    1. Declare ...
  • Answered by CodingNinjas
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled for 1 hour and the panel had 1 interviewer. Being a virtual interview, the first challenge that I faced was that the interviewer was not audible. I suggest you not panic in such a situation and use the chatbox feature (or contact HR if need be) to figure out something that works for you and the panel. We later connected over voice call (over the phone) with our videos ON (over a laptop) and continued with the interview.

The interview was very calm and helpful. I was able to solve all questions and I explained different approaches to solve the questions. Once he was convinced of my solution, he asked me to write the code on my own IDE.

  • Q1. Running Median

    You are given a stream of 'N' integers. For every 'i-th' integer added to the running list of integers, print the resulting median.

  • Ans. Sorting Approach

    The median of n numbers is the middle-most element among the numbers when sorted in ascending order, when n is odd, and is the average of the two middle-most elements, when n is even. To find the middle-most elements, we do this: For every new addition to the stream, we sort all the numbers that are currently present. This makes it easy for us to obtain the middle-most elements.

    Space Complexity: O(1)Exp...
  • Answered by CodingNinjas
  • Q2. Boundary Traversal

    You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.

    NOTE:
    The boundary ...
  • Ans. Recursion Based Approach

    The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-

     

    1. The root node - The root node will always be our first node in the whole boundary traversal.
       
    2. The left boundary - The left most nodes of the left subtree are also included in the boundary traversal, so we will process them next except for...
  • Answered by CodingNinjas
  • Q3. Number Of Pairs With Given Sum

    You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the ...

  • Ans. Brute Force Approach
    • Initialize the ans = 0
    • Run two loops first from i = 0 to n-1 and second from j = i+1 to  n-1 and if arr[i] + arr[j] == Sum then increase the ans by 1.
    • Return ans
    Space Complexity: O(1)Explanation:

    O(1)

     

    As constant extra space is used.

    Time Complexity: O(n^2)Explanation:

    O(N^2), where N is the size of the array.


    As we are running two nested loops of size N.

  • Answered by CodingNinjas
Round 3 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

This was a technical + HR round. First, he asked me to introduce myself. This round was also based on your knowledge of DSA. I was asked 2 coding questions. Then he asked a couple of questions from OS and DBMS which were pretty easy. At last, we ended the interview on a good note. Then he asked me questions about myself.
Why I want to join OYO rooms. 
What are my hobbies?
Goals in the next five years.

  • Q1. Zig-Zag String

    You are given a string ‘STR’ of size ‘N’ and an integer ‘M’ (the number of rows in the zig-zag pattern of ‘STR’). Your task is to return the string formed by concatenating all ‘M’ rows when ...

  • Ans. Iteration

    Create an array ‘arr’ of size ‘m’, use the array index ‘arr[i]’ to store the string at row ‘i’. Traverse the string ‘str’, identify the character’s row in the current iteration, and append that character to its corresponding row/index in ‘arr’.

     

    1. Create an array of strings named ‘arr’ of size ‘m’.
    2. Initialize variable ‘curRow’ with value 0 and ‘move’ with value 1. Use ‘curRow’ to identify the character’s row ...
  • Answered by CodingNinjas
  • Q2. Ways To Make Coin Change

    You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...

  • Ans. Recursion

     

    1. The idea is to use recursion.
    2. For a particular coin, we have two options either include it or exclude it.
    3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
    4. If we exclude that coin, then recur for the same amount that we have to make.
    5. Our final answer would be the total number of ways either by including or excluding.
    6. There will be two edg...
  • Answered by CodingNinjas

Interview Preparation Tips

Eligibility criteriaNo CriteriaOYO interview preparation:Topics to prepare for the interview - Data Structures, Computer Networking, C++, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
 

Application resume tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Aug 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Do not use an unprofessional email address such as cool_boy@email.com. It shows a lack of professionalism by the candidate.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Operating system questions
Round 3 - Coding Test 

Linked list standard questions

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

  • Q1. Rat In A Maze

    You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...

  • Ans. Bactracking

    Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.

     

    Algorithm is as follows:

     

    1. Take the starting position of th...
  • Answered by CodingNinjas
  • Q2. Minimum Cost to Destination

    You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'.


    '1' means you can use the cell,...

  • Ans. Backtracking

    Maintain a visited array and try to explore all the possibilities with the help of backtracking.

    1. Start with (0, 0) and mark it as visited and try to move in all 4 directions.
    2. Say at any point we are at (i, j) then the cost of reaching (x,y) will be the minimum of these four cases.
      1. Option 1 -  Left: cost of reaching from (i, j-1)
      2. Option 2 - Right: cost of reaching from (i, j+1)
      3. Option 3 - Up: 1 + cost of rea...
  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteria6.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structure, OS, DBMS, Java, Problem Solving, OOPSTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.

Final outcome of the interviewRejected

Skills evaluated in this interview

Soho House Mumbai Interview FAQs

How many rounds are there in Soho House Mumbai Senior ETL Developer interview?
Soho House Mumbai interview process usually has 1 rounds. The most common rounds in the Soho House Mumbai interview process are Technical.
What are the top questions asked in Soho House Mumbai Senior ETL Developer interview?

Some of the top questions asked at the Soho House Mumbai Senior ETL Developer interview -

  1. What difference between temporary table and global temporary tab...read more
  2. Different between function and Store procedu...read more
  3. Drawback of SSIS packag...read more

Tell us how to improve this page.

People are getting interviews through

based on 1 Soho House Mumbai interview
Job Portal
100%
Low Confidence
?
Low Confidence means the data is based on a small number of responses received from the candidates.

Interview Questions from Similar Companies

Oyo Rooms Interview Questions
3.3
 • 222 Interviews
Burger King Interview Questions
3.9
 • 68 Interviews
Pizza Hut Interview Questions
3.9
 • 43 Interviews
Hyatt Regency Interview Questions
4.2
 • 43 Interviews
JW Marriott Interview Questions
4.1
 • 39 Interviews
View all
Bartender
8 salaries
unlock blur

₹1.2 L/yr - ₹3 L/yr

Housekeeping Supervisor
7 salaries
unlock blur

₹3 L/yr - ₹4 L/yr

Commis Chef
5 salaries
unlock blur

₹1.6 L/yr - ₹2.5 L/yr

Assistant Waiter
5 salaries
unlock blur

₹1.1 L/yr - ₹2.2 L/yr

Commie 2
5 salaries
unlock blur

₹3 L/yr - ₹10.1 L/yr

Explore more salaries
Compare Soho House Mumbai with

The Bombay Canteen

5.0
Compare

The Table

4.4
Compare

Smoke House Deli, Bangalore

4.8
Compare

Farzi Cafe Pune

4.3
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview