SACHA Engineering Design Engineer Interview Questions and Answers for Experienced

Cloud , Big Data , Jenkins , CICD Pipeline

Q1. Computer Basic , Cloud computing , ETL , Java
Add your answer
Q2. What at is finally block
Ans. 
Finally block is used in try-catch-finally statement to execute code after try and catch blocks.
• Finally block is optional and can be used with try-catch or try-catch-catch statements.

• It is executed regardless of whether an exception is thrown or not.

• It is often used to release resources like file handles, database connections, etc.

• Example: try { //code } catch (Exception e) { //code } finally { //code }
Answered by AI
Add your answer
Q3. How to get second largest salary from a table
Ans. 
To get the second largest salary from a table, you can use the SQL query with the ORDER BY and LIMIT clauses.
• Write a SQL query to select the distinct salaries from the table.

• Order the salaries in descending order using the ORDER BY clause.

• Use the LIMIT clause to retrieve the second row from the result set.
Answered by AI
Add your answer
Q4. What are joins , type of joins and example
Ans. 
Joins are used to combine data from two or more tables based on a related column.
• Types of joins include inner join, left join, right join, and full outer join.

• Inner join returns only the matching rows from both tables.

• Left join returns all rows from the left table and matching rows from the right table.

• Right join returns all rows from the right table and matching rows from the left table.

• Full outer join returns all row...read more
Answered by AI
Add your answer

Basic questions on generic IT terms

Q1. Questions based on skillset mentioned in resume
Add your answer
Q2. Questions based on basic computer science knowledge
Add your answer

Q1. Questions based on skilleset mentioned in resume
Add your answer
Q2. Questions based on Mulesoft for me
Add your answer

Q1. One more level up on technical questions
Add your answer

Q1. Managerial and technical round
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate all valid configurations and print them out.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.