| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Name | Name | Last commit date | ||
|---|---|---|---|---|
Quick start guide list:
API check list
http://localhost:3000/userlist
http://localhost:3000/auth/register
http://localhost:3000/auth/login
http://localhost:3000/getUserDetails
http://localhost:3000/updateUser
http://localhost:3000/deleteUser
http://localhost:3000/balanced
Store opening anf closing braces into two separeted array
Read the string from left to right
Read character from closingBraces array from current character index if exist then
if stack is empty then return false its means the string is not balanced
if stack is not empty then pop one element's from stack and check it on openingBraces array with closingBaces index if the pop-ed character and openingBraces is not same then return the string is not balanced
if not character is not exist then push to stack
continue this process until to reach end of the string
When string is empty then check if stack is alos empty then return true else return false
Links: https://drive.google.com/file/d/1zD31rPHAqGhrUMDGCm0CwQCRlC5wxjSl/view?usp=drivesdk
Code Explanation :
Middleware
Routes:
Thanks for reading this document hope you enjoy this documents feel free to ask if you have any doubts
| Back | FazBrowse Home | New Git URL |