Easy Solutions of some of the best programs available on LeetCode for Beginners and Intermediate , uploaded on languages namely Python , Java , C++, C .
| 0075-sort-colors |
| 0344-reverse-string |
| 0633-sum-of-square-numbers |
| 0853-most-profit-assigning-work |
| 2572-append-characters-to-string-to-make-subsequence |
| 0344-reverse-string |
| 0409-longest-palindrome |
| 0648-replace-words |
| 1044-find-common-characters |
| 2572-append-characters-to-string-to-make-subsequence |
| 1245-user-activity-for-the-past-30-days-i |
| 2495-number-of-unique-subjects-taught-by-each-teacher |
| 0648-replace-words |
| 0523-continuous-subarray-sum |
| 0633-sum-of-square-numbers |
| 1370-count-number-of-nice-subarrays |
| 0523-continuous-subarray-sum |
| 1016-subarray-sums-divisible-by-k |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 0982-minimum-increment-to-make-array-unique |
| 1137-height-checker |
| 1217-relative-sort-array |
| 0502-ipo |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 2379-maximum-total-importance-of-roads |
| 0633-sum-of-square-numbers |
| 0853-most-profit-assigning-work |
| 1605-minimum-number-of-days-to-make-m-bouquets |
| 1675-magnetic-force-between-two-balls |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1138-grumpy-bookstore-owner |
| 1370-count-number-of-nice-subarrays |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
| 1037-minimum-number-of-k-consecutive-bit-flips |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1114-binary-search-tree-to-greater-sum-tree |
| 1285-balance-a-binary-search-tree |
| 1285-balance-a-binary-search-tree |
| 1916-find-center-of-star-graph |
| 2379-maximum-total-importance-of-roads |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 2472-build-a-matrix-with-conditions |
| 0984-most-stones-removed-with-same-row-or-column |
| 0999-regions-cut-by-slashes |
| 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable |
| 2035-count-sub-islands |
| 0350-intersection-of-two-arrays-ii |
| 0719-find-k-th-smallest-pair-distance |
| 1615-range-sum-of-sorted-subarray-sums |
| 0033-search-in-rotated-sorted-array |
| 0350-intersection-of-two-arrays-ii |
| 0719-find-k-th-smallest-pair-distance |
| 1615-range-sum-of-sorted-subarray-sums |
| 2006-find-the-student-that-will-replace-the-chalk |
| 2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points |
| 2299-merge-nodes-in-between-zeros |
| 0273-integer-to-english-words |
| 1951-find-the-winner-of-the-circular-game |
| 1951-find-the-winner-of-the-circular-game |
| 0948-sort-an-array |
| 0264-ugly-number-ii |
| 0789-kth-largest-element-in-a-stream |
| 0948-sort-an-array |
| 1325-path-with-maximum-probability |
| 2803-modify-graph-edge-weights |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 0948-sort-an-array |
| 2163-kth-distinct-string-in-an-array |
| 3276-minimum-number-of-pushes-to-type-word-ii |
| 1511-count-number-of-teams |
| 2255-minimum-swaps-to-group-all-1s-together-ii |
| 1691-minimum-number-of-days-to-disconnect-island |
| 0789-kth-largest-element-in-a-stream |
| 0789-kth-largest-element-in-a-stream |
| 0789-kth-largest-element-in-a-stream |
| 0040-combination-sum-ii |
| 1240-stone-game-ii |
| 2006-find-the-student-that-will-replace-the-chalk |
| 1240-stone-game-ii |
| 0476-number-complement |