Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank of Programming Language Java . At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Java Stack-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Introduction To Java
JAVA was developed by James Gosling at Sun Microsystems Inc in the year 1991, later acquired by Oracle Corporation. It is a simple programming language. Java makes writing, compiling, and debugging programming easy. It helps to create reusable code and modular programs.
Java is a class-based, object-oriented programming language and is designed to have as few implementation dependencies as possible. A general-purpose programming language made for developers to write once run anywhere that is compiled Java code can run on all platforms that support Java. Java applications are compiled to byte code that can run on any Java Virtual Machine. The syntax of Java is similar to c/c++.
Link for the Problem – Java Stack – Hacker Rank Solution
Java Stack – Hacker Rank Solution
Problem :
In computer science, a stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added.(Wikipedia)
A string containing only parentheses is balanced if the following is true: 1. if it is an empty string 2. if A and B are correct, AB is correct, 3. if A is correct, (A) and {A} and [A] are also correct.
Examples of some correctly balanced strings are: “{}()”, “[{()}]”, “({()})”
Examples of some unbalanced strings are: “{}(“, “({)}”, “[[“, “}{” etc.
Given a string, determine if it is balanced or not.
Input Format
There will be multiple lines in the input file, each having a single non-empty string. You should read input till end-of-file.
The part of the code that handles input operation is already provided in the editor.
Output Format
For each case, print ‘true’ if the string is balanced, ‘false’ otherwise.
Sample Input
{}() ({()}) {}( []
Sample Output
true true false true
Java Stack – Hacker Rank Solution
import java.util.Scanner; import java.util.Stack; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { System.out.println(isBalanced(in.next())); } in.close(); } static boolean isBalanced(String parentheses) { Stack<Character> stack = new Stack<Character>(); for (int i = 0; i < parentheses.length(); i++) { char ch = parentheses.charAt(i); if (ch == '(' || ch == '[' || ch == '{') { stack.push(ch); } else if (stack.empty()) { return false; } else { char top = stack.pop(); if ((top == '(' && ch != ')') || (top == '[' && ch != ']') || (top == '{' && ch != '}')) { return false; } } } return stack.empty(); } }