Repository files navigation

• Background
• Fundamentals
• Notes
• Question List
• Solutions
• Suggestions
• Acknowledgements

This repo is intended for any individual wanting to improve their problemsolving skills for software engineering interviews.

Problems are grouped under their respective subtopic, in order to focus onrepeatedly applying common patterns rather than randomly tackling questions.

All questions are available onleetcode.com with some requiringleetcode premium.

To find the greatest amount of success when practicing, it is highly recommendedto know the methods and runtimes of the following data structures and theiroperations:

• Arrays
• Maps
• Linked Lists
• Queues
• Heaps
• Stacks
• Trees
• Graphs

In addition, you should have a good grasp on common algorithms such as:

• Breadth-first search
• Depth-first search
• Binary search
• Recursion

This pdf contains information for the main data structures in Java.

Other useful methods to know includesubstring(),toCharArray(),Math.max(),Math.min(), andArrays.fill().

The entire question list can be found here:https://seanprashad.com/leetcode-patterns/.

Solutions written in Java can be found in thesolutions branch.

Think a question should/shouldn't be included? Wish there was another feature?Feel free to open anissue with your suggestion!

This list is heavily inspired fromGrokking the Coding Interview withadditional problems extracted from theBlind 75 list and this hackernoon articleon14 patterns to ace any coding interview question.