We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Stacks
  4. Game of Two Stacks
  5. Discussions

Game of Two Stacks

Sort by

recency

|

410 Discussions

|

  • sumanth2303
     + 0 comments

    guys this is not a Greedy question where we can pick min of both the stacks. that doesn't work. We need to try all the possibilities. Recursion & Backtracking

  • mohananand5844
     + 1 comment

    Only 2 test cases (0,4)are passing all other are failing , can't think where is it going wrong public static int solve(Stack f,Stack s,int len , int cs,int max){ int n = f.peek()>=s.peek()?s.peek():f.peek(); // System.out.println(f.peek()); // System.out.println(s.peek()); // System.out.println("n:"+n); if(cs+n a, List b) { // Write your code here Stack first = new Stack<>(); for(int i =a.size()-1;i>=0;i--){ first.push(a.get(i)); } // System.out.println;

    Stack<Integer> Second = new Stack<>();
for(int i =b.size()-1;i>=0;i--){
    Second.push(b.get(i));
}
int len = 0;
int currsumm = 0;
return solve(first,Second,len,currsumm,maxSum);

}

    }

    • vkprajapati072
       + 0 comments

      same

  • CS_2212256_T
     + 0 comments
    import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int g = sc.nextInt();
        for (int tc = 0; tc < g; tc++) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int x = sc.nextInt();
            int[] a = readArray(sc, n);
            int[] b = readArray(sc, m);

            System.out.println(solve(a, b, x));
        }

        sc.close();
    }

    static int[] readArray(Scanner sc, int size) {
        int[] result = new int[size];
        for (int i = 0; i < result.length; i++) {
            result[i] = sc.nextInt();
        }
        return result;
    }

    static int solve(int[] a, int[] b, int x) {
        int lengthB = 0;
        int sum = 0;
        while (lengthB < b.length && sum + b[lengthB] <= x) {
            sum += b[lengthB];
            lengthB++;
        }

        int maxScore = lengthB;
        for (int lengthA = 1; lengthA <= a.length; lengthA++) {
            sum += a[lengthA - 1];

            while (sum > x && lengthB > 0) {
                lengthB--;
                sum -= b[lengthB];
            }

            if (sum > x) {
                break;
            }

            maxScore = Math.max(maxScore, lengthA + lengthB);
        }
        return maxScore;
    }
}

  • ds1b_1641540100
     + 1 comment
    def twoStacks(maxSum, a, b):
    # Write your code here
    i = j = s = 0
    
    while i < len(a) and s + a[i] <= maxSum: 
        s += a[i]
        i += 1
        
    n = maxn = i
    i -= 1
    
    while j < len(b):
        if s + b[j] <= maxSum:
            s += b[j]
            j += 1
            n += 1
            maxn = max(maxn, n)
        elif i >= 0:
               s -= a[i]
               i -= 1
               n -= 1
        else:
            break
    
    return maxn

    • christopherjame6
       + 1 comment

      Could you explain the code please? I got up to here but I dont take into account g games so not sure what Im missing as I pass the first test case but fail others.

      def twoStacks(maxSum, a, b): score = 0 counter = 0

      while score < maxSum:
    head_a = a[0]
    head_b = b[0]
    if head_a > head_b and (score + head_b < maxSum):
        score += head_b
        b.pop(0)
    elif head_b > head_a and (score + head_a < maxSum):
        score += head_a
        a.pop(0)
    else:
        break
    counter += 1
return counter

      • kuro_ece
         + 1 comment

        selectig the smallest top of stack from a, and b doesn't always guarantee the maxmum number of selections. I know this seems counter-intuitive but consider the following example: maxSum = 10 a = [5, 6] b = [6, 4]

        The correct answer is 2 selections (b[0] + b[1] = 6 + 4 = 10). But you code will produce only 1 selection (a[0] = 5).

        • harikrishnagupt1
           + 0 comments

          Nice one

  • yashdeora98294
     + 1 comment

    I found the solution on programmingoneonone

    • poonamdeorasurp1
       + 0 comments

      Here is another solution - https://programmingoneonone.com/hackerrank-game-of-two-stacks-problem-solution.html

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in