i
Red Hat
Filter interviews by
I applied via Campus Placement and was interviewed in Jun 2023. There were 4 interview rounds.
Basic 10th standard level aptitude problem
Basic very easy level questions
Count frequency of characters in a word, explain ACID properties, swap 2 numbers without extra variable.
To count frequency of characters in a word, create a hashmap to store character counts.
ACID properties in database: Atomicity, Consistency, Isolation, Durability.
To swap 2 numbers without extra variable, use XOR operation: a = a ^ b, b = a ^ b, a = a ^ b.
Example: word = 'hello', frequency = {'h': 1, 'e': 1, 'l': 2, '
My first step would be to gather more information about the issue from the client.
Ask the client to provide specific details about the issue such as when it occurred, what actions were taken before the issue occurred, and any error messages received.
Try to replicate the issue on a test environment to understand the root cause.
Communicate with the client to keep them updated on the progress and potential solutions.
Prior...
I applied via Approached by Company and was interviewed in Aug 2023. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2022. There were 6 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 60 Minutes
Round difficulty - Medium
three coding questions , no mcq, 1 hr limit
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
The task is to identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Check if the sum of the triplet equals the specified number.
Print the valid triplets or return -1 if no triplet exists.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging node
Round duration - 45 Minutes
Round difficulty - Medium
1st they asked area of interest like frontend or backend. I said backend
Then thy asked a array based question followed by a linked list.
Then he asked some computer fundametals.
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Identify elements with count greater than 1 as duplicates.
Return the duplicate elements as the output.
Handle edge cases like empty array or no duplicates found.
You are provided with a singly linked list consisting of integer values and an integer 'K'. Your task is to eliminate all nodes from the linked list that ...
Remove nodes with specific value from a singly linked list.
Traverse the linked list and remove nodes with value equal to 'K'.
Update the references of the previous node to skip the removed node.
Handle edge cases like removing the head node or multiple nodes with the same value.
Return the modified linked list after removal.
Round duration - 60 Minutes
Round difficulty - Medium
mainly focused on dsa , dbms and working of an API
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...
Sort a Singly Linked List based on actual values instead of absolute values.
Traverse the linked list and store the values in an array.
Sort the array based on actual values.
Update the linked list with the sorted values.
Tip 1 : Having a prior internship with a dev role will definitely help in interviews.
Tip 2 : If you are not good in frontend then prepare DSA and computer fundamentals very well
Tip 3 : Apart from Leetcode medium questions Have hands on DMBS queries
Tip 4 : Having an API based project will be very helpful for backend roles
Tip 1 : They will mostly ask in first round if you interested in frontend or backend roles and then the follow up interviews will happen in that direction.
Tip 2 : so make your resume specific to the role you are interested in.
Tip 3 : Write what you have worked on in your prior internship.
Tip 4 : if this is your first internship write your strong points and only things which you are confident in because after selection interviewer will driil you on those topics.
I applied via Company Website and was interviewed before Mar 2022. There were 3 interview rounds.
I used PyMongo library to connect to MongoDB and perform CRUD operations in Python
Installed PyMongo library using pip
Created a MongoClient object to connect to the MongoDB server
Accessed the database and collection using the MongoClient object
Performed CRUD operations using the collection object
Used pymongo.cursor.Cursor to iterate over the query results
English ang logical and aptitude test online
I applied via Company Website and was interviewed in Mar 2022. There were 2 interview rounds.
About Java
I applied via Campus Placement and was interviewed before Oct 2021. There were 5 interview rounds.
First round was mix of aptitude, cs fundamentals, quant, programming and flow chart based mcq.
Note-
1- There was timer for each sections and subsections.
2- Once you move ahead of a ques then u cant go back on previous ques.
Data Structure & Algorithm based ques.
Toughness- Leetcode medium.
Few ques on dbms in the end.
Note- Complete code from scratch to be written.
Data Structure &Algorithm based ques.
Toughness- Leetcode medium.
In the end, project was discussed briefly.
Note- Complete code from scratch.
Coding + HR combined.
Many coding ques were ask and then ques were manipulated to come up with new logic.
Here, only pseudo code based discussion.
In the end, entire resume was discussed from college, project, future goals and hr based ques.
based on 2 interviews
Interview experience
based on 6 reviews
Rating in categories
Technical Support Engineer
228
salaries
| ₹7 L/yr - ₹18 L/yr |
Software Engineer
167
salaries
| ₹10.1 L/yr - ₹26 L/yr |
Associate Technical Support Engineer
109
salaries
| ₹6.5 L/yr - ₹10 L/yr |
Senior Software Engineer
97
salaries
| ₹14 L/yr - ₹42 L/yr |
Senior Technical Support Engineer
87
salaries
| ₹11 L/yr - ₹26.3 L/yr |
IBM
Oracle
Thomson Reuters
Oracle Cerner