i
UST
Filter interviews by
I was interviewed in Jan 2025.
Inheritance is a concept in object-oriented programming where a class can inherit attributes and methods from another class.
Allows for code reusability by creating a new class based on an existing class
Derived class (subclass) inherits properties and behaviors from a base class (superclass)
Can have multiple levels of inheritance, creating a hierarchy of classes
Example: Animal class can be a base class with Dog and Cat
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
It enables a single interface to be used for different data types or classes.
Examples include method overloading and method overriding in object-oriented programming.
Code to reverse a string using array of characters
Iterate through half of the string and swap characters from start and end
Use a temporary variable to store the character being swapped
Handle edge cases like empty string or single character string
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
Abstraction is the concept of hiding complex implementation details and showing only the necessary features to the outside world.
Abstraction allows us to focus on what an object does rather than how it does it
Achieved through abstract classes and interfaces in object-oriented programming
Example: A car dashboard abstracts the internal workings of the car and provides only essential information to the driver
Hashtable is synchronized, while hashmap is not. Hashtable does not allow null keys or values, while hashmap does.
Hashtable is synchronized, while hashmap is not
Hashtable does not allow null keys or values, while hashmap does
Hashtable is a legacy class, while hashmap is a newer class
The get() method in HashMap retrieves the value associated with a specified key.
get() method takes a key as input and returns the value associated with that key in the HashMap.
Internally, get() uses the hash code of the key to find the corresponding bucket in the HashMap.
If multiple keys have the same hash code, get() uses the equals() method to find the correct key-value pair.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization helps in minimizing data redundancy by dividing the database into multiple tables and defining relationships between them.
It ensures data integrity by avoiding update anomalies and inconsistencies.
There are different normal forms such as 1NF, 2NF, 3NF, BCNF, and 4NF, each with specific rules to fo...
Constraints are limitations or restrictions placed on a system or process.
Constraints define the boundaries within which a system must operate.
They can include limitations on resources, time, or functionality.
Examples of constraints in software engineering include memory limitations, processing speed, and input/output requirements.
Query to retrieve the 3rd highest salary from the employee table
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the 3rd highest salary
Traverse the linked list to find the 2nd last node and return its value.
Traverse the linked list while keeping track of the current and previous nodes.
Once at the end of the list, return the value of the previous node.
Use two variables to keep track of the smallest and second smallest numbers in the array.
Iterate through the array and update the variables accordingly.
Initialize the variables with the maximum possible integer value to start with.
Example: array = [5, 2, 8, 1, 3], smallest = 1, secondSmallest = 2.
posted on 17 Dec 2024
posted on 12 Oct 2023
I applied via Campus Placement and was interviewed in Sep 2023. There were 7 interview rounds.
Techinal - 30mins,Aptitude - 15mins
4 coding question in two different language
posted on 31 May 2022
I was interviewed in Apr 2022.
Round duration - 90 minutes
Round difficulty - Medium
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
The height of a binary tree is the maximum number of edges from the root to a leaf node.
Traverse the tree recursively and keep track of the maximum height
If the current node is null, return 0
Otherwise, calculate the height of the left and right subtrees and return the maximum height plus 1
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to calculate the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped on each bar by subtracting its height from the minimum of the maximum heights on both sides.
Sum up the trapped water for all bars and return the total amount.
Round duration - 45 minutes
Round difficulty - Medium
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
The task is to merge two sorted arrays into one sorted array.
Create a new array with size M + N to store the merged array
Use two pointers to iterate through the elements of ARR1 and ARR2
Compare the elements at the current pointers and add the smaller element to the new array
Move the pointer of the array from which the element was added
Repeat the process until all elements are merged
If there are remaining elements in AR...
Tip 1 : Just focus on Data structures mostly arrays, string and dp and practice at least 350 Questions
Tip 2 : Prepare topics related to web tech like HTML, CSS, Node Js
Tip 3 : Prepare Java, OOPS and if required then spring framework and jsp, servlets and do atleast 2 good projects
Tip 1 : Everything should be clear and right what you have written on your resume.
Tip 2 : Have some projects on your resume and that projects should be done by you only and you should have proper knowledge of the tech and flow you have used in that projects.
posted on 21 Apr 2022
I applied via Referral and was interviewed in Mar 2022. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Feb 2022. There was 1 interview round.
based on 1 interview
Interview experience
Software Developer
2.1k
salaries
| ₹2.5 L/yr - ₹12.7 L/yr |
Senior Software Engineer
1.7k
salaries
| ₹6.6 L/yr - ₹27 L/yr |
Software Engineer
1.3k
salaries
| ₹3.7 L/yr - ₹15.2 L/yr |
System Analyst
1.1k
salaries
| ₹6.3 L/yr - ₹21 L/yr |
Validation Engineer
939
salaries
| ₹2 L/yr - ₹7 L/yr |
TCS
Infosys
Wipro
HCLTech