SDE - 1

Step 1: I first applied a brute force approach in which every time rotating the second string by one place and compared it with the first string but It was not good enough,
Step 2: I applied an optimized approach.

Step 1: I applied the brute force approach for each element of the array, I counted total occurrence by comparing it with all numbers in the array if it's greater than N/2 then that will be the majority element, This will lack in time complexity
Step 2: I optimized my approach by using the hash approach.

Tip 1: Have good knowledge of the basics of DBMS

Step 1: I explain the naive approach to checking the prime number (only 1 or the number itself can divide)
Step 2: I used the Sieve of Eratosthenes algorithm to find the total price factor of this number, if it has only one prime number then it will be a prime number.

Step 1: Take the largest possible currency