The DSA Patterns I’d Revise Before an Interview
Whenever I think about looking for a new, higher-paying Developer job, DSA interview problems are the first gatekeeper between me and the job. I have prepared for these problems in the past, but only until I get a new job. After getting the job, I feel no need to continue solving DSA problems. And after some time, if I wish to look for a job again and start preparing for DSA, it feels like starting again from the beginning. Even though the catch-up is fast, the hunt for DSA resources still feels like starting from scratch. I wish there were a resource that summarised all the patterns I had learnt during preparation, so I could quickly revisit every pattern before my next interview. This article is my endeavour towards fulfilling that wish. Pattern 1: O(1) Lookup Problem Statement Suppose you are given an array of integers ( [3, 1, 9, 2, 6] ) and a target number ( 8 ). The problem is to find a pair of numbers in the array whose some is equal to the target number. Brute Force Solu...