An Introduction
Tips and tricks
- READ THE QUESTION THOROUGHLY
- Use hashmaps for O(1).
- For array sorted, run O(n) with sorting by index swaps and not other options (like selection sort).
- To find the midpoint of linked lists or something you cannot use length for, use the two pointers and iterate +1, +2 respectively and don't iterate through the entire list.
- Use Regexes wisely.
- Understand converting and iterating through strings (ie understand types, side effects of casting etc)