Permuting Two Arrays

Sort by

recency

|

270 Discussions

|

  • + 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";
    }
    
  • + 0 comments
    In Java:
    
        public static String twoArrays(int k, List<Integer> A, List<Integer> B) {
    
        // Ordering A in ascending order
       A.sort((a, b) -> Integer.compare(a, b));
       // Ordering B in descending order
       B.sort((a, b) -> Integer.compare(b, a));
    
       for(int i=0;i<A.size();i++){
        if(A.get(i) + B.get(i) < k){
        return "NO";
        }
    
       }
    

    return "YES";

    }
    
  • + 1 comment

    Koi samjhay ga ke is problem ka kia mtlb hai?

    • + 0 comments

      It's about the "greedy choice"

  • + 0 comments

    Kotlin Solution

    fun twoArrays(k: Int, A: Array<Int>, B: Array<Int>): String {
        A.sort()
        B.sortDescending()
        for(i in A.indices){
            if(A[i]+ B[i] < k){
                return "NO"
            }
        }
        return "YES"
    }