Скачать или смотреть Leetcode - Valid Parentheses Kotlin

Join the Coffee Bytez Patreon for exclusive content:
  / coffeebytez  

Substack:
https://coffeebytez.substack.com/

Medium:
  / coffeebytez  

Discord:
  / discord  
The approach I took for this problem was to make a HashMap of closing “parentheses” characters as the keys and their open counterparts as the values. I will make a character array from the string, to loop through each character. I will use a stack to hold the opening “parenthesis”.
Check if there is a closing character.
If it is not a closing character, add it to the Stack (It is an opening character).
If there is a closing character and the Stack is empty, return false.
If there is a closing character and the stack is not empty, use it as a key to the HashMap to get the matching opening character. Pop from the stack and compare it with the value you got from the HashMap. If they are not equal, return false.
After looping through the array, we can handle the two edge cases by checking the size of the Stack. If it is not empty return false.
Finally, return true if the string of parentheses is valid.
The last step handles a string only having opening parenthesis because we will only add to the stack if there are opening characters and only pop if there are closing characters. This also handles the edge case of having only 1 character (in the loop).