what will be the time complexity of this code ?

Can someone please help me understand the time complexity of below code?

public String method(String s) {
        
        int left=0;
        int right=N; //length of S-1;
        
        while(l<r){
            
            while(condition)
                l++;
            
            while(condition)
                r--;
            
            l++;
            r--;
            
        }
        
    }
Comments (1)