I have been practicing some problems on Leetcode and noted that there are multiple solutions listed for same problem. For eg. consider the Majority element problem: https://leetcode.com/problems/majority-element/
I could solve it in O(n) complexity using hashmap data structure. But there is also a Divide and Rule approach using recursion that has complexity of O(NlogN). Now why would you want to explain this solution to your interviewer when you already solved it using simple approach with O(N)?
I want to understand the reason behind it? Would it really help me?