• Solved brute force instantly, O(n^2)
• Simplifying TC to O(n) was a bit tricky, got 70% off it myself, had little trouble with coding it up
• Could not get the follow up, it was a bit tricky but nothing too hard to be honest, i think this should have been easier after understanding how O(n) TC worked