i
Red Hat
Filter interviews by
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...
The steps are as follows:
Round duration - 90 minutes
Round difficulty - Easy
This was my first technical round. he asked me about all my projects and the technologies used. some questions were on c and c++. what is heap , stack, memory allocation methods. Basically they covered all the concepts of c from string to pointers. Then they gave me one coding question which was on arrays. Best part was interviewers were very friendly.
Given a positive integer N
, your task is to find and display all jumping numbers that are less than or equal to N
.
A number is termed a jumping number if every adjacent ...
The steps are as follows:
Round duration - 75 minutes
Round difficulty - Hard
This round was completely on data structures . he asked me all the questions related to linked list like detect a loop, remove a loop and graphs like BFS and DFS algorithms and some on trees. even on Adjacency matrix and adjacency list.
Round duration - 60 minutes
Round difficulty - Medium
Tip 1 : Practice coding daily
Tip 2 : Learn new concepts everyday
Tip 3 : Know all that standard coding questions
Tip 1 : Do not bluff on ur resume.
Tip 2 : Keep relevant projects.
I applied via Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
It was a coding round interview along with interviewer via Virtual mode. I was given 2 coding questions on HackerRank for the interview:
1. one was an easy problem on counting minimum replacements.
2. "pat is an ordinary kid who works hard to be a great runner...." this was a challenging problem (which I managed to solve).
3. I was asked some basic Python questions, as the role was for a Python Developer.
I would use a relational database like MySQL for the Parking lot as it provides structured data storage and supports complex queries.
Relational databases like MySQL offer structured data storage for parking lot information
Supports complex queries for managing parking lot data efficiently
Ability to handle large amounts of data and transactions
Provides data integrity and security features
Can easily integrate with other s
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
I applied via Walk-in and was interviewed in Nov 2024. There were 2 interview rounds.
1st round is aptitude and pesudocode
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
In first round 4 coding question like 1 dsa 2 database and one is api and question is very simple . coding round was conducted in hackerrank
Again same but dsa question and oops concept in deep level
I applied via campus placement at Maharaja Agrasen Institute of Technology, Delhi and was interviewed in Jul 2024. There were 3 interview rounds.
3 questions of dsa based on dp and trees
Optimize delivery between warehouse to the person ordered.
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 2 interview rounds.
Basic questions were given..bar graphs,pie charts
Oops concept stands for Object-Oriented Programming concepts which include principles like inheritance, encapsulation, polymorphism, and abstraction.
Oops concept is a programming paradigm that focuses on objects and classes.
It includes principles like inheritance, where a class can inherit properties and behaviors from another class.
Encapsulation is another principle where data is wrapped within a class and can only be...
Hash Map is a data structure that stores key-value pairs and uses a hash function to map keys to their corresponding values.
Hash Map uses a hash function to determine the index of the key-value pair in the underlying array.
Collisions can occur when multiple keys hash to the same index, which can be resolved using techniques like chaining or open addressing.
Hash Map typically has a load factor threshold to determine whe...
based on 1 review
Rating in categories
Technical Support Engineer
225
salaries
| ₹6 L/yr - ₹19.8 L/yr |
Software Engineer
143
salaries
| ₹9.5 L/yr - ₹27.5 L/yr |
Associate Technical Support Engineer
112
salaries
| ₹7 L/yr - ₹10 L/yr |
Senior Software Engineer
97
salaries
| ₹14 L/yr - ₹43 L/yr |
Senior Technical Support Engineer
86
salaries
| ₹11 L/yr - ₹25 L/yr |
IBM
Microsoft Corporation
Oracle
SAP