TO THE NEW Application Support Engineer Interview Questions and Answers

Hashtable is synchronized while hashmap is not.

• Hashtable is thread-safe while hashmap is not.

• Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.

• Hashtable is slower than hashmap due to synchronization.

• Hashtable is a legacy class while hashmap is a newer implementation.

Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.

• Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.

• Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.

• Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.

• Concurrent Hashmap is slower than Hashma...read more

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...read more

Remove duplicate entries from array of strings using JavaScript

• Use Set to remove duplicates

• Convert Set back to array

• Use spread operator to convert Set to array

Determines if words in given array are anagram or not using JS

• Create a function that takes an array of strings as input

• Loop through the array and sort each string alphabetically

• Compare the sorted strings to check if they are equal

• Return true if all strings are anagrams, else false