Permuting Two Arrays

Sort by

recency

|

273 Discussions

|

  • + 0 comments
    public static string twoArrays(int k, List<int> A, List<int> B)
        {
            int[] a_arr = A.Order().ToArray();
            int[] b_arr = B.OrderDescending().ToArray();
            
            for(int i = 0; i < a_arr.Length; i++){
                if(a_arr[i] + b_arr[i] < k) return "NO";
            }
            
            return "YES";
    
        }
    
  • + 0 comments

    Python

    def twoArrays(k, A, B):
        A.sort()
        B.sort()
        
        for i in range(0,len(A)):
            if A[i]+B[len(A)-i-1] < k:
                return "NO"
                
        return "YES"
    
  • + 0 comments

    def twoArrays(k, A, B): # Write your code here return "YES" if all(a+b>=k for a,b in zip(sorted(A),sorted(B,reverse=True))) else "NO"

  • + 0 comments

    My Python solution

    def twoArrays(k, A, B):
        # Write your code here    
        A.sort()
        B.sort(reverse=True)    
        for a,b in zip(A,B):
            if a+b <k:
                return "NO"
        
        return "YES"
    
  • + 0 comments

    My C++ Solution

    string twoArrays(int k, vector<int> A, vector<int> B) {
        sort(A.begin(),A.end());
        sort(B.begin(),B.end(), greater<int>());
        for(int i=0;i<A.size();i++){
            if(A[i]+B[i]<k){
                return "NO";
            }
        }
            return "YES";
    }