Skip to content

Latest commit

 

History

History
258 lines (131 loc) · 7.56 KB

README.md

File metadata and controls

258 lines (131 loc) · 7.56 KB

Guide

Problem no is according to LeetCode. That means Problem 1480 is also Problem 1480 on LeetCode

Folder name problem.1.1480 means LeetCode problem 1480. .1 means the sequence in which I solved the problems. Folder name problem.2.1672 means LeetCode problem 1672. .2 means the sequence in which I solved the problems.

In the pictures here, you can see the runtime distribution and memory distribution

Tips to search

  • Press ctrl + F and type the number of LeetCode problem you want to find

  • For example: ctrl + F and .1480. You will find problem 1480


Problem 1480 (1)

solve

Problem 1672 (2)

solve

Problem 412 (3)

solve

Problem 1342 (4)

solve

Problem 1 (5)

solve

Problem 9 (6)

solve

Problem 13 (7)

solve

Problem 242 (8)

solve

Problem 268 (9)

solve

Problem 66 (10)

solve

Problem 26 (11)

solve

Problem 88 (12)

solve

Problem 69 (13)

solve

Problem 136 (14)

solve

Problem 169 (15)

solve

Problem 27 (16)

solve

Problem 35 (17)

solve

Problem 58 (18)

solve

Problem 14 (19)

solve

Problem 258 (20)

solve

Problem 20 (21)

solve

Problem 118 (22)

solve

Problem 67 (23)

solve

Problem 70 (24)

solve

Problem 119 (25)

solve

Problem 121 (26)

solve

Problem 125 (27)

solve

Problem 217 (28)

solve

Problem 205 (29)

solve

Problem 415 (30)

solve

Problem 389 (31)

solve

Problem 387 (32)

solve

Problem 383 (33)

solve

Problem 21 (34)

solve

Problem 350 (35)

solve

Problem 345 (36)

solve

Problem 344 (37)

solve

Problem 342 (38)

solve

Problem 283 (39)

solve

Problem 434 (40)

solve

Problem 448 (41)

solve

Problem 459 (42)

solve

Problem 461 (43)

solve

Problem 476 (44)

solve

Problem 482 (45)

solve

Problem 485 (46)

solve

Problem 495 (47)

solve

Problem 496 (48)

solve

Problem 500 (49)

solve

Problem 506 (50)

solve

Problem 507 (51)

solve

Problem 509 (52)

solve

Problem 520 (53)

solve

Problem 521 (54) Longest Uncommon Subsequence I

solve

Problem 541 (55) Reverse String II

solve

Problem 551 (56) Student Attendance Record I

solve

Problem 557 (57) Reverse Words in a String III

solve

Problem 561 (58) Array Partition

solve

Problem 575 (59) Distribute Candies

solve

Problem 594 (60) Longest Harmonious Subsequence

solve