i
Kloud 9
Filter interviews by
Design a system to handle high traffic on a social media platform.
Use load balancing to distribute traffic across multiple servers.
Implement caching mechanisms to reduce database load.
Utilize content delivery networks (CDNs) to serve static content faster.
Scale horizontally by adding more servers as traffic increases.
I applied via Recruitment Consulltant and was interviewed in Jan 2023. There were 3 interview rounds.
Passed with distinction as I answered all question
Kloud 9 interview questions for popular designations
I applied via Recruitment Consulltant and was interviewed before Apr 2022. There were 2 interview rounds.
Data lake in AWS Redshift is a centralized repository for storing structured and unstructured data.
Data can be stored in its native format
Allows for easy access and analysis of large amounts of data
Can be used for data exploration, machine learning, and business intelligence
Redshift Spectrum can be used to query data stored in S3
Spark based programming is a data processing framework that allows for distributed computing.
Spark is an open-source distributed computing framework
It allows for processing large datasets in parallel across a cluster of computers
Spark supports multiple programming languages such as Java, Scala, and Python
It provides APIs for batch processing, stream processing, machine learning, and graph processing
Spark uses in-memory...
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
based on 6 interviews
Interview experience
5-8 Yrs
Not Disclosed
7-10 Yrs
Not Disclosed
12-20 Yrs
Not Disclosed
Devops Engineer
35
salaries
| ₹4 L/yr - ₹10.5 L/yr |
Senior Software Engineer
20
salaries
| ₹10 L/yr - ₹24 L/yr |
Software Developer
14
salaries
| ₹6.5 L/yr - ₹15 L/yr |
Senior Devops Engineer
14
salaries
| ₹7.8 L/yr - ₹15.4 L/yr |
Data Engineer
12
salaries
| ₹6 L/yr - ₹22.5 L/yr |
Amazon Web Services
Microsoft Azure
IBM
Oracle