i
AstroTalk
Filter interviews by
I applied via LinkedIn and was interviewed before Jul 2022. There were 4 interview rounds.
Backend spring boot app assignment for hospital management
Array and string based medium complexity questions
Top trending discussions
A set is implemented as a data structure that stores unique elements with no specific order.
A set does not allow duplicate elements.
Sets are commonly implemented using hash tables or binary search trees.
Examples of set implementations include HashSet in Java and std::set in C++.
Unordered set is typically implemented using hash tables.
Uses hash tables to store elements with unique keys
Provides constant time complexity for insertion, deletion, and lookup operations
Does not maintain any specific order of elements
I applied via Referral and was interviewed in Apr 2024. There were 3 interview rounds.
Easy level Basics were asked
Stacks queue leetcode easy level
Used skills include Java, SQL, Spring Boot, RESTful APIs, and Git.
Java programming for backend development
SQL for database management
Spring Boot for creating web applications
RESTful APIs for communication between systems
Git for version control
I was interviewed before Jun 2016.
I have the ability to handle pressure effectively.
I remain calm and focused in high-pressure situations.
I prioritize tasks and manage my time efficiently.
I seek support and guidance from team members when needed.
I maintain a positive attitude and adapt to changing circumstances.
I have successfully completed projects under tight deadlines.
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.
I applied via Cutshort
Medium DSA questions
I applied via Referral and was interviewed in Apr 2024. There were 5 interview rounds.
2 dsa questions of easy/medium
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
Use two pointers, one to traverse the list and another to keep track of the nth node from the end.
Move the second pointer n steps ahead of the first pointer.
When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.
Adjust the pointers to delete the nth node.
based on 1 review
Rating in categories
Operations Executive
16
salaries
| ₹2 L/yr - ₹3.4 L/yr |
Operations Manager
10
salaries
| ₹3 L/yr - ₹11.7 L/yr |
Astrologer
9
salaries
| ₹3 L/yr - ₹9.1 L/yr |
Software Development Engineer II
7
salaries
| ₹9 L/yr - ₹28 L/yr |
SME
7
salaries
| ₹2.4 L/yr - ₹3.6 L/yr |
Astroved.com
GaneshaSpeaks.com
Astroyogi
Astrosage