Cloud Analogy interview experience Real time questions & tips from candidates to crack your interview
QA
Cloud Analogy
3 rounds | 5 Coding problems
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application process
Where: Campus
Eligibility: No criteria
Resume tip

Tip 1 : Add projects and Internships if you have done any and add only those things which you really know.
Tip 2 : Do not put false things on resume.

Interview rounds
01
Round
Medium
Face to Face
Duration60 min
Interview date16 Mar 2022
Coding problem2

- Morning time
- Environment was good.
- Interviewer was good

1. Next Greater Number
Moderate
15m average time
90% success
0/80

#### You are given a string S which represents a number. You have to find the smallest number strictly great...

View more
Problem approach

s1- I have done this question earlier so just use already built algorithm which traverses the number from the back.
s2- smallest number that has same set of digits as n and is greater than n

2. Circular Move
Easy
20m average time
80% success
0/40

#### You have a robot currently standing at the origin (0, 0) of a two-dimensional grid and facing no...

View more
Problem approach

s1- I simply started from 0,0 point
s2- if the robot again reaches to 0,0 point then motion is circular. I explained my whole approach on paper to the interviewer.

02
Round
Medium
Video Call
Duration30 min
Interview date18 Jun 2022
Coding problem2
1. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80

#### For example, given the array [34, -50, 42, 14, -5, 86], the maximum ...

View more
Problem approach

s1- I used the Kadane algorithm.
s2- to solve this question and wrote a clean code with which could work on negative numbers also.

2. Connect N Ropes With Minimum Cost
Easy
20m average time
80% success
0/40

#### You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connec...

View more
Problem approach

S1- I solved this question using a priority queue(max heap)
S2- by inserting all elements in the priority queue and then taking the maximum two out of them and pushing their sum again to the priority queue.

03
Round
Medium
HR Round
Duration30 min
Interview date13 Jul 2022
Coding problem1
1. Basic Hr Questions

- What are your strengths and weaknesses?
- You have not done your PG yet. This is not a drawback, but donâ€™t you think you should get a PG degree asap?
- You have changed jobs/jumped ship too many times already, why so?
- What is your greatest fear?

Problem approach

Tip 1: Communication skills is must
Tip 2: Give mock tests.

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by Cloud Analogy
690 views
SDE - 1
3 rounds | 3 problems
Interviewed by Cloud Analogy
696 views
SDE - Intern
3 rounds | 3 problems
Interviewed by Cloud Analogy
2382 views