Ruthless algorithm machine

• 今日算法

• 难度

  简单/中等/困难/地狱

• 题目仓库 [dir] 链接

Create daily question

# 1. git checkout master
git checkout master
# 2. mkdir [dir] && cd [dir]
mkdir [dir] && cd [dir]
# 3. 补充题目描述
touch README.md
# 4. git push origin HEAD:[name]
git push origin HEAD:[name]
# 5. 从 [name] 分支发起 pr 到 master 并 merge

Commit

• 本地基于 master 创建任意分支并切换到该分支
• 在题目仓库目录创建对应的 [dir][file] 下完成答案
• 在 [dir]/test.spec.ts 下完成测试用例编写
• 通过 yarn test [dir]/test.spec.ts 单元测试（运行所有单测运行 yarn test）
• 推送到任意远程分支 git push origin HEAD:[branchName]
• 发起 Pull request 到 master 分支

Review

Each other.

History

• 20210110 DuplicateSubTree
• 20210108 groupAnagrams
• 20210107 ContainsNearbyDuplicate
• 20210106 MinSumOfIndex
• 20210105 isHappyNumber
• 20210103 FirstUniqChar
• 20210102 IntersectionOfTwoArrays
• 20201231 FourSum
• 20201230 SingleNumber
• 20201229 containsDuplicate
• 20201228 DesignHashSet
• 20201223 PrintDomTreeChildren
• 20201222 ThreeSumClosest
• 20201221 CircusTowerLcci
• 20201219 TelNum
• 20201218 MaxSum
• 20201217 TransformIndent
• 20201216 minPathSum
• 20201215 Convert
• 20201214 RestoreIpAddresses
• 20201213 PathExist
• 20201212 Pow
• 20201210 VerifySearchTree
• 20201209 NumWays
• 20201208 LongestContinuousCommonString
• 20201207 LongestCommonString
• 20201206 ImplementQueueByStack
• 20201205 LongestCommonString
• 20201204 ReconstructionOfBinaryTree