In this episode, we are going to rotate your image in O(1) space complexity. Don't believe me ? Hear me out 🍷
There can be two methods considering hashmap and sorting to solve the "Majority Element Problem". But, we love the most optimized way, i.e. the Moore's Voting Algorithm.
Can you determine the nth Fibonacci Number in O(1) space complexity ? Let's do it.