i
Aspire Systems
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Technology related question
Build a architecture diagram HLD & LLD for rate limiter
HLD for batch scheduling miroservice level
Algo check to correct the directory pattern
Top trending discussions
I applied via Referral and was interviewed before Jan 2021. There were 3 interview rounds.
OOPs concepts are used in real life to model objects and their behavior.
Encapsulation: A car's engine is encapsulated and can only be accessed through specific methods.
Inheritance: A sports car is a type of car that inherits properties and methods from the car class.
Polymorphism: A person can be a student, teacher, or employee, each with their own unique behavior.
Abstraction: A TV remote has buttons that abstract the c...
Hashmap is a data structure that stores key-value pairs and uses hashing to locate values based on their keys.
Hashmap uses an array of linked lists to store key-value pairs.
The hash function is used to convert the key into an index of the array.
If two keys have the same hash value, they are stored in the same linked list.
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values.
Java's H...
I appeared for an interview in Jun 2024.
posted on 8 Jan 2025
I applied via Approached by Company and was interviewed before Oct 2022. There were 4 interview rounds.
I applied via Company Website and was interviewed before Mar 2022. There were 3 interview rounds.
My expertise lies in Java and related technologies.
Proficient in Java programming language and its frameworks like Spring and Hibernate
Experience in developing web applications using HTML, CSS, JavaScript, and AngularJS
Familiarity with database technologies like MySQL and Oracle
Knowledge of software development methodologies like Agile and Scrum
Experience in leading and mentoring a team of developers
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Nodes contain data and a reference to the next node
Can be singly linked (each node points to the next) or doubly linked (each node points to the next and previous)
Example: Node 1 -> Node 2 -> Node 3
To find the middle node of a linked list, use the slow and fast pointer technique.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.
The node pointed to by the slow pointer at this point will be the middle node.
Addressing conflict between manager and developer requires open communication, understanding both perspectives, and finding a mutually beneficial solution.
Encourage open communication between the manager and developer to understand each other's perspectives and concerns.
Facilitate a meeting to discuss the conflict and find common ground or compromises.
Seek to understand the underlying reasons for the conflict and addre...
Coding and concepts of data science
I applied via Recruitment Consulltant and was interviewed in Nov 2024. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Senior Engineer
673
salaries
| ₹4.8 L/yr - ₹15 L/yr |
Senior Software Engineer
656
salaries
| ₹4.5 L/yr - ₹16 L/yr |
Software Engineer
505
salaries
| ₹3.2 L/yr - ₹11 L/yr |
Module Lead
372
salaries
| ₹8 L/yr - ₹21 L/yr |
Softwaretest Engineer
300
salaries
| ₹3 L/yr - ₹9 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software