{"full_name":"sisterAn/JavaScript-Algorithms","owner":"sisterAn","name":"JavaScript-Algorithms","shard":"1","url":"https://github.com/sisterAn/JavaScript-Algorithms","description":"基础理论+JS框架应用+实践，从0到1构建整个前端算法体系","homepage":"","topics":["javascript","algorithms","interview"],"tag_pages":["algorithms","interview","javascript"],"language":null,"license":null,"avatar":"https://avatars.githubusercontent.com/u/19721451?u=28251581b90d3a0766b2d966ee21a79b8bb8cdc1&v=4","created_at":"2020-04-01T03:27:02Z","pushed_at":"2022-04-23T09:51:58Z","metrics":{"stars":5677,"forks":638,"watchers":122,"issues":171,"prs":0,"releases":0,"issues_open":158,"issues_closed":13,"prs_open":0,"prs_closed":0,"prs_merged":0,"discussions":0},"growth":{"day":{"stars":0,"forks":0,"base_day":"2026-11-15"}},"history":{"dates":["2026-11-10","2026-11-11","2026-11-12","2026-11-13","2026-11-14","2026-11-15","2026-11-16"],"stars":[5676,5676,5676,5676,5676,5677,5677],"forks":[638,638,638,638,638,638,638],"watchers":[null,122,122,122,122,122,122],"issues_open":[null,158,158,158,158,158,158],"prs_open":[null,0,0,0,0,0,0]},"boards":{},"same_owner":[],"issues":[{"number":3,"title":"图解leetcode88：合并两个有序数组","comments":38,"created_at":"2020-04-02T12:25:37Z"},{"number":10,"title":"阿里算法题：编写一个函数计算多个数组的交集","comments":30,"created_at":"2020-04-07T13:24:47Z"},{"number":6,"title":"腾讯&leetcode：给定两个数组，编写一个函数来计算它们的交集","comments":30,"created_at":"2020-04-05T14:58:55Z"},{"number":5,"title":"腾讯：数组扁平化、去重、排序","comments":24,"created_at":"2020-04-03T04:03:05Z"},{"number":7,"title":"华为&leetcode146：LRU 缓存机制","comments":23,"created_at":"2020-04-06T12:50:15Z"},{"number":4,"title":"字节&leetcode1：两数之和","comments":22,"created_at":"2020-04-02T12:27:25Z"},{"number":23,"title":"字节&leetcode155：最小栈（包含getMin函数的栈）","comments":21,"created_at":"2020-04-21T14:02:56Z"},{"number":26,"title":"leetcode1047：删除字符串中的所有相邻重复项","comments":20,"created_at":"2020-04-23T16:09:30Z"}],"discussions":[],"latest_release":null,"readme":true,"readme_zh":false,"news":[],"stale":false,"snapshot_at":"2026-11-16T09:23:14Z","history_start":"2026-09-06"}