Sigmoid Software Development Engineer II Interview Questions and Answers

Q1. Reverse K group linked list.
Ans. 
Reverse K group linked list
• Iterate through the linked list in groups of size K

• Reverse each group of K nodes

• Connect the reversed groups back together
Answered by AI
Add your answer

Q1. Nearest Left Greater element.
Ans. 
Find the nearest element on the left side of an array that is greater than the current element.
• Iterate through the array from right to left.

• Use a stack to keep track of elements that are greater than the current element.

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

• If a greater element is found, that is the nearest left greater element.

• If the stack is empty, there is no nearest left ...read more
Answered by AI
Add your answer
Q2. Validate binary search tree.
Ans. 
Validate if a binary tree is a binary search tree
• In-order traversal should result in a sorted array

• Check if each node's value is within the correct range

• Recursively validate left and right subtrees
Answered by AI
Add your answer

Consist of 2 coding questions, multiple choice of around 30 question including, math, code, logic and core concepts.

1 hr of coding test mostly on leetcode platform. level : Hard

Q1. Db related question
Add your answer

Q1. Why this company?
Ans. 
I am impressed by the company's innovative products, strong company culture, and opportunities for growth.
• Innovative products: I am excited about the cutting-edge technology and solutions the company is developing.

• Strong company culture: I have heard great things about the supportive and collaborative work environment at the company.

• Opportunities for growth: The company's commitment to employee development and career a...read more
Answered by AI
Add your answer

Q1. Leetcode's Maximum Path Sum
Ans. 
Find the maximum path sum in a binary tree
• Use recursion to traverse the binary tree and calculate the maximum path sum at each node

• At each node, calculate the maximum path sum that includes the current node and return the maximum path sum that does not include the current node

• Update a global variable to keep track of the maximum path sum found so far
Answered by AI
Add your answer
Q2. Leetcode's sort 0 1 array in place
Ans. 
Sort an array of 0s and 1s in place without using extra space.
• Use two pointers approach - one for 0s and one for 1s.

• Swap elements at the two pointers until all 0s are on the left and 1s on the right.
Answered by AI
Add your answer

You will be given a medium lever coding question. Questions about databricks and azure if had an experiance.

Two DSA questions, you have to solve both with optimal solution.
1 could be from an array other could be a tree or stack.

Q1. Cloud experience, questions on Azure, AWS
Add your answer

Q1. Managerial round, basic behavioural questions, why change, pros and cons of previous company.
Add your answer