GIIT Solutions AWS Cloud Engineer Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

Q1. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

• Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

• Return the maximum count of 1s obtained by flipping a sub-array at most once.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

• Mark visited cells to avoid redundant traversal.

• Increment island count whenever a new island is encountered.
Answered by AI
Add your answer

Apti, sql, two coding questions

Q1. 2 dsa questions
Add your answer
Q2. 2 sql questions
Add your answer

Q1. 2 dsa questions
Add your answer
Q2. 2 sql questions
Add your answer

Three coding questions

Q1. K nodes reversal of linked list
Ans. 
Reversing k nodes in a linked list
• Iterate through the linked list in groups of k nodes

• Reverse each group of k nodes

• Update the pointers accordingly to maintain the reversed order
Answered by AI
Add your answer
Q2. Normalization types
Add your answer

Basic coding questions

Q1. Questions related to sql
Add your answer
Q2. Hashing question for duplicates values
Ans. 
Use hashing to identify duplicate values in an array efficiently.
• Utilize a hash set to track seen values. Example: For array [1, 2, 3, 2], add 1, 2, 3 to the set and identify 2 as a duplicate.

• Iterate through the array and check if the value exists in the hash set. If it does, it's a duplicate.

• Time complexity is O(n) due to single pass through the array, while space complexity is O(n) for the hash set.
Answered by AI
Add your answer

All three questions are leetcode medium level.

10th level aptitude problem.

Q1. Discuss about my current project and DBMS and mysql
Add your answer

Q1. Just focus on sql and leetcode
Add your answer
Q2. What is joins in sql
Add your answer
Q3. Reverse the array
Add your answer

Normal aptitude test

SQL Questions and one problem

Q1. SQL Questions and Logical Questionsa
Add your answer