Filter interviews by
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 runti...
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
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
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 s...
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
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
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<Integer> numbers = new ArrayList<>(); numbers.add(1);
Make sure to import the ArrayList class
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<Integer> numbers = new ArrayList<>(); numbers.add(1);
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
posted on 20 Oct 2024
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
posted on 5 Oct 2021
I applied via Campus Placement and was interviewed before Oct 2020. There were 3 interview rounds.
posted on 16 Oct 2023
I applied via Referral and was interviewed in Apr 2023. There were 6 interview rounds.
First round was aptitude and 2 coding questions
Iterate through the numbers and keep track of the largest and second largest numbers.
Iterate through the numbers and compare each number with the current largest and second largest numbers.
Update the second largest number if a new number is found that is greater than the current second largest number.
Return the second largest number at the end of the iteration.
posted on 12 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
Soo easy aptitude exam asked questions
OOPs in Java refers to Object-Oriented Programming concepts, fibo likely refers to Fibonacci sequence, and sorting refers to arranging elements in a specific order.
OOPs in Java includes concepts like classes, objects, inheritance, polymorphism, and encapsulation.
Fibo likely refers to the Fibonacci sequence, where each number is the sum of the two preceding ones (e.g. 0, 1, 1, 2, 3, 5, ...).
Sorting involves arranging el...
I appeared for an interview in Dec 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Time - afternoon.
Interviewer jumped straight into interview, formal and comfortable environment.
1. Interviewer introduction
2. Interviewee introduction
3. Coding question 1 - difficulty medium, topic - arrays
- explain approach, write code (pseudo code is fine), dry run on given TCS.
4. Coding question 2 - same as above, only question was different. Slightly more difficult but on arrays only.
5. Questions on Python & Django - difficulty medium - write code related to queryset on django objects
6. SQL question to code - 10th highest salary.
You are given a string S
. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.
S = "...
Reverse the letters of a string while keeping non-alphabet characters in their original position.
Iterate through the string and store the non-alphabet characters in their original positions
Reverse the letters of the string using two pointers technique
Combine the reversed letters with the non-alphabet characters to get the final reversed string
Given an array arr
that contains an equal number of positive and negative elements, rearrange the given array such that positive and negative numbers are arranged a...
Rearrange an array with equal positive and negative numbers alternatively while maintaining relative order.
Iterate through the array and separate positive and negative numbers into two separate arrays.
Merge the two arrays alternatively into the original array.
Ensure the relative order of positive and negative numbers is maintained.
Round duration - 60 Minutes
Round difficulty - Medium
1. Intro of interviewer
2. Intro of interviewee
3. Questions on Python - decorators, static method, class methods
4. Principal of coding, best practices
5. Question on DB - What is indexing, how to improve, best use of indexing.
6. Questions on django - what is django ORM, What is sandbox, Django models, Django queries.
7. Previous job, what do you do, stack you work on.
Very friendly environment, very pleasing person, loved it.
Tip 1 : Good at coding (solving, explaining), especially Dynamic Programming questions like knapsack. Focus 70% time on coding
Tip 2 : Apply to jobs through referral not on company site. Very important.
Tip 3 : Prepare good projects with how to explain in interview.
Tip 4 : Sound very energetic, competitive and some one with eager to learn, so they select you thinking you can be taught things as you have good attitude.
Remember : Good attitude in good coder > Bad attitude in expert coder.
Tip 1 : Max three, projects, which are interesting to talk about, and you have won something for it.
Tip 2 : Leave lot of white space, keep content small and in one page
I appeared for an interview before May 2024, where I was asked the following questions.
I appeared for an interview in Jun 2021.
Round duration - 90 minutes
Round difficulty - Medium
Contained mix of coding, oops and general programming questions
Coding was live coding round
It was around 12pm
They used their own coding environment, I coded in java
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
Iterate through the array and keep track of the maximum sum subarray seen so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Consider the case where all elements in the array are negative.
Handle the case where the array contains only one element.
Round duration - 90 Minutes
Round difficulty - Hard
It was a collection of HLD AND LLD
Was around 12pm
This was conducted on bluejeans
Design a URL shortener with database and necessary components
Use a unique identifier for each URL to generate short links
Store the original URL and corresponding short link in a database
Implement a redirect mechanism to redirect short links to original URLs
Consider implementing analytics to track usage and performance
Ensure scalability and reliability of the system
Round duration - 60 Minutes
Round difficulty - Easy
It was a friendly managerial round with director of my team, he was very for me to come on board and explained truthfully how payu is.
Round duration - 30 Minutes
Round difficulty - Easy
Just a normal HR discussion, he informed me that I've been selected and we discussed about the salary part
Tip 1 : have strong grasp of graph based algorithms
Tip 2 : have strong knowledge of data structure
Tip 3 : should be able to find where to use appropriate design pattern
Tip 1 : keep it short and simple
Tip 2 : focus more on design/architecture of project
I applied via LinkedIn and was interviewed in Nov 2024. There were 2 interview rounds.
Testing an payment flow on the application
Software Development Engineer
136
salaries
| ₹6.8 L/yr - ₹15.9 L/yr |
Software Engineer
113
salaries
| ₹6.8 L/yr - ₹15 L/yr |
Senior Software Engineer
65
salaries
| ₹9 L/yr - ₹25 L/yr |
Software Development Engineer II
53
salaries
| ₹8.4 L/yr - ₹15.6 L/yr |
Software Developer
51
salaries
| ₹5.7 L/yr - ₹16 L/yr |
FIS
Broadridge Financial Solutions
PayPal
MasterCard