To find the nth root of a number m, we want to find a number x such that x^n = m. The naive approach to solve this is to linearly search for every possible number. Using linear search, we start from 1 and gradually try increasing values, checking if raising them to the power n gets us close to or exactly equals m.

Start a loop from 1 to m for linear search.
For each value in the loop, compute the value raised to power n.
If the result equals m, return that value.
If the result exceeds m, break the loop as the nth root does not exist as an integer.
If no exact match is found, return -1 to indicate failure.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find Nth root of M
    int nthRoot(int n, int m) {
        // Loop from 1 to m
        for (int i = 1; i <= m; i++) {
            // Compute i^n
            long long power = pow(i, n);

            // If equal to m, return i
            if (power == m) return i;

            // If exceeds m, break
            if (power > m) break;
        }

        // If not found, return -1
        return -1;
    }
};

int main() {
    Solution sol;
    int n = 3, m = 27;

    // Find nth root
    cout << "Nth Root: " << sol.nthRoot(n, m) << endl;

    return 0;
}
class Solution {
    // Function to find Nth root of M
    public int nthRoot(int n, int m) {
        // Loop from 1 to m
        for (int i = 1; i <= m; i++) {
            // Compute i^n
            long power = (long) Math.pow(i, n);

            // If equal to m, return i
            if (p