Questions to ask to find which linear pattern is needed

This text provides a comprehensive pattern-selection cheat sheet for solving problems. It outlines twenty different patterns, each with a set of questions to ask when reading the problem. If the answer to these questions is yes, then the corresponding pattern is likely the correct approach. The patterns include Sliding Window, Two Pointers, Fast and Slow Pointers, Prefix Sum, and many others. Each pattern has trigger words that can help identify when to use it. The patterns are designed to help solve problems efficiently, often by reducing the time complexity from O(n·k) to O(n). The cheat sheet covers a wide range of topics, including arrays, linked lists, and strings. By using this cheat sheet, problem solvers can quickly identify the most suitable pattern for a given problem. The patterns are also grouped into categories, such as those that involve sorting, counting, or modifying arrays in-place. Overall, the cheat sheet provides a valuable resource for anyone looking to improve their problem-solving skills. The patterns and trigger words can be used to develop a systematic approach to solving problems, making it easier to identify the most effective solution.