Filter interviews by
The duration of this round was around 20 minutes and there were 40 questions in total. This round consisted of standard mathematical, logical aptitude questions. Aptitude questions based on directions, speed and time, profit loss, etc. were asked. Out of 40 questions, around 15 questions were diagram based questions like finding the odd one, predicting the next pattern, etc.
The Second Round is an Online coding test that lasts for around 30 minutes to 1 hour. It was held on the coder byte platform. There were around 5-6 MCQs and 1 Coding Question. MCQ Questions - Predict the output, find errors, Simple language-based questions etc. The Coding Question was from Arrays, Strings, etc. For Example, You are given a string like “ONE PLUS THREE MINUS TWO” and you will have to give output as “TWO”
They will give you a frontend or Backend role based on your performance in Interviews Rounds.
Print Fibonacci series
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones
The first two numbers of the series are always 0 and 1
The series can be generated using a loop or recursion
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181
Implement Push Function for Queue using Array or ArrayList
Create a function that takes an array or ArrayList and a string as input
Add the string to the end of the array or ArrayList
Return the updated array or ArrayList
Create an ArrayList and add 5 numbers to it.
Declare an ArrayList variable and initialize it
Use the add() method to add numbers to the ArrayList
Numbers can be of any data type (int, double, etc.)
Example: ArrayList
Make sure to import the ArrayList class
HashMap in Java is internally stored as an array of linked lists.
HashMap uses hashing to store key-value pairs
Each key is hashed to an index in the array
If there are collisions, a linked list is used to store multiple values at the same index
The default initial capacity of HashMap is 16 and load factor is 0.75
HashMap is not thread-safe and requires synchronization for concurrent access
Explanation of OOPS pillars with real-life examples
Abstraction: Hiding implementation details, e.g. using a TV remote without knowing how it works
Encapsulation: Grouping related data and functions, e.g. a car's engine and transmission
Inheritance: Creating new classes from existing ones, e.g. a sports car class inheriting from a car class
Polymorphism: Using a single interface to represent multiple classes, e.g. a shape ...
Overloading and overriding are two concepts in object-oriented programming that allow methods to have multiple implementations.
Overloading is when a class has multiple methods with the same name but different parameters.
Overriding is when a subclass provides a different implementation of a method that is already defined in its superclass.
Overloading is resolved at compile-time while overriding is resolved at runtime.
Ex...
I implemented various features including X, Y, and Z.
Implemented feature X which improved system performance by 20%
Developed feature Y which allowed for real-time data analysis
Added feature Z which improved user experience by simplifying the interface
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Jul 2024. There was 1 interview round.
I have to write code for a load balancer. The code should be testable and imahoild be thread safe
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
Spring Boot offers advantages like rapid development, easy configuration, embedded servers, production-ready features, and more.
Rapid development: Spring Boot simplifies the setup and configuration of Spring applications, allowing developers to focus on writing business logic.
Easy configuration: Spring Boot provides auto-configuration, reducing the need for manual setup and boilerplate code.
Embedded servers: Spring Boo...
I applied via Instahyre and was interviewed in Jan 2021. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at a rate of one node per iteration and the other moving at a rate of two nodes per iteration.
If there is a loop in the linked list, the two pointers will eventually meet at some node.
To find the starting point of the loop, we reset one of the pointers to the head of the linked list and ...
Software Development Engineer
134
salaries
| ₹6.3 L/yr - ₹17 L/yr |
Software Engineer
102
salaries
| ₹6.8 L/yr - ₹15 L/yr |
Senior Software Engineer
76
salaries
| ₹8.5 L/yr - ₹24 L/yr |
Software Developer
56
salaries
| ₹5.7 L/yr - ₹16 L/yr |
Software Development Engineer II
52
salaries
| ₹8.4 L/yr - ₹15.6 L/yr |
Ingenico Group
NCR Corporation
Diebold Nixdorf
Fiserv