Java Starter Code:

import java.util.Scanner;

public class ParenthesesChecker { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // Read the input string String input = sc.nextLine(); // Print whether the string has balanced parentheses System.out.println(hasBalancedParentheses(input)); } private static boolean hasBalancedParentheses(String input) { throw new UnsupportedOperationException(); } }

Code in Java, post full thing with starter code included (will rate if correct)

Suppose you are given a string containing only the characters ( and ). In this problem, you will write a function to determine whether the string has balanced paren space beyond the input; any algorithms that use space not in O(1) will receive half credit at most. Any solutions that hardcode true or false or otherwise try to game the distribution of test cases will receive zero credit. Balanced parentheses means that every open parenthesis has exactly one close parenthesis corresponding to it and vice versa, and that for each pair the opening parenthesis precedes the closed parenthesis. The follow- ing strings have balanced parentheses C) CO O) The following strings do not have balanced parentheses: We consider the empty string to have balanced parentheses, as there is no imbalance. Your program should accept as input a single string containing only the characters ) and (, and output a single line stating true or false. The functionality for reading and printing answers is written in the class ParenthesesChecker; your task is to complete the hasBalancedParentheses ) method