Filter interviews by
Binary Search Tree is a data structure where each node has at most two children, with left child smaller and right child larger. Time complexity is O(log n) for search, insert, and delete operations.
Nodes have at most two children - left child is smaller, right child is larger
Search, insert, and delete operations have time complexity of O(log n)
Example: In a BST, if we search for a value, we can eliminate half of ...
HashMap is a data structure in Java that stores key-value pairs.
HashMap is part of the Java Collections framework.
Keys in a HashMap must be unique.
Values in a HashMap can be duplicated.
Example: HashMap<String, Integer> map = new HashMap<>();
Example: map.put("John", 25);
Implementation of a linked list in code format
Define a Node class with data and next pointer
Create LinkedList class with methods like insert, delete, search
Handle edge cases like empty list, inserting at beginning/end
Interface defines only method signatures while abstract class can have method implementations.
Interface cannot have method implementations, only method signatures
Abstract class can have method implementations along with abstract methods
A class can implement multiple interfaces but can only inherit from one abstract class
Interfaces are used to achieve multiple inheritance in Java
Abstract classes can have constructo...
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: a superclass Animal with subclasses Dog and Cat. Both Dog and Cat can be treated as Animals.
Quick sort and Merge sort are popular sorting algorithms used to efficiently sort arrays of elements.
Quick sort: Divide and conquer algorithm, picks a pivot element and partitions the array around the pivot. Recursively sorts subarrays.
Merge sort: Divide and conquer algorithm, divides the array into two halves, recursively sorts the halves, and then merges them back together.
Example: Quick sort - [3, 6, 8, 10, 1, ...
Array is a fixed-size data structure while linked list is a dynamic data structure. ArrayList and LinkedList are implementations of List interface in Java.
Array is a contiguous block of memory with fixed size, while linked list is a collection of nodes where each node points to the next node.
ArrayList in Java is implemented using an array, which can dynamically resize itself. LinkedList is implemented using nodes ...
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Simple apptitude , java , dotnet ,c++ 100 MCQ questions for 60 min .
Quick sort and Merge sort are popular sorting algorithms used to efficiently sort arrays of elements.
Quick sort: Divide and conquer algorithm, picks a pivot element and partitions the array around the pivot. Recursively sorts subarrays.
Merge sort: Divide and conquer algorithm, divides the array into two halves, recursively sorts the halves, and then merges them back together.
Example: Quick sort - [3, 6, 8, 10, 1, 2, 1]...
Binary Search Tree is a data structure where each node has at most two children, with left child smaller and right child larger. Time complexity is O(log n) for search, insert, and delete operations.
Nodes have at most two children - left child is smaller, right child is larger
Search, insert, and delete operations have time complexity of O(log n)
Example: In a BST, if we search for a value, we can eliminate half of the r...
HashMap is a data structure in Java that stores key-value pairs.
HashMap is part of the Java Collections framework.
Keys in a HashMap must be unique.
Values in a HashMap can be duplicated.
Example: HashMap<String, Integer> map = new HashMap<>();
Example: map.put("John", 25);
Implementation of a linked list in code format
Define a Node class with data and next pointer
Create LinkedList class with methods like insert, delete, search
Handle edge cases like empty list, inserting at beginning/end
Interface defines only method signatures while abstract class can have method implementations.
Interface cannot have method implementations, only method signatures
Abstract class can have method implementations along with abstract methods
A class can implement multiple interfaces but can only inherit from one abstract class
Interfaces are used to achieve multiple inheritance in Java
Abstract classes can have constructors wh...
Array is a fixed-size data structure while linked list is a dynamic data structure. ArrayList and LinkedList are implementations of List interface in Java.
Array is a contiguous block of memory with fixed size, while linked list is a collection of nodes where each node points to the next node.
ArrayList in Java is implemented using an array, which can dynamically resize itself. LinkedList is implemented using nodes with ...
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: a superclass Animal with subclasses Dog and Cat. Both Dog and Cat can be treated as Animals.
Top trending discussions
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
Certifications are not mandatory for software developers, but can add value to their resume.
Certifications in programming languages like Java, Python, C++
Certifications in software development methodologies like Agile, Scrum
Certifications in cloud computing platforms like AWS, Azure
Certifications in security like CISSP, CEH
Certifications in project management like PMP
Certifications in mobile app development like Androi...
I applied via Campus Placement and was interviewed in Jul 2021. There was 1 interview round.
Polymorphism is the ability of an object to take on many forms.
Polymorphism allows objects to be treated as if they are of multiple types.
It enables code to be written that can work with objects of different classes in a uniform way.
Polymorphism can be achieved through method overloading or method overriding.
Example: A shape class can have multiple subclasses like circle, square, triangle, etc. and all can be treated a...
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows for code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class, and can also add new properties and method...
I applied via Naukri.com and was interviewed in Jun 2021. There were 2 interview rounds.
I appeared for an interview in Dec 2024.
Core Java, Spring boot, Hibernate, MySQL
posted on 26 Mar 2025
I appeared for an interview in Sep 2024, where I was asked the following questions.
I expect a collaborative environment, opportunities for growth, and clear communication to enhance productivity and job satisfaction.
Collaboration: I thrive in teams where ideas are shared openly, like during code reviews or brainstorming sessions.
Growth Opportunities: I appreciate companies that invest in employee development, such as offering training programs or workshops.
Clear Communication: Regular updates and fee...
I appeared for an interview in May 2025, where I was asked the following questions.
Some of the top questions asked at the LinguaSol Junior Software Developer interview for freshers -
based on 1 interview experience
Difficulty level
Duration
QA Engineer
7
salaries
| ₹2 L/yr - ₹11 L/yr |
Software Engineer
6
salaries
| ₹2.3 L/yr - ₹6.7 L/yr |
Software Engineer Trainee
4
salaries
| ₹1.9 L/yr - ₹3 L/yr |
Senior Software Engineer
4
salaries
| ₹9 L/yr - ₹12 L/yr |
Software Developer
3
salaries
| ₹3 L/yr - ₹14.7 L/yr |
Cogoport
Treebo Hotels
Arzooo.com
KrazyBee