Filter interviews by
Be the first one to contribute and help others!
I was interviewed in Dec 2024.
One of the node of a 3 node cluster is down. Explain the step by step process to troubleshoot the issue.
Shell script & terraform code output was asked.
posted on 25 Jan 2025
I was interviewed in Dec 2024.
A standardized assessment that measures a person's skills, cognitive abilities, and potential to perform in a specific role.
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
It occurred on HackerRank.
I applied via Company Website and was interviewed in Dec 2024. There were 3 interview rounds.
Basic self evaluation test.
Handling class imbalance involves techniques like resampling, using different algorithms, and adjusting class weights.
Use resampling techniques like oversampling or undersampling to balance the classes.
Utilize algorithms that are robust to class imbalance, such as Random Forest, XGBoost, or SVM.
Adjust class weights in the model to give more importance to minority class.
Use evaluation metrics like F1 score, precision, r...
posted on 28 Nov 2024
I was interviewed in Jul 2024.
I applied via Company Website and was interviewed in Oct 2024. There were 4 interview rounds.
Basic Python, SQL, and Bash questions
Data pipeline design involves creating a system to efficiently collect, process, and analyze data.
Understand the data sources and requirements before designing the pipeline.
Use tools like Apache Kafka, Apache NiFi, or AWS Glue for data ingestion and processing.
Implement data validation and error handling mechanisms to ensure data quality.
Consider scalability and performance optimization while designing the pipeline.
Doc...
Arrays and strings - 90 mins
Create Modules, railway reservation system - 60 mins
posted on 28 Nov 2024
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
To retrieve a value, the key is hash...
Find anagrams from a string array
Iterate through each string in the array
Sort the characters of each string to create a key for comparison
Use a hashmap to group anagrams together
Return the grouped anagrams as arrays
A top view of a binary tree shows the nodes visible when looking at the tree from the top.
The top view of a binary tree is the set of nodes visible when looking at the tree from the top.
Nodes at the same horizontal distance from the root are considered at the same level.
Use a map to store the horizontal distance of each node and only keep the first node encountered at each horizontal distance.
Height of a binary tree is the maximum number of edges on the longest path from the root node to a leaf node.
Height of an empty tree is -1
Height of a tree with only one node is 0
Height of a binary tree can be calculated recursively by finding the height of left and right subtrees and adding 1 to the maximum of the two heights
Bosch Global Software Technologies
Amdocs
Automatic Data Processing (ADP)
24/7 Customer