Filter interviews by
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Indexes are database structures that improve the speed of data retrieval operations.
Indexes are created on one or more columns of a table.
They work like a book's index, allowing the database to quickly find the data.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes are separate structures that point to the data.
Indexes can be unique or non-...
OLTP stands for Online Transaction Processing and OLAP stands for Online Analytical Processing.
OLTP is used for transactional processing of data in real-time.
OLAP is used for analytical processing of data for decision-making purposes.
OLTP databases are designed for high-speed data processing and retrieval.
OLAP databases are designed for complex queries and data analysis.
Examples of OLTP systems include banking systems,...
Top trending discussions
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview in Jul 2019.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.
Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.
Web service flow involves a sequence of steps, such as sending a reques...
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Yes consist of two code and questions MCQ of ds ,algo,Linz,shell,English and DBMS
Test happens with your webcam access.
Calculate the Nth term in the Fibonacci sequence using the formula: F(n) = F(n-1) + F(n-2)
where F(1) = F(2) = 1
.
Given a number N, determine the Nth Fibonacci number.
Calculate the Nth Fibonacci number using the given formula and constraints.
Implement a function to calculate the Nth Fibonacci number using the formula F(n) = F(n-1) + F(n-2) with base cases F(1) = F(2) = 1.
Use dynamic programming or recursion to efficiently compute the Fibonacci number for large N values.
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the output should be 5 as th
Round duration - 40 minutes
Round difficulty - Hard
Late night around at 8 pm
Environmental is positive.
Interviewer made me feel positive
Ninja is tasked with implementing a priority queue using the Heap data structure. Since Ninja is busy with tournament preparations, your help is requested to complete this ta...
Implement a priority queue using Heap data structure with functions like push, pop, getMaxElement, and isEmpty.
Implement push() function to insert element into the priority queue.
Implement pop() function to delete the largest element from the queue.
Implement getMaxElement() function to return the largest element.
Implement isEmpty() function to check if the queue is empty.
Round duration - 10 Minutes
Round difficulty - Easy
Morning time
Positive environment
Nice interviewer
Tip 1 : practice on subject in which you are strong enough and unbeatable
Tip 2 : Always go through previous interview experiences on internet
Tip 3 : follow continuety
Tip 1 : mention only you strong topics ,don't include anything you don't know about
Tip 2 : always make your resume one pager
I appeared for an interview before Sep 2020.
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedI applied via Company Website and was interviewed before Sep 2020. There were 3 interview rounds.
based on 10 reviews
Rating in categories
Senior Software Engineer
13
salaries
| ₹19.6 L/yr - ₹28 L/yr |
Senior Automation Test Engineer
6
salaries
| ₹20 L/yr - ₹24 L/yr |
Softwaretest Engineer
6
salaries
| ₹8.4 L/yr - ₹13.6 L/yr |
Software Engineer
5
salaries
| ₹8.3 L/yr - ₹13.6 L/yr |
Software Engineer II
5
salaries
| ₹13.5 L/yr - ₹25 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer