Skip to main content

CODILITY: Determine whether given string of parentheses is properly nested.

Task description
A string S consisting of N characters is called properly nested if:
  • S is empty;
  • S has the form "(U)" where U is a properly nested string;
  • S has the form "VW" where V and W are properly nested strings.
For example, string "(()(())())" is properly nested but string "())" isn't.
Write a function:
class Solution { public int solution(String S); }
that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise.
For example, given S = "(()(())())", the function should return 1 and given S = "())", the function should return 0, as explained above.
Assume that:
  • N is an integer within the range [0..1,000,000];
  • string S consists only of the characters "(" and/or ")".
Complexity:
  • expected worst-case time complexity is O(N);
  • expected worst-case space complexity is O(1) (not counting the storage required for input arguments).



class Solution { public int solution(String S) { // write your code in Java SE 8 // write your code in Java SE 8 char[] chrArray=S.toCharArray(); int len=chrArray.length; int closeParan=0; int openParan=0; int retV=0; int pos=0; for(int i=len-1;i>=0;i--){ if(chrArray[i]==')'){ closeParan++; pos=i; }else if(chrArray[i]=='(' && i<pos){ openParan++; } if(closeParan==openParan){ closeParan=openParan=0; } } if(closeParan==openParan) retV=1; return retV; } }

75%                                75 out of 100 points




Analysis summary
The following issues have been detected: wrong answers.
For example, for the input '())(()' the solution returned a wrong answer (got 1 expected 0). 

Comments

  1. // you can also use imports, for example:
    import java.util.*;

    // you can write to stdout for debugging purposes, e.g.
    // System.out.println("this is a debug message");

    class Solution {
    public int solution(String S) {
    // write your code in Java SE 8
    char[] ch=S.toCharArray();
    if(ch.length % 2 ==1 )
    return 0;
    Stack op = new Stack<>();
    for(char c :ch ){
    if(c == '(')
    {
    op.push(c);
    }
    if(c == ')' && !op.isEmpty())
    {
    op.pop();
    }

    }
    return op.isEmpty()?1:0;
    }
    }

    ReplyDelete

Post a Comment

Popular posts from this blog

Java Interface

Problem Statement A Java interface can only contain method signatures and fields. Interface can be used to achieve polymorphism. In this problem you will practice your knowledge on interfaces. You are given an interface   AdvancedArithmetic   which contains a method signature   public abstract int divisorSum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum   function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1,2,3 and 6, so   divisorSum   should return 12. Value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.   Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. import java.util.*; interface AdvancedArithmetic{   public abstract int divisorSum(int n

Problem: Java Exception Handling

Problem Statement Create a class myCalculator which consists of a single method power(int,int). This method takes two integers,   n   and   p , as parameters and finds   n p . If either   n   or   p   is negative, then the method must throw an exception which says "n and p should be non-negative". Please read the partially completed code in the editor and complete it. Your code mustn't be public. No need to worry about constraints, there won't be any overflow if your code is correct. Sample Input 3 5 2 4 -1 -2 -1 3 Sample Output 243 16 java.lang.Exception: n and p should be non-negative java.lang.Exception: n and p should be non-negative import  java.util.*; class myCalculator{     int power(int n,int p) throws java.lang.Exception{         int power=1;         while(p>0){             power=power*(n);             p--;         }                 if(n==0) power=0;                if(n<0 | p<0){       

Google Cloud Shell | Delete instance