i
Cloud Analogy
Filter interviews by
I was interviewed in Feb 2021.
Round duration - 120 minutes
Round difficulty - Easy
Given an array ARR
of size N
consisting of distinct elements, your task is to determine the total number of good subsets. A subset is considered a good subset if the e...
Count the total number of good subsets in an array where elements can be rearranged to divide the next element.
Iterate through all possible subsets of the array.
Check if each subset is a good subset by rearranging elements to divide the next element.
Count the number of good subsets and return the total count.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the number of ways to make change for each value up to the specified value.
Iterate through each denomination and update the array accordingly.
The final answer will be stored in the last cell of the array.
Example: For N=3, D=[1, 2...
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : Practice aptitude from prep bytes
Tip 2 : Prepare mostly interview asked questions
Tip 3 : Revise your projects and all details of resume
Tip 1 : Have projects in your resume , do not copy project from somewhere else
Tip 2 : You should know what you write in your CV
I applied via Naukri.com and was interviewed before Sep 2022. There were 2 interview rounds.
What people are saying about Cloud Analogy
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It was in the evening around 5 PM. Platform used for this round was hackerrank. Questions were more of aptitude based and are of moderate level.
You are provided with an array containing N integers along with an integer K. Your task is to compute the total sum of the minimum and maximu...
Calculate the sum of minimum and maximum elements of all subarrays of size K in an array.
Iterate through the array and maintain a deque to store the indices of elements in the current window of size K.
Keep track of the minimum and maximum elements in the current window and update the sum accordingly.
Return the total sum of minimum and maximum elements for all subarrays of size K.
Round duration - 20 minutes
Round difficulty - Easy
It was late night. Interviewer was asking tricky questions to confuse me
Tip 1 : Practice a lot from trusted websites
Tip 2 : Self study is best to tackle any critical questions
Tip 3 : Research about the company thoroughly
Tip 1 : It should look good to interviewer
Tip 2 : Skills and projects should be filled nicely
Tip 3 : Format should be proper.
Cloud Analogy interview questions for popular designations
I was interviewed before Nov 2020.
Round duration - 50 minutes
Round difficulty - Easy
It was conducted on an online platform which was unknown for us as they sent the link of the test on the mails of the students. It contains 40 questions that were related to the C/C++ language in the MCQ format.
Develop a function to print star patterns based on the given number of rows 'N'. Each row in the pattern should follow the format demonstrated in the example.
The picture illustra...
Function to print star patterns based on the given number of rows 'N'.
Iterate through each row from 1 to N
For each row, print spaces (N-row) followed by stars (2*row-1)
Repeat until all rows are printed
Round duration - 60 minutes
Round difficulty - Easy
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node.
Keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during reversal.
Round duration - 15 minutes
Round difficulty - Medium
Tip 1 : Practice on Hackerrank
Tip 2 : Do atleast 3 projects.
Tip 3 : Must have knowledge of technical skills mentioned in CV
Tip 1 : Must be short and effective.
Tip 2 : Do not false things on resume.
Get interview-ready with Top Cloud Analogy Interview Questions
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
Code to reverse a string
Use a loop to iterate through the string
Create a new string and add each character from the original string in reverse order
Return the new string
Overloading constructor in Python allows creating multiple constructors with different parameters.
Define multiple constructors with different parameters
Use default values for optional parameters
Call the appropriate constructor based on the number and type of arguments passed
Python provides a built-in method to remove leading whitespaces from a string.
Use the lstrip() method to remove leading whitespaces from a string.
lstrip() method removes all whitespaces from the beginning of the string.
Example: string = ' Hello World' string.lstrip() Output: 'Hello World'
Code to create a star pattern
Use nested loops to print the pattern
The outer loop controls the number of rows
The inner loop controls the number of stars to print in each row
Use a combination of spaces and stars to create the pattern
I was interviewed in Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
Round duration - 40 minutes
Round difficulty - Medium
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
The task is to find the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
For each element, calculate the number of subsequences with all elements equal using the formula (frequency * (frequency - 1) / 2).
Sum up the counts for all elements and return the result modulo 10^9 + 7.
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Practice a lot from trusted websites
Tip 2 : Self study is best to tackle any critical questions
Tip 1 : It should look good to interviewer
Tip 2 : Skills and projects should be filled nicely
I applied via Campus Placement and was interviewed in Apr 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Oct 2020. There were 5 interview rounds.
The duration of Cloud Analogy interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 32 interviews
Interview experience
based on 157 reviews
Rating in categories
Salesforce Developer
324
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce Administrator
65
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Full Stack Developer
39
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Salesforce Developer
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Cognizant
TCS
Infosys
Wipro