{"id":1866,"date":"2020-07-01T09:37:32","date_gmt":"2020-07-01T09:37:32","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=1866"},"modified":"2022-03-21T07:23:09","modified_gmt":"2022-03-21T07:23:09","slug":"compile-code","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/compile-code\/","title":{"rendered":"Compile Code"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used:<\/h3>\n
\n

Stacks.<\/p>\n<\/blockquote>\n

Difficulty Level:<\/h3>\n
\n

Medium.<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

Given a string of open angular bracket \u2018<\u2018 and closed bracket \u2018>\u2019. The task is to find the length of longest balanced prefix.
\nExample: <<><< , >><< will give compilation error, while <>,
\n<><><>, <<<>>> will not.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

Example:<\/h4>\n
Input:\n4\n<<>>\n2\n><\n4\n<>>>\n\nOutput:\n4\n0\n2\n\nExplanation:\nCase-1:\nThe whole string is error-free. So, the longest prefix is the string itself.\n\nCase-2:\nThere is no prefix which is error-free.\n\nCase-3:\n<> longest prefix is valid. So, 2 is answer.<\/code><\/pre>\n
\n
Solving Approach:<\/h3>\n
\n
    \n
  1. Every time we encounter a ‘<‘, we push it onto the stack and increment<\/a> open counter. according to fundamentals of data structures in c++.<\/li>\n
  2. For every ‘>’ encountered, we pop a ‘<‘ from the stack and increment close counter. <\/li>\n
  3. If ‘<‘ isn’t available on the stack for popping at anytime or if stack contains some elements after processing complete substring, the substring of parentheses is invalid,hence we exit.<\/li>\n<\/ol>\n<\/blockquote>\n
    Solutions:<\/h3>\n\t\t\t\t\t\t