Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Cloud Analogy Team. If you also belong to the team, you can get access from here

Cloud Analogy Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Cloud Analogy Java Developer Interview Questions and Answers

Updated 21 Aug 2023

Cloud Analogy Java Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Feb 2023. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Salesforce, java
  • Q2. Basic coding and languages

Interview Preparation Tips

Interview preparation tips for other job seekers - Go with basic knowledge of coding, Java and Salesforce

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

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 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

  • Q1. 

    N Queens Problem

    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.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    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).

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Circular Linked List Detection

    You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.

    Note:
    • A linked list is considered circula...
  • Ans. 

    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.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Basics of Java ,MySQL
  • Q2. For java do all object oriented programming (oops) concept very deeply
  • Q3. For mysql do all basics commands and query

Interview Preparation Tips

Interview preparation tips for other job seekers - Strong basic theoretical and practical knowledge required

I appeared for an interview in Jan 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Easy

  • Q1. 

    Find a Node in Linked List

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    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'

  • Answered by AI
  • Q3. 

    Cycle Detection in a Singly Linked List

    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 ...

  • Ans. 

    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

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 20 minutes
Round difficulty - Easy

  • Q1. 

    Top View of Binary Tree

    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.

    ...
  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Problem Statement: Delete Node In A Linked List

    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...

  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiEligibility criteriaAbove 7 CGPAOodles Technologies Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, System Design , any programming language, Database Management System, Operating System, NetworkingTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Feb 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Assignment 

Create a CRUD application

Round 3 - Technical 

(3 Questions)

  • Q1. Javascript, hoisting ,promise ,callback function
  • Q2. Array , object ,JSON,for loop
  • Q3. Introduction react js,and other frameworks ,like angular, Vue
Round 4 - HR 

(2 Questions)

  • Q1. What are your salary expectations?
  • Q2. Basic details for joining company

Interview Preparation Tips

Interview preparation tips for other job seekers - Always active for interview and day/day increase your skills and apply regarding jobs

I applied via AmbitionBox and was interviewed in Dec 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Basics questions of react native

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep learn and also try to improve your skills and communication skills
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Very basic aptitude questions along with few coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. A problem statement was given and we had to provide an optimal approach to design and handle that problem
  • Q2. Oops concepts, SQL queries
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Aptitude Test 

The basic question is related to profit percentage, time and distance

Round 2 - system design 

(1 Question)

  • Q1. Is the database schema of any type?
  • Ans. 

    Yes, the database schema can be of various types such as relational, hierarchical, network, object-oriented, etc.

    • Relational database schema is the most common type, using tables to store data with relationships between them.

    • Hierarchical database schema organizes data in a tree-like structure.

    • Network database schema allows multiple relationships between records.

    • Object-oriented database schema stores data as objects with...

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

BASIC DSA LIKE ARRAY AND STRING

Round 2 - Technical 

(2 Questions)

  • Q1. System Design for Electric Charger app ?
  • Ans. 

    System design for an electric charger app involves creating a user-friendly interface, integrating with payment systems, and ensuring efficient charging station management.

    • Design a user-friendly interface for users to locate and reserve charging stations

    • Integrate with payment systems for seamless transactions

    • Implement efficient charging station management to monitor availability and maintenance

    • Consider scalability for ...

  • Answered by AI
  • Q2. Design digram for that ?
  • Ans. 

    Design diagram for a software developer role.

    • Use UML diagrams to show class relationships and interactions

    • Include components like classes, interfaces, relationships, and methods

    • Consider using tools like Lucidchart or draw.io for creating the diagram

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't go for this company . Package is very bad.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
-

I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Arrays, basics. easy, some important topics in python and sql

Round 3 - Technical 

(2 Questions)

  • Q1. SQL basics question learned in online or self
  • Q2. Joins, groupby, clause, projection, having

Interview Preparation Tips

Interview preparation tips for other job seekers - do well

Cloud Analogy Interview FAQs

How many rounds are there in Cloud Analogy Java Developer interview?
Cloud Analogy interview process usually has 2 rounds. The most common rounds in the Cloud Analogy interview process are Resume Shortlist and One-on-one Round.
What are the top questions asked in Cloud Analogy Java Developer interview?

Some of the top questions asked at the Cloud Analogy Java Developer interview -

  1. Basic coding and langua...read more
  2. Salesforce, j...read more

Tell us how to improve this page.

Cloud Analogy Java Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Cloud Analogy Java Developer Salary
based on 8 salaries
₹3.5 L/yr - ₹10.9 L/yr
At par with the average Java Developer Salary in India
View more details

Cloud Analogy Java Developer Reviews and Ratings

based on 5 reviews

1.3/5

Rating in categories

2.6

Skill development

1.8

Work-life balance

2.3

Salary

1.1

Job security

1.6

Company culture

1.4

Promotions

1.9

Work satisfaction

Explore 5 Reviews and Ratings
Salesforce Developer
317 salaries
unlock blur

₹2.8 L/yr - ₹18.1 L/yr

Quality Analyst
67 salaries
unlock blur

₹3 L/yr - ₹9 L/yr

Salesforce Administrator
66 salaries
unlock blur

₹3 L/yr - ₹11.3 L/yr

Full Stack Developer
41 salaries
unlock blur

₹4.7 L/yr - ₹14.9 L/yr

Senior Salesforce Developer
34 salaries
unlock blur

₹8.4 L/yr - ₹29.4 L/yr

Explore more salaries
Compare Cloud Analogy with

Tekwissen

4.8
Compare

Softenger

4.1
Compare

XcelServ Solutions

4.5
Compare

Damco Solutions

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview