You signed in with another tab or window. This is my…, Leetcode Pattern 1 | DFS + BFS == 25% of the problems — part 2, Leetcode Pattern 1 | BFS + DFS == 25% of the problems — part 1, Leetcode Pattern 0 | Iterative traversals on Trees. Instantly share code, notes, and snippets. It falls into the genre of "opinions about how to write good code". Clone with Git or checkout with SVN using the repository’s web address. Today…, Leetcode Pattern 0 | Iterative traversals on Trees, The key to solve algorithm problems posed in technical interviews or elsewhere is to quickly identify the underlying patterns. Thanks for all the positive feedback. Today we’ll explore the intuition behind this powerful…, Leetcode Pattern 1 | DFS + BFS == 25% of the problems — part 2, Hola again ! they're used to gather information about the pages you visit and how many clicks you need to accomplish a task. We use optional third-party analytics cookies to understand how you use GitHub.com so we can build better products. Learn more. Leetcode Patterns : Checkpoint 0. Many people actually asked me to write on…, Leetcode Pattern 1 | BFS + DFS == 25% of the problems — part 1, It is amazing how many graph, tree and string problems simply boil down to a DFS (Depth-first search) / BFS (Breadth-first search). (Besides leetcode, I have compiled this list of resources that helped me) In my opinion, this is more effective for most of the people who are not guru in algorithms. It’s been so long since my last post and my life has undergone so many changes during these past few months :), it’s insane! So this article is a bit different from the other ones in this series and it’s not about specific algorithms but the general approach one should try to follow in their leetcode journey. Note: if you are very new to the interview process of the big tech companies, cracking the coding interview is your friend. Read it only after you're confident in your ability to write code at all. Hi there! I created a LeetCode list for each of the patterns. For more information, see our Privacy Statement. This is based on my own personal experiences and what I have gathered talking to people…, A very important tool to have in our arsenal is backtracking, it is all about knowing when to stop and step back to explore other possible solutions. Number of Connected Components in an Undirected Graph (Leetcode Premium), Longest Substring Without Repeating Characters, Encode and Decode Strings (Leetcode Premium), Construct Binary Tree from Preorder and Inorder Traversal. I found it pretty useful, feel free to make a copy of the list and use it. Experiencing LeetCode fatigue? If you are starting your learning-to-program journey, then it will make you overly self-critical. We use essential cookies to perform essential website functions, e.g. We use optional third-party analytics cookies to understand how you use GitHub.com so we can build better products. Learn these 14 patterns and you’ll have a more complete picture of how to approach a problem no matter the question. reactions. I created a LeetCode list for each of the patterns. Learn more. I found it pretty useful, feel free to make a copy of the list and use it. The one constant that remains is people reading these blogs and reaching out to me on LinkedIn to provide feedback, it makes my day! You can always update your selection by clicking Cookie Preferences at the bottom of the page. If you’re interested in a deeper dive through the above patterns or the example problems under each one, check out Grokking the Coding Interview: Patterns for Coding Questions. Hi there! After doing hundreds of problems on Leetcode, its not uncommon to realize that there are a lot of recurring patterns.