i
Apexon
Filter interviews by
Hashmap is a data structure that stores key-value pairs and provides fast access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values.
Example: HashMap<S...
To find the 3rd highest salary in SQL, we can use the 'LIMIT' and 'OFFSET' keywords.
Use 'ORDER BY' to sort the salaries in descending order
Use 'LIMIT 1 OFFSET 2' to select the 3rd highest salary
Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 1 OFFSET 2
Top trending discussions
I applied via Recruitment Consultant and was interviewed in May 2021. There was 1 interview round.
I applied via Company Website and was interviewed before Jan 2022. There were 2 interview rounds.
My goal is to become a highly skilled software engineer and contribute to innovative projects. My family background is supportive and has encouraged my pursuit of a career in technology.
Goal: Become a highly skilled software engineer
Contribute to innovative projects
Family background: Supportive and encouraging
Pursuit of a career in technology
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
They will ask you simple programs to check your logical abilities.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
I applied via Naukri.com and was interviewed before Apr 2021. There was 1 interview round.
I applied via LinkedIn and was interviewed before Jun 2021. There were 5 interview rounds.
Its a simple hackathon MCQ questions based on your skills.
based on 3 reviews
Rating in categories
Senior Software Engineer
789
salaries
| ₹7 L/yr - ₹26 L/yr |
Software Engineer
570
salaries
| ₹4 L/yr - ₹14.5 L/yr |
Softwaretest Engineer
260
salaries
| ₹2.8 L/yr - ₹9.9 L/yr |
Senior Engineer
248
salaries
| ₹7 L/yr - ₹28 L/yr |
Technical Lead
190
salaries
| ₹10.2 L/yr - ₹35 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies