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
I applied via Naukri.com and was interviewed in Jun 2019. There were 3 interview rounds.
I am a motivated and enthusiastic individual with a strong passion for learning and gaining practical experience in the field of [field].
I am currently pursuing a degree in [field] at [university].
I have completed internships at [company] and [company], where I gained valuable skills in [specific skills].
I am proficient in [programming languages/tools] and have experience in [relevant experience].
I am a quick learner a...
I plan to gain valuable experience and skills through this internship and use it as a stepping stone for my future career.
I plan to learn as much as possible during this internship and apply the knowledge in my future endeavors.
I aim to develop strong professional relationships and network with industry experts.
I intend to explore different areas within the company to gain a well-rounded understanding of the business.
I...
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
I appeared for an interview before May 2016.
I appeared for an interview in Jul 2017.
I appeared for an interview in Jul 2017.
Yes, I am a fresher with no past working experience.
I am a recent graduate looking to gain experience in the field.
I have completed internships or projects during my studies.
I am eager to learn and grow in a professional environment.
I was responsible for conducting market research, creating social media content, and assisting with event planning.
Conducted market research to identify trends and opportunities
Created engaging social media content to increase brand awareness
Assisted in planning and executing events to promote company products/services
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Recent graduate with a degree in Computer Science
Passionate about coding and problem-solving
Strong communication and teamwork skills
Experience with programming languages such as Java, Python, and C++
I applied via Approached by Company and was interviewed in Jul 2017. There were 5 interview rounds.
I applied via Other and was interviewed in Jan 2018. There were 5 interview rounds.
I applied via Other and was interviewed in Jan 2018. There were 5 interview rounds.
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