FIND-MINIMUM-IN-ROTATED-SORTED-ARRAY-II leetcode Solution - Correct, Optimal and Working

class Solution {
public:
    int findMin(vector<int> &num) {
        
        int m = num[0];
        for( int i = 1; i < num.size() ; i++ ) {
            m = min(m,num[i]);
        }
        return m;
        
    }
};

470+ Solutions to various Programming Questions

Subscribe to my weekley newsletter