AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Cloudera Software Developer Interview Questions, Process, and Tips
Top Cloudera Software Developer Interview Questions and Answers
- Q1. Dice Throws Problem Statement You are given D dice, each having F faces numbered from 1 to F . The task is to determine the number of possible ways to roll all the dice ...read more
- Q2. Stack using Two Queues Problem Statement Develop a Stack Data Structure to store integer values using two Queues internally. Your stack implementation should provide the ...read more
- Q3. Maximum Subarray Sum Problem Statement Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) t ...read more
Cloudera Software Developer Interview Experiences
2 interviews found
Anonymous
Coding test was simple with 3 questions, 1 with SQL and other 2 with dsa questions
(2 Questions)
- Q1. Resume based questions
- Q2. Resume based question
I was interviewed before Sep 2020.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
4 coding questions on hackerrank.
- Q1.
Dice Throws Problem Statement
You are given
Ddice, each havingFfaces numbered from 1 toF. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num... - Ans.
The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of ways to achieve each sum with the given number of dice.
Iterate through the dice and faces to calculate the number of ways to reach each sum.
Return the result modulo 10^9 + 7.
Optim...
- Q2.
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
... - Ans.
Implement a stack using two queues to store integer values with specified functions.
Use two queues to simulate stack operations efficiently.
Maintain the top element in one of the queues for easy access.
Ensure proper handling of edge cases like empty stack.
Example: Push elements 5, 10, 15; Pop elements; Check top element.
Example: Check if stack is empty; Get stack size.
- Q3.
Maximum Subarray Sum Problem Statement
Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among al...
- Ans.
Find the maximum sum of a subarray in an array of integers.
Iterate through the array and keep track of the maximum sum subarray ending at each index.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider the case where all elements are negative to handle edge cases.
Example: For input [1, -2, 3, -1, 2], the maximum subarray sum is 4.
Round duration - 60 minutes
Round difficulty - Medium
My 1st technical round began with a small introduction and a discussion on my projects. After that, my complete interview revolved around Object-oriented principles and 1 basic coding question. The interviewer asked all the pillars of Object-oriented along with use cases and where have I implemented them in my projects.
(1 Question)
Round duration - 45 minutes
Round difficulty - Easy
In my 2nd technical round, the interviewer began with the complete discussion of my projects. He asked me everything about them like which technologies I have used, why I have used them, what are the alternatives, what are the real-life applications of these projects. After this, He asked questions on Computer Networks, Operating system, Database Management system and at the end, some of the SQL queries. SQL queries were quite easy, I found one of the queries tricky and harder as compared to other i.e print nth largest salary of the employees. The interviewer also asked me why I was not able to code one of the questions in the coding round. I explained the complete approach of that question and he was quite satisfied. This technical round was of 1 hour long.
- Q1. Print the nth largest salary from a given list of salaries.
- Ans.
Find the nth largest salary from a list of salaries.
Sort the list of salaries in descending order.
Remove duplicates from the sorted list.
Return the salary at index n-1 from the sorted list.
(1 Question)
Round duration - 35 minutes
Round difficulty - Easy
There were two panellists in this round and they began with a small introduction. One of them asked me about my capstone project which was based on object recognition task and deep learning. He just told me to explain deep learning in complete detail and how can it be used on my college campus. Then, He asked me what technologies are being used and how I trained my model as the model was quite heavy and computationally intensive. Then, they asked me how I cope up with my team members in the pandemic situation and how I managed to interact with them.
- Q1. What are the basic applications of deep learning, and how can I implement it in my college?
- Ans.
Deep learning has applications in image and speech recognition, natural language processing, autonomous vehicles, etc.
Image recognition - identifying objects in images, used in self-driving cars, medical imaging, etc.
Speech recognition - converting spoken language into text, used in virtual assistants like Siri, Alexa, etc.
Natural language processing - understanding and generating human language, used in chatbots, lang...
Interview Preparation Tips
Tip 1 : Practice at least 600 questions from leetcode.
Tip 2 : Make sure you participate in every long challenge of CodeChef.
Tip 3 : Focus more on your projects.
Tip 1 : Do not put false things on a resume.
Tip 2 : Have some projects on a resume.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
11 Questions
- Q1. Asked about my project? Also asked me questions about ACID properties of database and indexing in a database
- Q2. There were also questions related to OOPS concepts including polymorphism, composition, aggregation, inheritance, Abstract classes, interface; difference between usage of abstract class and interface, can ...
- Q3. There was another question on run time and compile time binding and under which category do we classify method overloading
- Q4. Code for deleting the duplicate nodes in a sorted link list?
- Ans.
Code to delete duplicate nodes in a sorted linked list
Traverse the linked list and compare adjacent nodes
If nodes are equal, delete one of them
Repeat until all duplicates are removed
- Q5. Printing root to leaf paths in a binary search tree
- Ans.
Printing all root to leaf paths in a binary search tree
Traverse the tree recursively and keep track of the current path
When a leaf node is reached, add the current path to the list of paths
Print all the paths in the list
Use an array of strings to store the paths
- Q6. Given an Array of Integers, Find two elements in the array whose sum is closest to zero?
- Ans.
Find two integers in an array whose sum is closest to zero.
Sort the array in ascending order.
Initialize two pointers at the beginning and end of the array.
Move the pointers towards each other until the sum is closest to zero.
- Q7. What are virtual functions, what is their role? Questions related to virtual functions?
- Q8. You are given the details of each transaction of each item i.e. item_name, quantity, price. So at the end of the day, you want top 50 items that have been sold. There are two cases: - In the first case you...
- Q9. How do you quickly count the number of set bits in a 32-bit integer in linear time (with respect to the number of set bits)?
- Ans.
Count set bits in a 32-bit integer in linear time
Use bit manipulation to count set bits
Divide the integer into 16-bit chunks and count set bits in each chunk
Use lookup tables to count set bits in each 8-bit chunk
Use parallel processing to count set bits in multiple integers simultaneously
- Q10. Determining width of binary tree i.e. using breadth wise traversal
- Ans.
To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.
Perform a breadth-first traversal of the binary tree
Count the number of nodes at each level
Keep track of the maximum number of nodes seen at any level
Return the maximum number of nodes seen
- Q11. Why files are preferred over databases?
- Ans.
Files are preferred over databases for certain types of data and applications.
Files are faster for small amounts of data.
Files are easier to manage and backup.
Files are more flexible for certain types of data, such as images or videos.
Databases are better for complex data relationships and queries.
Databases are more secure and scalable for large amounts of data.
The choice between files and databases depends on the spec
Interview Preparation Tips
Experience: There were questions from Operating Systems, C, Algorithms, Data Structures
Round: Test
Experience: This round had 15 questions.Data structures, C++ questions, algorithms (DFS/BFS)
Skills: java, OOP, Algorithm
College Name: IIT KANPUR
Skills evaluated in this interview
I was interviewed in Oct 2020.
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
- Q1.
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
- Ans.
Given a sorted N * N matrix, find the position of a target integer 'X'.
Use binary search in each row to narrow down the search space.
Start from the top-right corner or bottom-left corner for efficient search.
Handle cases where 'X' is not found by returning {-1, -1}.
- Q2.
Valid Parenthesis Problem Statement
Given a string
strcomposed solely of the characters "{", "}", "(", ")", "[", and "]", determine whether the parentheses are balanced.Input:
The first line contains ... - Ans.
Check if given string of parentheses is balanced or not.
Use a stack to keep track of opening parentheses
Pop from stack when encountering a closing parenthesis
Return 'YES' if stack is empty at the end, 'NO' otherwise
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
- Q1.
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...
- Ans.
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
Iterate through the array and maintain a count of 0s and 1s encountered so far.
Store the count difference in a hashmap with the index as key.
If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.
Return the length of the largest such subarray found.
- Q2.
Inplace Rotate Matrix 90 Degrees Anti-Clockwise
You are provided with a square matrix of non-negative integers of size
'N x N'. The task is to rotate this matrix by 90 degrees in an anti-clockwise directi... - Ans.
Rotate a square matrix by 90 degrees anti-clockwise without using extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate the matrix in place
Handle odd-sized matrices separately by adjusting the loop boundaries
Interview Preparation Tips
Tip 1 : Practice standard questions of data structures and algorithms
Tip 2 : Have good knowledge of DBMS
Tip 3 : PracticeSQL Queries
Tip 1 : Have some team projects
Tip 2 : Have a project on DBMS
Tip 3 : Don't put false things on resume, they ask each and everything.
Skills evaluated in this interview
I was interviewed in Oct 2020.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of medium difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
500+ students sat in this round out which 20 were shortlisted for the next interview round.
- Q1.
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
- Ans.
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
Use graph coloring algorithm like BFS or DFS to check if it is possible to color the graph with two colors.
Check if any adjacent vertices have the same color. If yes, then it is not possible to color the graph as described.
If the graph has connected components, color each compo...
- Q2.
Count Inversions Problem Statement
Given an integer array
ARRof sizeN, your task is to find the total number of inversions that exist in the array.An inversion is defined for a pair of integers in the...
- Ans.
Count the number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
In this round, 2 interviewers were present. They shared Docs in which we had to write code. Our camera was on.
- Q1.
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...
- Ans.
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return the preorder traversal of the sum tree.
Traverse the tree in a bottom-up manner to calculate the sum of children for each node.
Set leaf nodes to 0 and update non-leaf nodes with the sum of their children.
Return the preorder traversal of the modified tree.
- Q2.
Convert a Number to Words
Given an integer number
num, your task is to convert 'num' into its corresponding word representation.Input:
The first line of input contains an integer ‘T’ denoting the number o... - Ans.
Convert a given integer number into its corresponding word representation.
Implement a function that takes an integer as input and returns the word representation of the number in English lowercase letters.
Break down the number into its individual digits and convert each digit into its word form (e.g., 1 to 'one', 2 to 'two').
Combine the word forms of individual digits to form the word representation of the entire numbe...
Round duration - 30 minutes
Round difficulty - Easy
This was HR round but consisted problems related to core subjects too.
Interview Preparation Tips
Tip 1 : Just be confident during interview and if you are stuck in between any question, then ask for a hint from the interviewer.
Tip 2 : The practice is key for success, so practice hard for Data Structures and Algorithms coding problems on Coding ninjas as it is the best platform for coding.
Tip 3 : Also you may practice on Geeks For Geeks or any other interview portal.
Application resume tips for other job seekersTip 1 : Mention all internships which you have done, as it increases your chances of shortlisting your resume.
Tip 2 : Also just write that skills which you are pretty confident about.
Skills evaluated in this interview
I applied via LinkedIn and was interviewed in May 2021. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Java concepts in details,Java coding questions, Selenium web driver ,Few of Manual testing concepts, Testscenario writing, Test Frameworks
Interview Preparation Tips
Selected
I applied via Job Fair and was interviewed before Jun 2023. There were 3 interview rounds.
(1 Question)
- Q1. A robot that cleans the whole room
- Ans.
A robot that cleans the whole room is a useful tool for maintaining cleanliness and saving time.
Efficiently cleans all surfaces in the room
Can reach tight spaces and corners easily
Saves time and effort for the user
Examples: Roomba vacuum cleaner, iRobot Braava mopping robot
(1 Question)
- Q1. DSA medium questions
(1 Question)
- Q1. Background verification
Selected
I was interviewed before May 2023.
(2 Questions)
- Q1. Sql related question , they will more focus in java and sql
- Q2. Mult threading , collection
Coding is tuff should now basics just important
(2 Questions)
- Q1. Basics on core subjects
- Q2. Dsa questions asked there only
Interview Preparation Tips
I was interviewed before Sep 2020.
(1 Question)
Round duration - 120 Minutes
Round difficulty - Easy
The round was conducted in day around 3PM.
- Q1.
Partition Equal Subset Sum Problem
Given an array
ARRconsisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub... - Ans.
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the results of subproblems.
Check if the sum of the array is even before attempting to partition it.
Iterate through the array and update the 2D array based on the sum of subsets.
Return true if a subset with half the sum is found, false ot
(2 Questions)
Round duration - 30 Minutes
Round difficulty - Easy
The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.
- Q1.
Convert Sentence to Pascal Case
Given a string
STR, your task is to remove spaces fromSTRand convert it to Pascal case format. The function should return the modifiedSTR.In Pascal case, words are con...
- Ans.
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
Iterate through each character in the string
If the character is a space, skip it
If the character is not a space and the previous character is a space or it is the first character, capitalize it
- Q2. Write an SQL query to retrieve the Nth highest salary from a database.
- Ans.
SQL query to retrieve the Nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the Nth highest salary
Consider handling cases where there might be ties for the Nth highest salary
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
This round was conducted 15mins after 1st round.
- Q1.
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
- Ans.
Remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N'.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Remove the node at the calculated position.
Handle edge cases like removing the head or tail of the list.
Update the pointers accordingly after removal.
Interview Preparation Tips
Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers
Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)
Skills evaluated in this interview
Cloudera Interview FAQs
Recently Viewed
PHOTOS
InsuranceDekho
3 office photos
LIST OF COMPANIES
Credit Bajaar
Overview
SALARIES
Brillo Technologies
INTERVIEWS
Regami Solutions
No Interviews
INTERVIEWS
Regami Solutions
No Interviews
INTERVIEWS
Oriserve
No Interviews
INTERVIEWS
Electronic Arts
No Interviews
DESIGNATION
INTERVIEWS
Citicorp
No Interviews
INTERVIEWS
Oriserve
No Interviews
Tell us how to improve this page.
Cloudera Interviews By Designations
- Cloudera Software Engineer Level 1 Interview Questions
- Cloudera Software Developer Interview Questions
- Cloudera Softwaretest Engineer Interview Questions
- Cloudera Customer Support Executive Interview Questions
- Cloudera Solution Engineer Interview Questions
- Cloudera Software Engineer Interview Questions
- Cloudera Customer Operations Engineer Interview Questions
- Cloudera Customer Support Officer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Cloudera Software Developer Interview Process
based on 1 interview
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Cloudera Software Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Customer Operations Engineer
57
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Customer Operations Engineer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
33
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer2
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Hortonworks
MapR Technologies
Teradata
MongoDB
- Home >
- Interviews >
- Cloudera Interview Questions >
- Cloudera Software Developer Interview Questions
