Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Apr 2023. There were 5 interview rounds.
2 Coding question of Hard difficulty level and 1 SQL question of hard difficulty level
Students who solved 1 question correctly got shortlisted for interviews .
9 students were shortlisted out of 150+ students .(Only CSE was eligible to apply)
Intersection of two linked lists is finding the common node(s) between them.
Traverse both lists simultaneously and compare each node to find the intersection point.
Use a hash set to store nodes of one list and check for intersection in the other list.
Optimize by finding the lengths of both lists and aligning the pointers before comparison.
I applied via LinkedIn and was interviewed in Jun 2022. There were 4 interview rounds.
I have intermediate level experience in programming with Java, Python, and C++.
I have worked on projects involving data structures and algorithms.
I have experience with object-oriented programming and design patterns.
I have developed web applications using frameworks like Spring and Django.
I have also worked on projects involving machine learning and natural language processing.
I am comfortable working with databases a
Top trending discussions
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
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
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.
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
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
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
I was interviewed in Feb 2017.
I was interviewed before May 2016.
Some of the top questions asked at the Cloudera Software Engineer Level 1 interview -
based on 1 interview
Interview experience
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