i
Cloud
Analogy
Filter interviews by
Global JS refers to JavaScript variables or functions that are accessible from anywhere in the code.
Global JS variables are declared outside of any function and can be accessed from any part of the code.
Global JS functions are defined without being enclosed within another function and can be called from anywhere in the code.
Using global variables or functions can lead to potential conflicts and security risks.
Carry is generated when the sum of two digits is greater than 9.
Carry is a digit that is carried over to the next place value in the sum.
For example, in the sum 56 + 78, the carry generated is 1 (5+7=12, carry 1, 6+8+1=15).
Carry is important in addition of large numbers and in binary addition.
A program to find palindrome numbers in a given range.
Iterate through the given range of numbers
Convert each number to a string and check if it is equal to its reverse
If yes, add it to the list of palindrome numbers
Campaigns, Promotions, and Coupons are marketing strategies used to attract customers and increase sales.
Campaigns are strategic marketing efforts to promote a product or service over a specific period of time.
Promotions are temporary incentives offered to customers to encourage purchases, such as discounts or free gifts.
Coupons are vouchers that entitle the holder to a discount on a particular product or service.
...
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed linke...
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.
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 illustrat...
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
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 is...
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.
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There was 1 interview round.
Campaigns, Promotions, and Coupons are marketing strategies used to attract customers and increase sales.
Campaigns are strategic marketing efforts to promote a product or service over a specific period of time.
Promotions are temporary incentives offered to customers to encourage purchases, such as discounts or free gifts.
Coupons are vouchers that entitle the holder to a discount on a particular product or service.
Examp...
Global JS refers to JavaScript variables or functions that are accessible from anywhere in the code.
Global JS variables are declared outside of any function and can be accessed from any part of the code.
Global JS functions are defined without being enclosed within another function and can be called from anywhere in the code.
Using global variables or functions can lead to potential conflicts and security risks.
I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.
Aptitude round was not so tough, moderate level questions were there.
A program to find palindrome numbers in a given range.
Iterate through the given range of numbers
Convert each number to a string and check if it is equal to its reverse
If yes, add it to the list of palindrome numbers
Carry is generated when the sum of two digits is greater than 9.
Carry is a digit that is carried over to the next place value in the sum.
For example, in the sum 56 + 78, the carry generated is 1 (5+7=12, carry 1, 6+8+1=15).
Carry is important in addition of large numbers and in binary addition.
I appeared for an interview 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.
I appeared for an interview 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
Top trending discussions
I appeared for an interview before Mar 2021.
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
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.
A queen can attack another queen if they ar...
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
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...
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
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
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.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, basics. easy, some important topics in python and sql
I applied via Naukri.com and was interviewed in Feb 2022. There were 4 interview rounds.
Create a CRUD application
I applied via AmbitionBox and was interviewed in Dec 2021. There were 2 interview rounds.
I appeared for an interview in Jan 2021.
Round duration - 40 minutes
Round difficulty - Easy
Given a singly linked list of integers, your task is to implement a function that returns the index/position of an integer value 'N' if it exists in the linked list. Return -1 i...
Implement a function to find the index of a given integer in a singly linked list.
Traverse the linked list while keeping track of the index of each element.
Compare each element with the target integer 'N'.
Return the index if 'N' is found, otherwise return -1.
Handle cases where the list is empty or 'N' is not found.
Consider the constraints on the number of test cases and the length of the linked list.
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in constant time complexity (O(1)).
Handle edge cases like empty stack appropriately.
Example: For input '5', '3 10', '5', '1', '2', '4', the output should be '10', '1'...
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list has a cycle using O(N) time complexity and O(1) space complexity.
Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list
Maintain two pointers, slow and fast, moving at different speeds
If there is a cycle, the two pointers will eventually meet
If one of the pointers reaches the end of the list (null), there is no cycle
Round duration - 20 minutes
Round difficulty - Easy
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...Return the top view of a binary tree given in level-order format.
Traverse the binary tree in level-order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the first node encountered at each distance.
Return the values of the nodes stored in the map in sorted order of their horizontal distance.
Example: For the given binary tree, th...
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Tip 1 : Practice Questions as much as you can
Tip 2 : Do at least 2 projects
Tip 3 : Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview.
Tip 4 : Also, try to implement it yourself without seeing the solution.
Tip 5 : Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Tip 1 : Keep your resume short and up to mark and check spellings before submitting it for the interview process.
Tip 2 : Have projects and internships on your resume
Tip 3 : Never lie in your resume
posted on 28 Oct 2023
It was basic test. online.
2 questions on arrays. online.
The general topic. Be point to point
The duration of Cloud Analogy Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 2 interview experiences
Difficulty level
Duration
based on 11 reviews
Rating in categories
Salesforce Developer
327
salaries
| ₹2.4 L/yr - ₹18.9 L/yr |
Quality Analyst
77
salaries
| ₹2.7 L/yr - ₹7.7 L/yr |
Salesforce Administrator
66
salaries
| ₹3.9 L/yr - ₹9 L/yr |
Senior Salesforce Developer
40
salaries
| ₹10.1 L/yr - ₹21.8 L/yr |
Full Stack Developer
40
salaries
| ₹7.3 L/yr - ₹14.9 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Capital Numbers Infotech