Bounteous x Accolite Senior Software Engineer Interview Questions, Process, and Tips

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

Singleton design pattern restricts the instantiation of a class to one object.

• Ensures only one instance of a class exists

• Provides a global point of access to that instance

• Used when only one instance of a class is needed throughout the application

• Example: Database connection manager