update for solved algorithm problems
| 0001-two-sum |
| 0033-search-in-rotated-sorted-array |
| 0200-number-of-islands |
| 0643-maximum-average-subarray-i |
| 0860-design-circular-queue |
| 0001-two-sum |
| 0069-sqrtx |
| 1236-n-th-tribonacci-number |
| 0033-search-in-rotated-sorted-array |
| 0069-sqrtx |
| 0374-guess-number-higher-or-lower |
| 0374-guess-number-higher-or-lower |
| 0860-design-circular-queue |
| 0860-design-circular-queue |
| 0860-design-circular-queue |
| 0094-binary-tree-inorder-traversal |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0094-binary-tree-inorder-traversal |
| 0102-binary-tree-level-order-traversal |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0094-binary-tree-inorder-traversal |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0200-number-of-islands |
| 2121-find-if-path-exists-in-graph |
| 0094-binary-tree-inorder-traversal |
| 0102-binary-tree-level-order-traversal |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0102-binary-tree-level-order-traversal |
| 0200-number-of-islands |
| 2121-find-if-path-exists-in-graph |
| 0643-maximum-average-subarray-i |
| 0200-number-of-islands |
| 2121-find-if-path-exists-in-graph |
| 0200-number-of-islands |
| 2121-find-if-path-exists-in-graph |
| 1236-n-th-tribonacci-number |
| 1236-n-th-tribonacci-number |
| 0200-number-of-islands |
| 1396-count-servers-that-communicate |
| 1791-richest-customer-wealth |
| 2606-difference-between-ones-and-zeros-in-row-and-column |
| 2764-maximum-number-of-fish-in-a-grid |
| 2021-remove-all-occurrences-of-a-substring |
| 2606-difference-between-ones-and-zeros-in-row-and-column |
| 3332-minimum-operations-to-exceed-threshold-value-ii |
| 0027-remove-element |
| 0088-merge-sorted-array |
| 0125-valid-palindrome |
| 0392-is-subsequence |
| 1019-squares-of-a-sorted-array |
| 1168-duplicate-zeros |
| 1894-merge-strings-alternately |
| 0088-merge-sorted-array |
| 1019-squares-of-a-sorted-array |
| 2473-max-sum-of-a-pair-with-equal-sum-of-digits |
| 0070-climbing-stairs |
| 0198-house-robber |
| 0279-perfect-squares |
| 0338-counting-bits |
| 0392-is-subsequence |
| 0338-counting-bits |
| 1444-number-of-steps-to-reduce-a-number-to-zero |
| 2533-bitwise-xor-of-all-pairings |
| 2766-find-the-prefix-common-array-of-two-arrays |
| 0070-climbing-stairs |
| 0279-perfect-squares |
| 1421-find-numbers-with-even-number-of-digits |
| 1444-number-of-steps-to-reduce-a-number-to-zero |
| 2831-number-of-beautiful-pairs |
| 0070-climbing-stairs |
| 0200-number-of-islands |
| 1396-count-servers-that-communicate |
| 2764-maximum-number-of-fish-in-a-grid |
| 0200-number-of-islands |
| 0279-perfect-squares |
| 0753-open-the-lock |
| 1396-count-servers-that-communicate |
| 2764-maximum-number-of-fish-in-a-grid |
| 0200-number-of-islands |
| 1396-count-servers-that-communicate |
| 2764-maximum-number-of-fish-in-a-grid |
| 0155-min-stack |
| 2021-remove-all-occurrences-of-a-substring |
| 2221-check-if-a-parentheses-string-can-be-valid |
| 0155-min-stack |
| 1537-maximum-score-after-splitting-a-string |
| 1603-running-sum-of-1d-array |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 2292-counting-words-with-a-given-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 1502-construct-k-palindrome-strings |
| 2221-check-if-a-parentheses-string-can-be-valid |
| 2831-number-of-beautiful-pairs |
| 2533-bitwise-xor-of-all-pairings |
| 2473-max-sum-of-a-pair-with-equal-sum-of-digits |
| 3332-minimum-operations-to-exceed-threshold-value-ii |
| 1160-letter-tile-possibilities |
| 1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n |
| 2107-find-unique-binary-string |