Filter interviews by
I applied via Naukri.com and was interviewed before May 2023. There were 2 interview rounds.
A list of questions ranging from general aptitude, html, css, javascript, and networks. Good basic foundation must help you through.
Logical, Mathematical
It was quite taff and easy based on ur preparation
LinkedList is better for frequent insertions and deletions, ArrayList is better for random access.
LinkedList uses pointers to connect elements, ArrayList uses a dynamic array.
LinkedList is slower for random access but faster for insertions and deletions.
ArrayList is faster for random access but slower for insertions and deletions.
Example: LinkedList is used in undo functionality where elements are frequently added and ...
Using Java 8, reverse an array of strings
Use Arrays.stream() to convert the array to a stream
Use Collections.reverse() to reverse the stream
Use Collectors.toList() to convert the stream back to a list
posted on 24 Oct 2023
Finding reverse of a string
ES6 introduced new features to improve JavaScript syntax and functionality.
Arrow functions for concise syntax
Let and const for block-scoped variables
Template literals for string interpolation
Destructuring for easy object and array manipulation
Default parameters for function arguments
Spread and rest operators for easy array manipulation
Classes for object-oriented programming
Promises for asynchronous programming
Modules f
60 minutes 3 sections of attitude test
5 Questions 3 to Clear for an Technical interview
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before Oct 2022. There was 1 interview round.
Object-oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
Objects are instances of classes, which define the structure and behavior of the objects.
Encapsulation, inheritance, and polymorphism are key principles of OOP.
Example: In a banking system, a 'Customer' class can have attributes like name and account balance, and methods like deposit and withdraw.
General apptitude and techincal mcq's
Data structres , cp and adavnce programming
Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.
Data structures define how data is stored, accessed, and manipulated in a computer program.
Examples include arrays, linked lists, stacks, queues, trees, and graphs.
Choosing the right data structure is crucial for optimizing performance and memory usage in software development.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
Divide the input array into two halves
Recursively sort each half
Merge the sorted halves back together
Software Engineer
39
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Senior Software Engineer
16
salaries
| ₹6 L/yr - ₹10 L/yr |
QA Engineer
15
salaries
| ₹2.5 L/yr - ₹5 L/yr |
Technical Lead
8
salaries
| ₹10 L/yr - ₹14 L/yr |
Programmer
8
salaries
| ₹2.5 L/yr - ₹4 L/yr |
Infosys
TCS
Wipro
HCLTech