Skip to content
😟
I may be slow to respond.
😟
I may be slow to respond.
Pro
Block or report user

Report or block azl397985856

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse

Organizations

@leetcode-book
Block or report user

Report or block azl397985856

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse

Pinned

  1. leetcode

    LeetCode Solutions: A Record of My Problem Solving Journey.( leetcode题解，记录自己的leetcode解题之路。)

    JavaScript 25.5k 4.6k

  2. fe-interview

    宇宙最强的前端面试指南 (https://lucifer.ren/fe-interview)

    954 105

  3. automate-everything

    这是我准备写的第一本书，其实早些时候已经打算开始写书了，只是苦于没有写书经验，无从下手。写书不同于博客，写书需要将知识，经验等系统化地讲述出来，而我现在恰巧缺乏这种表现能力。因此我决定在这里将项目中零散的东西记录下来，然后后期润色一下，写成一本书。

    Roff 290 25

  4. daily-featured

    每天给你推荐一个新奇，好玩，高品质的开源库，好文，观点或言论等。

    161 12

  5. mono-react

    Create React from zero series

    56 8

  6. mono-webpack

    Create webpack from zero series

    30 6

550 contributions in the last year

Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec Jan Mon Wed Fri
Learn how we count contributions.
Less
More

Contribution activity

January 2020

Created an issue in azl397985856/leetcode that received 9 comments

【每日一题】- 2020-01-08 - 1297. 子串的最大出现次数

给你一个字符串 s ，请你返回满足以下条件且出现次数最大的 任意 子串的出现次数： 子串中不同字母的数目必须小于等于 maxLetters 。 子串的长度必须大于等于 minSize 且小于等于 maxSize 。   示例 1： 输入：s = "aababcaab", maxLetters …

9 comments

Seeing something unexpected? Take a look at the GitHub profile guide.

You can’t perform that action at this time.