i
Cloud Analogy
Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2023. There were 2 interview rounds.
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 Naukri.com and was interviewed before Sep 2020. There were 3 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
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.
posted on 19 Sep 2024
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
Very basic aptitude questions along with few coding questions
posted on 15 Apr 2024
I applied via Campus Placement
The basic question is related to profit percentage, time and distance
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...
posted on 5 Aug 2024
BASIC DSA LIKE ARRAY AND STRING
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 ...
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
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
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Salesforce Developer
317
salaries
| ₹2.8 L/yr - ₹18.1 L/yr |
Quality Analyst
67
salaries
| ₹3 L/yr - ₹9 L/yr |
Salesforce Administrator
66
salaries
| ₹3 L/yr - ₹11.3 L/yr |
Full Stack Developer
41
salaries
| ₹4.7 L/yr - ₹14.9 L/yr |
Senior Salesforce Developer
34
salaries
| ₹8.4 L/yr - ₹29.4 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions