[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-70676":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":10,"totalLinesOfCode":10,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":15,"subscribersCount":15,"size":15,"stars1d":16,"stars7d":17,"stars30d":18,"stars90d":15,"forks30d":15,"starsTrendScore":19,"compositeScore":20,"rankGlobal":10,"rankLanguage":10,"license":21,"archived":22,"fork":22,"defaultBranch":23,"hasWiki":22,"hasPages":24,"topics":25,"createdAt":10,"pushedAt":10,"updatedAt":32,"readmeContent":33,"aiSummary":34,"trendingCount":15,"starSnapshotCount":15,"syncStatus":35,"lastSyncTime":36,"discoverSource":37},70676,"leetcode-patterns","seanprashad\u002Fleetcode-patterns","seanprashad","A pattern-based approach to learn technical interview questions","https:\u002F\u002Fseanprashad.com\u002Fleetcode-patterns\u002F",null,"TypeScript",13084,2101,109,0,17,32,205,51,44.97,"Other",false,"main",true,[26,27,28,29,30,5,31],"algorithms","data-structures","interview-prep","interview-questions","leetcode","study-guide","2026-06-12 02:02:41","\u003Cp align=\"center\">\n  \u003Cpicture>\n    \u003Csource media=\"(prefers-color-scheme: dark)\" srcset=\"public\u002Fimages\u002Flogo-dark.png\" \u002F>\n    \u003Csource media=\"(prefers-color-scheme: light)\" srcset=\"public\u002Fimages\u002Flogo-light.png\" \u002F>\n    \u003Cimg alt=\"Leetcode Patterns\" src=\"public\u002Fimages\u002Flogo-light.png\" width=\"500\" \u002F>\n  \u003C\u002Fpicture>\n\u003C\u002Fp>\n\n\u003Cp align=\"center\">\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fseanprashad\u002Fleetcode-patterns\u002Factions\u002Fworkflows\u002Fdeploy.yml\">\u003Cimg src=\"https:\u002F\u002Fgithub.com\u002Fseanprashad\u002Fleetcode-patterns\u002Factions\u002Fworkflows\u002Fdeploy.yml\u002Fbadge.svg\" alt=\"Deploy to GitHub Pages\" \u002F>\u003C\u002Fa>\n  \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fseanprashad\u002Fleetcode-patterns\u002Factions\u002Fworkflows\u002Fupdate-questions.yml\">\u003Cimg src=\"https:\u002F\u002Fgithub.com\u002Fseanprashad\u002Fleetcode-patterns\u002Factions\u002Fworkflows\u002Fupdate-questions.yml\u002Fbadge.svg\" alt=\"Update Questions\" \u002F>\u003C\u002Fa>\n\u003C\u002Fp>\n\n## Table of Contents\n\n- [Background](#background)\n- [Fundamentals](#fundamentals)\n- [Notes](#notes)\n- [Question List](#question-list)\n- [Solutions](#solutions)\n- [Contributing](#contributing)\n- [Suggestions](#suggestions)\n- [Acknowledgements](#acknowledgements)\n\n## Background\n\nThis repo is intended for any individual wanting to improve their problem\nsolving skills for software engineering interviews.\n\nProblems are grouped under their respective subtopic, in order to focus on\nrepeatedly applying common patterns rather than randomly tackling questions.\n\nAll questions are available on [leetcode.com] with some requiring [leetcode premium].\n\n## Fundamentals\n\nTo find the greatest amount of success when practicing, it is highly recommended\nto know the methods and runtimes of the following data structures and their\noperations:\n\n- Arrays\n- Maps\n- Linked Lists\n- Queues\n- Heaps\n- Stacks\n- Trees\n- Graphs\n\nIn addition, you should have a good grasp on common algorithms such as:\n\n- Breadth-first search\n- Depth-first search\n- Binary search\n- Recursion\n\n## Notes\n\n[This pdf] contains information for the main data structures in Java.\n\nOther useful methods to know include [`substring()`](https:\u002F\u002Fdocs.oracle.com\u002Fjavase\u002F8\u002Fdocs\u002Fapi\u002Fjava\u002Flang\u002FString.html#substring-int-int-), [`toCharArray()`](https:\u002F\u002Fdocs.oracle.com\u002Fjavase\u002F8\u002Fdocs\u002Fapi\u002Fjava\u002Flang\u002FString.html#toCharArray--), [`Math.max()`](https:\u002F\u002Fdocs.oracle.com\u002Fjavase\u002F8\u002Fdocs\u002Fapi\u002Fjava\u002Flang\u002FMath.html#max-int-int-),\n[`Math.min()`](https:\u002F\u002Fdocs.oracle.com\u002Fjavase\u002F8\u002Fdocs\u002Fapi\u002Fjava\u002Flang\u002FMath.html#min-int-int-), and [`Arrays.fill()`](https:\u002F\u002Fdocs.oracle.com\u002Fjavase\u002F8\u002Fdocs\u002Fapi\u002Fjava\u002Futil\u002FArrays.html#fill-int:A-int-).\n\n## Question List\n\nThe entire question list can be found here:\nhttps:\u002F\u002Fseanprashad.com\u002Fleetcode-patterns\u002F.\n\n## Solutions\n\nSolutions written in Java can be found in the [solutions] branch.\n\n## Contributing\n\nThe app is built with [Next.js] (App Router), [React] 19, [TypeScript], [Tailwind CSS] v4, [TanStack Table] v8, [Lucide React] for icons, and Google Analytics via `@next\u002Fthird-parties`. Tests use [Vitest] + [React Testing Library].\n\n```bash\nnpm install\nnpm run dev         # http:\u002F\u002Flocalhost:3000\nnpm test            # single run\nnpm run test:watch  # watch mode\n```\n\nA [Husky] `pre-push` hook runs `npm test` automatically before every push. This is set up for every clone via the `prepare` script.\n\n## Acknowledgements\n\nThis list is heavily inspired from [Grokking the Coding Interview] with\nadditional problems extracted from the [Blind 75 list] and this hackernoon article\non [14 patterns to ace any coding interview question].\n\n[leetcode.com]: https:\u002F\u002Fleetcode.com\n[leetcode premium]: https:\u002F\u002Fleetcode.com\u002Fsubscribe\u002F\n[next.js]: https:\u002F\u002Fnextjs.org\n[react]: https:\u002F\u002Freact.dev\n[typescript]: https:\u002F\u002Fwww.typescriptlang.org\n[tailwind css]: https:\u002F\u002Ftailwindcss.com\n[tanstack table]: https:\u002F\u002Ftanstack.com\u002Ftable\n[lucide react]: https:\u002F\u002Flucide.dev\n[vitest]: https:\u002F\u002Fvitest.dev\n[react testing library]: https:\u002F\u002Ftesting-library.com\u002Fdocs\u002Freact-testing-library\u002Fintro\n[husky]: https:\u002F\u002Ftypicode.github.io\u002Fhusky\n[this pdf]: https:\u002F\u002Fdrive.google.com\u002Fopen?id=1ao4ZA28zzBttDkuS6MLQI52gDs_CJZEm\n[solutions]: https:\u002F\u002Fgithub.com\u002FSeanPrashad\u002Fleetcode-patterns\u002Ftree\u002Fsolutions\n[grokking the coding interview]: https:\u002F\u002Fwww.educative.io\u002Fcourses\u002Fgrokking-the-coding-interview\n[issue]: https:\u002F\u002Fgithub.com\u002FSeanPrashad\u002Fleetcode-patterns\u002Fissues\u002Fnew\n[blind 75 list]: https:\u002F\u002Fwww.teamblind.com\u002Farticle\u002FNew-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU?utm_source=share&utm_medium=ios_app\n[14 patterns to ace any coding interview question]: https:\u002F\u002Fhackernoon.com\u002F14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed\n","该项目是一个基于模式的学习技术面试题的方法。它通过将问题按子主题分类，帮助用户集中练习常见的解题模式而非随机做题，从而提高软件工程面试中的问题解决能力。使用TypeScript编写，并结合了Next.js、React等现代前端技术栈来构建应用界面。适合准备技术面试、希望提升算法和数据结构理解能力的个人使用。项目涵盖了数组、映射、链表等多种基础数据结构以及广度优先搜索、深度优先搜索等常见算法的知识点，同时提供了详细的题目列表及解决方案。",2,"2026-06-11 03:33:33","high_star"]