Brillio Associate Engineer Interview Questions and Answers

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

Angular is a popular front-end framework for building web applications.

• Angular is developed and maintained by Google.

• It uses TypeScript for building scalable and maintainable applications.

• Angular has a powerful CLI for generating components, services, and more.

• It has a large and active community with many third-party libraries and plugins available.

• Angular has a modular architecture that allows for easy code reuse and