GreenClouds Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Easy

Coding Round consists of 3 questions and time given to solve those questions was 6 hours. It give a 24 hour window in that we can give our test anytime. The questions are basically from arrays, Mathematical , Dynamic Programming

Q1. 
Nearest Multiple of 10 Problem Statement
Given an integer N, find the nearest multiple of 10. If there are multiple nearest multiples, return the smallest one.
Input:
The first line contains an integer ...read more
Ans. 
Given an integer, find the nearest multiple of 10. If multiple nearest multiples, return smallest one.
• Iterate through each test case

• Calculate the remainder when dividing N by 10

• If remainder is less than or equal to 5, nearest multiple is 10 * (N / 10)

• If remainder is greater than 5, nearest multiple is 10 * (N / 10) + 10
Answered by AI
Add your answer
Q2. 
Beautiful String Problem Statement
Given a binary string STR containing either '0' or '1', determine the minimum number of operations needed to make it beautiful. A binary string is called beautiful if it...read more
Ans. 
Determine the minimum number of operations needed to make a binary string beautiful by having alternating 0s and 1s.
• Iterate through the binary string and count the number of operations needed to make it beautiful by flipping the bits if they are the same.

• Keep track of the current bit and compare it with the next bit to determine if an operation is needed.

• Return the total number of operations needed for each test case.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

First of all interviewer asked very famous question of Interview i.e.
"Tell me about yourself"
I have given proper answer of this question including my achievements , internships and education.
The interviewer was very friendly . He kept motivating me till end of interview. He took me to the right approach in many questions.

Q1. 
Alternate Print Problem Statement
You are given two strings "A" and "B". The task is to print these strings in an alternating fashion based on their indices, i.e., first character of "A", first character ...read more
Ans. 
The task is to print two strings in an alternating fashion based on their indices, with a time complexity of O(N) and a space complexity of O(1).
• Use two pointers to iterate through the strings simultaneously

• Append characters from both strings alternately until one string is fully processed

• If one string has remaining characters, append them to the end of the result
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was Technical + HR both round. I were asked technical as well as HR related Questions
Again the interviewer was very friendly . He treated me very well and help me out in many questions.
I got a great experience from this interview. Overall It was a good learning for me.

Q1. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order to easily find the Kth largest element.

• Keep track of the Kth largest element while sorting the array.

• Ensure all elements in the array are distinct for accurate results.
Answered by AI
Add your answer