asked two leetcode hards, easy questions but have hard optimizations
i went from the recruiter call straight into a 2x1h technical loop. brush up on your ds&a, even for frontend
Interview questions [1]
Question 1
1. given a string and an integer n, return the n most occuring words in the string
2. given an integer n, where 0 <= n <= 999, return the string representation of n