LeetCode
Problems I've solved, and notes on how: the approach, the mistakes I made and what I still need to re-drill.
Solved on LeetCode
43problems solved
- Easy
- 31
- Medium
- 11
- Hard
- 1
As of
Notes 4
Given a string of ()[]{}characters, decide whether every bracket is closed by the same type of bracket, in the right order.stack matching
Merge two sorted linked lists into one sorted list by splicing their nodes together, and return its head. two pointers + dummy node
Given a string s, reverse the order of the words (not characters). Words are separated by spaces; input may contain leading/trailing/multiple spaces which must be collapsed into single spaces in the output.string split / two pointers
Reverse a singly linked list and return the new head. in-place pointer reversal