{"id":16439638,"url":"https://github.com/bluezhan/find-a-better-algorithm","last_synced_at":"2025-10-15T05:13:22.991Z","repository":{"id":82647425,"uuid":"392150165","full_name":"bluezhan/find-a-better-algorithm","owner":"bluezhan","description":"🎩 Don't diddle code to make it faster - find a better algorithm.","archived":false,"fork":false,"pushed_at":"2021-08-03T01:40:27.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-08T11:24:18.344Z","etag":null,"topics":["algorithm","javascript","leetcode","mathematics"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bluezhan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-08-03T01:40:26.000Z","updated_at":"2021-08-03T01:46:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"535c6bf9-4e4c-43a0-860b-122da1e5d829","html_url":"https://github.com/bluezhan/find-a-better-algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bluezhan%2Ffind-a-better-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bluezhan%2Ffind-a-better-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bluezhan%2Ffind-a-better-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bluezhan%2Ffind-a-better-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bluezhan","download_url":"https://codeload.github.com/bluezhan/find-a-better-algorithm/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240757826,"owners_count":19852830,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","javascript","leetcode","mathematics"],"created_at":"2024-10-11T09:09:58.654Z","updated_at":"2025-10-15T05:13:22.984Z","avatar_url":"https://github.com/bluezhan.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# find-a-better-algorithm\n\nDon't diddle code to make it faster - find a better algorithm.\n\n## 一些基础算法题目\n\n目录在`基础算法题目`文件夹里面。\n\n- 001 给定整数数组 nums 和整数 target，返回两个数的下标使得它们的和等于 target\n- 002 判断整数 x 是否是回文数（正反读相同）\n- 003 原地反转输入的字符数组 str（必须直接修改原数组）\n- 004 合并两个升序链表为一个新的升序链表\n- 005 判断字符串 s 中的括号是否有效闭合\n- 006 原地删除排序数组中的重复项，返回新长度\n- 007 查找字符串数组中的最长公共前缀\n- 008 每次可以爬 1 或 2 个台阶，求到达第 `n` 阶的不同方法数\n- 009 将 `nums2` 合并到 `nums1` 中（假设 `nums1` 有足够的空间）\n- 010 在股票价格数组中找到最大利润（只能买卖一次）\n- 100 10 道 LeetCode 风格的简单题目\n- 101 10 道高级 LeetCode 题目及 TypeScript 解答\n- 102 20 道 React + TypeScript 高级面试题及解答\n\n## React+TS 面试题和知识点\n\n目录在`React+TS面试题和知识点`文件夹里面。\n\n- 102 20 道 React + TypeScript 高级面试题及解答\n- 10 道 react + typescrip 的高级大型面试题\n- 15 道偏向 React 技术的前端面试题及详细答案\n- 2025 年的技术演进和行业趋势\n- 5 道前端面试题\n- Lodash 替代方案与现代工具库推荐\n- Q1-5 到前端面试题\n- React + TypeScript 银行系统前端测试框架的完整方案\n- React 18 和 React 19（基于公开讨论和路线图）的十道高级面试题\n- React 19 作为一次重大版本更新\n- React 如何利用 WebAssembly 加速计算（附完整案例）\n- React 中使用数据不可变性优化渲染的案例\n- React 开发中最容易出现的错误写法及其解决方案\n- React.FC 被官方建议弃用的背景\n- Web Worker 适用场景与不适用场景分析\n- 从 React 的严格模式出发\n- 关于 React+TypeScript 技术栈中已淘汰的实践、当前高级写法及复杂项目管理策略的总结\n- 结合 yup，Zod 或 io-ts 实现运行时类型校验\n- 编写高质量 React 代码的具体策略和实际案例\n- 逐步排查和解决 React 组件的性能问题\n- 前端数值计算与精度处理\n- 银行系统前端复杂项目搭建指南\n- 核心特点、难点、优点以及编写高质量 React 代码的关键策略\n- 前端主管管理复杂金融项目，需在技术、流程、团队三个维度构建体系化策略\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbluezhan%2Ffind-a-better-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbluezhan%2Ffind-a-better-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbluezhan%2Ffind-a-better-algorithm/lists"}