Nitin Agrawal
Contact -
  • Home
  • Interviews
    • Secret Receipe
    • InterviewFacts
    • Resume Thoughts
    • Daily Coding Problems
    • BigShyft
    • CompanyInterviews >
      • InvestmentBanks >
        • ECS
        • Bank Of America
        • WesternUnion
        • WellsFargo
      • ProductBasedCompanies >
        • CA Technologies
        • Model N India
        • Verizon Media
        • Oracle & GoJek
        • IVY Computec
        • Nvidia
        • ClearWaterAnalytics
        • ADP
        • ServiceNow
        • Pubmatic
        • Expedia
        • Amphora
        • CDK Global
        • CDK Global
        • Epic
        • Sincro-Pune
        • Whiz.AI
        • ChargePoint
      • ServiceBasedCompanies >
        • Altimetrik
        • ASG World Wide Pvt Ltd
        • Paraxel International & Pramati Technologies Pvt Ltd
        • MitraTech
        • Intelizest Coding Round
        • EPAM
    • Interviews Theory
  • Programming Languages
    • Java Script >
      • Tutorials
      • Code Snippets
    • Reactive Programming >
      • Code Snippets
    • R
    • DataStructures >
      • LeetCode Problems
      • AnagramsSet
    • Core Java >
      • Codility
      • Program Arguments OR VM arguments & Environment variables
      • Java Releases
      • Threading >
        • ThreadsOrder
        • ProducerConsumer
        • Finalizer
        • RaceCondition
        • Executors
        • Future Or CompletableFuture
      • Important Points
      • Immutability
      • Dictionary
      • URL Validator
    • Julia
    • Python >
      • Decorators
      • String Formatting
      • Generators_Threads
      • JustLikeThat
    • Go >
      • Tutorial
      • CodeSnippet
      • Go Routine_Channel
      • Suggestions
    • Methodologies & Design Patterns >
      • Design Principles
      • Design Patterns >
        • TemplatePattern
        • Adapter Design Pattern
        • Decorator
        • Proxy
        • Lazy Initialization
        • CombinatorPattern
        • RequestChaining
        • Singleton >
          • Singletons
  • Frameworks
    • Apache Velocity
    • Spring >
      • Spring Boot >
        • CustomProperties
        • ExceptionHandling
        • Issues
      • Quick View
    • Rest WebServices >
      • Interviews
      • Swagger
    • Cloudera BigData >
      • Ques_Ans
      • Hive
      • Apache Spark >
        • ApacheSpark Installation
        • SparkCode
        • Sample1
        • DataFrames
        • RDDs
        • SparkStreaming
        • SparkFiles
    • Integration >
      • Apache Camel
    • Testing Frameworks >
      • JUnit >
        • JUnit Runners
      • EasyMock
      • Mockito >
        • Page 2
      • TestNG
    • Blockchain >
      • Ethereum Smart Contract
      • Blockchain Java Example
    • Microservices >
      • Messaging Formats
      • Design Patterns
    • AWS >
      • Honeycode
    • Dockers >
      • GitBash
      • Issues
  • Databases
    • MySql
    • Oracle >
      • Interview1
      • SQL Queries
    • Elastic Search
  • Random issues
    • TOAD issue
    • Architect's suggestions
  • Your Views

Pattern Length

Below code will find the maximum length of valid pattern i.e. pattern in which all the open brackets are closed

import java.util.Stack;

/**
 * Below code will find the maximum length of valid pattern i.e. pattern in which all the open brackets are closed
 * @author Nitin Agrawal
 *
 */
public class MaxSeries {

 public static void main(String[] args) {
  //  String str = "(([]))(())"; // 10
  //    String str = "]{[]}[]"; // 6
  //    String str = "]{{{{}}}}[]"; // 10
  String str = "{[[)[{((()))}][[[[[[[[]]]]]]]]"; // 26
  Stack<Character> stk = new Stack<>();

  int max = 0;
  int len = 0;

  for(char ch : str.toCharArray()) {
   if(ch == '(' || ch == '{' || ch == '[') {
    if(max < len) {
     max = len;
     len = 0;
    }
    stk.push(ch);
   }
   else if (ch == ')' || ch == '}' || ch == ']') {
    if(!stk.isEmpty()) {
     char ch1 = stk.pop();
     if(ch == ')' && ch1 == '(')
      len = len + 2;
     else if(ch == ']' && ch1 == '[')
      len = len + 2;
     else if(ch == '}' && ch1 == '{')
      len = len + 2;
     else {
      if(max > len) {
       max = len;
      }
      len = 0;
      stk.clear();
     }
    }
   }
  }
  if(stk.isEmpty())
   System.out.println(max+len);
  else
   System.out.println(max > len ? max : len);
 }
}
Powered by Create your own unique website with customizable templates.