Skip to main content

Java Loops | HackerRank solutions -codewithyasar

  Objective In this challenge, we're going to use loops to help us do some simple math. Task Given an integer,  , print its first   multiples. Each multiple   (where  ) should be printed on a new line in the form:  N x i = result . Input Format A single integer,  . Constraints Output Format Print   lines of output; each line   (where  ) contains the   of   in the form: N x i = result . Sample Input 2 Sample Output 2 x 1 = 2 2 x 2 = 4 2 x 3 = 6 2 x 4 = 8 2 x 5 = 10 2 x 6 = 12 2 x 7 = 14 2 x 8 = 16 2 x 9 = 18 2 x 10 = 20 Explanation:           Here, we just need to use for loops to achieve the result Solution : import java.io.* ; import java.math.* ; import java.security.* ; import java.text.* ; import java.util.* ; import java.util.concurrent.* ; import java.util.regex.* ; public class Solution { public static void main ( String [] args ) t...
Post a Comment

Balanced Paranthesis

 Problem Statement:

      Program to check for balanced parentheses in an expression using stack.
      Given an expression as string comprising of opening and closing characters
      of parentheses - (), curly braces - {} and square brackets - [], we need to 
      check whether symbols are balanced or not. 


Approach:

        Using Stack, We are going to solve this Problem

 
Solution:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//Java program for Balanced Paranthesis
import java.util.*;
import java.io.*;
public class MyClass {
    public static void printStack(Stack<Character> s)
    {
        if(s.empty())
        {
            return;
        }
        
        Character x=s.peek();
        System.out.println(x);
        s.pop();
        printStack(s);
    }
    public static boolean arePair(char opening,char closing)
    {
        if(opening=='(' && closing==')')
            return true;
        else if(opening=='[' && closing==']')
           return true;
        else if(opening=='{' && closing=='}')
            return true;
        return false;
    }
    public static void main(String args[]) 
    {
     String input="[(])";
     Stack<Character> stack = new Stack<Character>();
     for(int i=0; i<input.length();i++) 
     {
        //  System.out.println(input.charAt(i));
        
        if(input.charAt(i)=='(' | input.charAt(i)=='{' | input.charAt(i)=='[')
        {
            stack.push(input.charAt(i));
        }
        else if(input.charAt(i)==')' | input.charAt(i)=='}' | input.charAt(i)==']')  
        {
            if(stack.empty() |  !arePair(stack.peek(),input.charAt(i))) 
            {
                System.out.println("Cannot balanced unpaired Pair Found!!");
                return;
            }
            else 
                stack.pop();
        }
     }
        if(stack.empty()) {
         System.out.println("Balanced Paranthesis");
         } else {
             System.out.println("UnBalanced");
         }
    }
     
    //  printStack(stack);
    
    
}
Feel free to Bookmark this site.Happy Coding
Labels:

Comments

Post a Comment

Highlights