Persistent Systems Software Developer Interview Questions, Process, and Tips

Basic questions on java core,collections,spring

Q1. Reverse a number in a given string
Ans. 
Reverse a number in a given string
• Iterate through the string and identify numbers

• Reverse the identified numbers

• Join the reversed numbers back to the original string
Answered by AI
Add your answer
Q2. Merge sort algorithm working
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges the sorted halves.
• Divide the input array into two halves

• Recursively sort the two halves

• Merge the sorted halves back together
Answered by AI
Add your answer
Q3. Hashmap working internal details
Ans. 
Hashmap is a data structure that stores key-value pairs and uses hashing to map keys to values.
• Hashmap uses hashing function to determine the index of the key in the underlying array.

• Collision handling is done by chaining or open addressing.

• Hashmap provides constant time complexity O(1) for insertion, deletion, and retrieval.

• Example: HashMap map = new HashMap<>(); map.put("key", 123); int value = map.g
Answered by AI
Add your answer

Average questions , not too easy not too difficult

Q1. 3 coding questions on data structures 1 sql query Project
Add your answer