Sigmoid Data Engineer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Medium

Started with basic introduction about myself and then 2 DSA problems to be solved on CodeChef or any IDE of your preference. Interviewer was helpful throughout the interview and helped with syntaxes at one point as well.
Parameters tested - 
1. Ability to think of edge test cases.
2. Coding Practices like naming variables and functions properly and using the most suitable access modifiers.
3. Ability to think of time and space complexity and optimise it.
Reaching the correct output was not mandatory but was preferred. Priority to coding practices was given.

Q1. 
Next Greater Element Problem Statement
You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...read more
Ans. 
The task is to find the next greater element for each element in the given array.
• Iterate through the array from right to left.

• Use a stack to keep track of the next greater element.

• Pop elements from the stack until a greater element is found or the stack is empty.

• If the stack is empty, there is no greater element, so assign -1.

• If a greater element is found, assign it as the next greater element.

• Push the current element ...read more
Answered by AI
View 2 more answers
Q2. 
Zigzag Binary Tree Traversal Problem Statement
Determine the zigzag level order traversal of a given binary tree's nodes. Zigzag traversal alternates the direction at each level, starting from left to rig...read more
Ans. 
The zigzag level order traversal of a binary tree is the traversal of its nodes' values in an alternate left to right and right to left manner.
• Perform a level order traversal of the binary tree

• Use a queue to store the nodes at each level

• For each level, alternate the direction of traversal

• Store the values of the nodes in each level in separate arrays

• Combine the arrays in alternate order to get the zigzag level order tra...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Started with basic introduction about myself and then 2 DSA problems to be solved on google doc. Interviewer was helpful throughout the interview.
Parameters tested - 
1. Ability to think of edge test cases.
2. Coding Practices like naming variables and functions properly and using the most suitable access modifiers.
3. Ability to think of time and space complexity and optimise it.
4. Making it to the correct output.

Reaching the correct output was mandatory in best possible time comlexity.

Q1. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
This is a problem where a sorted array is rotated and we need to search for given numbers in the array.
• The array is rotated clockwise by an unknown amount.

• We need to search for Q numbers in the rotated array.

• If a number is found, we need to return its index, otherwise -1.

• The search needs to be done in O(logN) time complexity.

• The input consists of the size of the array, the array itself, the number of queries, and the q...read more
Answered by AI
Add your answer
Q2. 
K-th Element of Two Sorted Arrays
You are provided with two sorted arrays, arr1 and arr2, along with an integer k. By merging all elements from arr1 and arr2 into a new sorted array, your task is to ident...read more
Ans. 
The task is to find the kth smallest element of a merged array created by merging two sorted arrays.
• Merge the two sorted arrays into a single sorted array

• Return the kth element of the merged array
Answered by AI
View 1 more answer

Round duration - 40 minutes
Round difficulty - Easy

I was asked to introduce myself and general family background check and then discussion around salary negotiation.