{"id":190,"date":"2026-01-05T05:04:00","date_gmt":"2026-01-04T23:34:00","guid":{"rendered":"https:\/\/craqly.com\/?p=186"},"modified":"2026-07-22T12:19:47","modified_gmt":"2026-07-22T12:19:47","slug":"leetcode-patterns-cheat-sheet","status":"publish","type":"post","link":"https:\/\/craqly.com\/blog\/leetcode-patterns-cheat-sheet\/","title":{"rendered":"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026"},"content":{"rendered":"<p>Here&#8217;s something I find genuinely useful to say out loud: there are roughly 15 patterns that cover most of what you&#8217;ll see in a coding interview. Not 150. Not &#8220;thousands of problems.&#8221; Fifteen patterns, applied in different combinations.<\/p>\n<p>The <a href=\"https:\/\/survey.stackoverflow.co\/2024\/\" target=\"_blank\" rel=\"noopener noreferrer\">Stack Overflow Developer Survey 2024<\/a> found that 62% of developers actively preparing for jobs said algorithmic problem-solving was their biggest source of anxiety. My guess is that number is high partly because of how most people prepare: they grind solutions instead of learning to recognize what kind of problem they&#8217;re looking at. This cheat sheet is about the second thing.<\/p>\n<h2>The recognition problem<\/h2>\n<p>The hard part of a coding interview isn&#8217;t usually the implementation. It&#8217;s the first 90 seconds: what am I even looking at here? If you can identify the pattern, the implementation tends to follow. If you can&#8217;t, you end up flailing at a whiteboard hoping your fingers remember something your brain doesn&#8217;t.<\/p>\n<p>So here&#8217;s the framing I&#8217;d suggest: for each pattern below, focus on the &#8220;when does this apply&#8221; column more than the code itself. That&#8217;s the muscle you actually need.<\/p>\n<h2>The 15 patterns, with honest notes on each<\/h2>\n<p><strong>Two Pointers.<\/strong> Use this when you have a sorted array and you&#8217;re looking for pairs or need to compare elements from both ends. Classic tells: &#8220;find two numbers that sum to X&#8221; or &#8220;remove duplicates in place.&#8221; Fast to implement once you see it.<\/p>\n<p><strong>Sliding Window.<\/strong> Subarray problems. Substring problems. Any time &#8220;contiguous sequence&#8221; appears in the problem. The window expands and contracts; you track a running value instead of recomputing. Good practice: Longest Substring Without Repeating Characters (LeetCode 3).<\/p>\n<p><strong>Fast and Slow Pointers (Floyd&#8217;s).<\/strong> Cycle detection. If someone asks whether a linked list has a cycle, or asks you to find the middle element in one pass, this is it. The slow pointer moves one step, the fast pointer moves two. They meet if there&#8217;s a cycle.<\/p>\n<p><strong>Merge Intervals.<\/strong> Any problem involving overlapping ranges. Interview scheduling. Calendar conflicts. Sort by start time, then check if the current interval overlaps the last merged one. Straightforward once the pattern clicks.<\/p>\n<p><strong>Binary Search.<\/strong> Not just &#8220;is this value in the sorted array.&#8221; Binary search applies to any monotonic function. &#8220;Find the minimum in a rotated sorted array&#8221; is binary search. &#8220;Find the smallest X such that condition holds&#8221; is binary search. I think people underuse this pattern because they associate it only with the textbook case.<\/p>\n<p><strong>BFS (Breadth-First Search).<\/strong> Shortest path in an unweighted graph. Level-order traversal. &#8220;Minimum number of steps&#8221; problems. BFS guarantees you find the shortest path first. DFS doesn&#8217;t.<\/p>\n<p><strong>DFS (Depth-First Search).<\/strong> Exploring all possibilities. Path existence. Tree traversals. Any problem where you need to visit every node or try every combination before backtracking.<\/p>\n<p><strong>Backtracking.<\/strong> Subset generation, permutations, combinations, constraint satisfaction. The pattern: try an option, recurse, undo the option. N-Queens is the textbook example but you&#8217;ll see it in &#8220;generate all valid parentheses&#8221; and similar problems. (Side note: backtracking problems look scarier than they are. Once you write the template once, it&#8217;s mostly filling in the pruning condition.)<\/p>\n<p><strong>Dynamic Programming.<\/strong> Overlapping subproblems, optimal substructure. The honest truth about DP is that it covers a huge range of problems and doesn&#8217;t have one clean template. What does have a template is the approach: define the state, write the recurrence, decide top-down or bottom-up. Coin change and longest common subsequence are the two I&#8217;d practice first.<\/p>\n<p><strong>Topological Sort.<\/strong> Dependency ordering. Build systems. Course prerequisites. Whenever you have a directed acyclic graph and need to order nodes so that all dependencies come first. Kahn&#8217;s algorithm (BFS-based) is easier to implement in an interview than DFS-based toposort.<\/p>\n<p><strong>Heap \/ Priority Queue.<\/strong> &#8220;K largest elements,&#8221; &#8220;merge K sorted lists,&#8221; &#8220;find the median of a data stream.&#8221; If the problem involves repeatedly pulling the smallest or largest element from a changing set, reach for a heap.<\/p>\n<p><strong>Union Find (Disjoint Sets).<\/strong> Connected components. Network connectivity. &#8220;Are these two nodes in the same group?&#8221; Union Find answers that question in near-constant time after initialization. It comes up less often than heaps or DP, but when it does come up, you want to recognize it quickly.<\/p>\n<p><strong>Trie.<\/strong> Prefix matching. Autocomplete. &#8220;Does any word start with this prefix.&#8221; A trie is a tree where each node is a character. You&#8217;ll see this mostly in string problems where suffix\/prefix operations repeat across many queries.<\/p>\n<p><strong>Monotonic Stack.<\/strong> &#8220;Next greater element,&#8221; &#8220;daily temperatures,&#8221; problems involving &#8220;the next X that is bigger\/smaller.&#8221; The stack maintains a decreasing (or increasing) sequence. When you push an element that breaks the monotonicity, you process whatever gets popped.<\/p>\n<p><strong>Bit Manipulation.<\/strong> XOR for finding unpaired elements. Bit shifting for fast multiplication\/division by powers of two. Checking whether a number is a power of two (<code>n & (n-1) == 0<\/code>). These problems show up occasionally. They&#8217;re not the majority, but they reward having seen them before.<\/p>\n<h2>Quick recognition table<\/h2>\n<table>\n<thead>\n<tr>\n<th>If the problem says&#8230;<\/th>\n<th>Think about&#8230;<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>sorted array, pairs, duplicates<\/td>\n<td>Two Pointers<\/td>\n<\/tr>\n<tr>\n<td>contiguous subarray, substring<\/td>\n<td>Sliding Window<\/td>\n<\/tr>\n<tr>\n<td>linked list cycle, middle element<\/td>\n<td>Fast &amp; Slow Pointers<\/td>\n<\/tr>\n<tr>\n<td>overlapping intervals, calendar<\/td>\n<td>Merge Intervals<\/td>\n<\/tr>\n<tr>\n<td>find minimum X such that condition<\/td>\n<td>Binary Search<\/td>\n<\/tr>\n<tr>\n<td>shortest path, minimum steps<\/td>\n<td>BFS<\/td>\n<\/tr>\n<tr>\n<td>all paths, permutations, subsets<\/td>\n<td>DFS \/ Backtracking<\/td>\n<\/tr>\n<tr>\n<td>dependencies, prerequisites<\/td>\n<td>Topological Sort<\/td>\n<\/tr>\n<tr>\n<td>K largest \/ smallest, median<\/td>\n<td>Heap<\/td>\n<\/tr>\n<tr>\n<td>connected components, groups<\/td>\n<td>Union Find<\/td>\n<\/tr>\n<tr>\n<td>prefix search, autocomplete<\/td>\n<td>Trie<\/td>\n<\/tr>\n<tr>\n<td>next greater\/smaller element<\/td>\n<td>Monotonic Stack<\/td>\n<\/tr>\n<tr>\n<td>find unique, XOR tricks<\/td>\n<td>Bit Manipulation<\/td>\n<\/tr>\n<tr>\n<td>repeated subproblems, optimal<\/td>\n<td>Dynamic Programming<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>How to actually use this<\/h2>\n<p>Print it out (or keep it open in another tab) while you practice. Before you look at a solution, write down which pattern you think applies and why. Getting this wrong isn&#8217;t a problem. Getting it wrong and then seeing the right answer teaches you more than solving problems where you already know the approach.<\/p>\n<p>Three to five problems per pattern is enough for most people preparing for mid-level roles. More for senior positions where the problems get combined (sliding window plus heap, for example). I wouldn&#8217;t try to grind all 15 in a week; pick the five or six you&#8217;re weakest on and focus there.<\/p>\n<p>If you&#8217;re doing mock interviews, having someone (or an AI interview tool) give you hints framed around pattern names rather than solutions is a much more effective way to practice than just reading the editorial. You want to build the recognition reflex, not the solution memory.<\/p>\n<p>One last thing: this list doesn&#8217;t cover system design. That&#8217;s a separate skill entirely.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.<\/p>\n","protected":false},"author":25,"featured_media":519,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","ast-disable-related-posts":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"fifu_image_url":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","fifu_image_alt":"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026","footnotes":""},"categories":[4],"tags":[865,866,870,869,867,868],"class_list":["post-190","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technical-prep","tag-algorithm-interview-patterns","tag-coding-interview-techniques","tag-dynamic-programming","tag-graph-traversal-patterns","tag-problem-solving-frameworks","tag-sliding-window-algorithm"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.7 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly<\/title>\n<meta name=\"description\" content=\"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/craqly.com\/blog\/?p=190\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly\" \/>\n<meta property=\"og:description\" content=\"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/craqly.com\/blog\/?p=190\" \/>\n<meta property=\"og:site_name\" content=\"Craqly Blog\" \/>\n<meta property=\"article:published_time\" content=\"2026-01-04T23:34:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2026-07-22T12:19:47+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\" \/>\n<meta name=\"author\" content=\"Shekhar Babu\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:image\" content=\"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Shekhar Babu\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190\"},\"author\":{\"name\":\"Shekhar Babu\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/#\\\/schema\\\/person\\\/2d367ffecd1340d5b34c9fff026bf761\"},\"headline\":\"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026\",\"datePublished\":\"2026-01-04T23:34:00+00:00\",\"dateModified\":\"2026-07-22T12:19:47+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190\"},\"wordCount\":1093,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/images.unsplash.com\\\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\",\"keywords\":[\"algorithm interview patterns\",\"coding interview techniques\",\"dynamic programming\",\"graph traversal patterns\",\"problem-solving frameworks\",\"sliding window algorithm\"],\"articleSection\":[\"Technical Prep\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190\",\"url\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190\",\"name\":\"LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/images.unsplash.com\\\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\",\"datePublished\":\"2026-01-04T23:34:00+00:00\",\"dateModified\":\"2026-07-22T12:19:47+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/#\\\/schema\\\/person\\\/2d367ffecd1340d5b34c9fff026bf761\"},\"description\":\"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#primaryimage\",\"url\":\"https:\\\/\\\/images.unsplash.com\\\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\",\"contentUrl\":\"https:\\\/\\\/images.unsplash.com\\\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop\",\"caption\":\"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?p=190#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/craqly.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/craqly.com\\\/blog\\\/\",\"name\":\"Craqly Blog\",\"description\":\"AI interview prep, career advice, company guides\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/craqly.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/craqly.com\\\/blog\\\/#\\\/schema\\\/person\\\/2d367ffecd1340d5b34c9fff026bf761\",\"name\":\"Shekhar Babu\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g\",\"caption\":\"Shekhar Babu\"},\"description\":\"Shekhar Babu is an engineer on the Craqly team building the AI interview assistant. He writes about technical interview rounds and how candidates prepare for them.\",\"sameAs\":[\"https:\\\/\\\/in.linkedin.com\\\/in\\\/shekhar-t-09259314b\"],\"url\":\"https:\\\/\\\/craqly.com\\\/blog\\\/author\\\/shekhar-babu\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly","description":"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/craqly.com\/blog\/?p=190","og_locale":"en_US","og_type":"article","og_title":"LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly","og_description":"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.","og_url":"https:\/\/craqly.com\/blog\/?p=190","og_site_name":"Craqly Blog","article_published_time":"2026-01-04T23:34:00+00:00","article_modified_time":"2026-07-22T12:19:47+00:00","og_image":[{"url":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","type":"","width":"","height":""}],"author":"Shekhar Babu","twitter_card":"summary_large_image","twitter_image":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","twitter_misc":{"Written by":"Shekhar Babu","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/craqly.com\/blog\/?p=190#article","isPartOf":{"@id":"https:\/\/craqly.com\/blog\/?p=190"},"author":{"name":"Shekhar Babu","@id":"https:\/\/craqly.com\/blog\/#\/schema\/person\/2d367ffecd1340d5b34c9fff026bf761"},"headline":"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026","datePublished":"2026-01-04T23:34:00+00:00","dateModified":"2026-07-22T12:19:47+00:00","mainEntityOfPage":{"@id":"https:\/\/craqly.com\/blog\/?p=190"},"wordCount":1093,"commentCount":0,"image":{"@id":"https:\/\/craqly.com\/blog\/?p=190#primaryimage"},"thumbnailUrl":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","keywords":["algorithm interview patterns","coding interview techniques","dynamic programming","graph traversal patterns","problem-solving frameworks","sliding window algorithm"],"articleSection":["Technical Prep"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/craqly.com\/blog\/?p=190#respond"]}]},{"@type":"WebPage","@id":"https:\/\/craqly.com\/blog\/?p=190","url":"https:\/\/craqly.com\/blog\/?p=190","name":"LeetCode Patterns Cheat Sheet: 15 That Matter | Craqly","isPartOf":{"@id":"https:\/\/craqly.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/craqly.com\/blog\/?p=190#primaryimage"},"image":{"@id":"https:\/\/craqly.com\/blog\/?p=190#primaryimage"},"thumbnailUrl":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","datePublished":"2026-01-04T23:34:00+00:00","dateModified":"2026-07-22T12:19:47+00:00","author":{"@id":"https:\/\/craqly.com\/blog\/#\/schema\/person\/2d367ffecd1340d5b34c9fff026bf761"},"description":"Stop memorizing solutions. Learn the 15 LeetCode patterns that cover most coding interview problems, with when-to-use triggers and practice problem picks.","breadcrumb":{"@id":"https:\/\/craqly.com\/blog\/?p=190#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/craqly.com\/blog\/?p=190"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/craqly.com\/blog\/?p=190#primaryimage","url":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","contentUrl":"https:\/\/images.unsplash.com\/photo-1515879218367-8466d910aaa4?w=1200&h=600&fit=crop","caption":"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026"},{"@type":"BreadcrumbList","@id":"https:\/\/craqly.com\/blog\/?p=190#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/craqly.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Algorithm Patterns for Coding Interviews: The Framework for Problem-Solving 2026"}]},{"@type":"WebSite","@id":"https:\/\/craqly.com\/blog\/#website","url":"https:\/\/craqly.com\/blog\/","name":"Craqly Blog","description":"AI interview prep, career advice, company guides","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/craqly.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/craqly.com\/blog\/#\/schema\/person\/2d367ffecd1340d5b34c9fff026bf761","name":"Shekhar Babu","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/65adfea7b83f8159b447d8e0245a7e47b930966daebf4377dea2f2e88cfb9a05?s=96&d=mm&r=g","caption":"Shekhar Babu"},"description":"Shekhar Babu is an engineer on the Craqly team building the AI interview assistant. He writes about technical interview rounds and how candidates prepare for them.","sameAs":["https:\/\/in.linkedin.com\/in\/shekhar-t-09259314b"],"url":"https:\/\/craqly.com\/blog\/author\/shekhar-babu\/"}]}},"_links":{"self":[{"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/posts\/190","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/users\/25"}],"replies":[{"embeddable":true,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/comments?post=190"}],"version-history":[{"count":2,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/posts\/190\/revisions"}],"predecessor-version":[{"id":971,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/posts\/190\/revisions\/971"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/media\/519"}],"wp:attachment":[{"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/media?parent=190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/categories?post=190"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/craqly.com\/blog\/wp-json\/wp\/v2\/tags?post=190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}