Balanced Open and Close
Every node holds 1 (an opening bracket) or -1 (a closing bracket). Return True if the brackets are balanced: going from the head to the end you never close more than you have opened, and by the end every opening bracket has been closed. An empty list is balanced. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,1,-1,-1]
returns true
Like (()).
Example 2
head [-1,1]
returns false
Like )( : closes before opening.
Constraints
0 <= number of nodes <= 100- Every
Node.valis1or-1
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Binary Linked List to IntegerBeginner
- Build a Linked List From an ArrayBeginner
- Build a List of DigitsBeginner
- Build a Range ListBeginner
- Compare Two ListsBeginner
- Count Distinct ValuesBeginner
- Count Even ValuesBeginner
- Count a Target ValueBeginner