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 |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable |
| 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph |
| 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable |
| 0350-intersection-of-two-arrays-ii |
| 1293-three-consecutive-odds |
| 1616-minimum-difference-between-largest-and-smallest-value-in-three-moves |
| 0350-intersection-of-two-arrays-ii |
| 0350-intersection-of-two-arrays-ii |
| 0350-intersection-of-two-arrays-ii |
| 0350-intersection-of-two-arrays-ii |
| 1616-minimum-difference-between-largest-and-smallest-value-in-three-moves |
| 1616-minimum-difference-between-largest-and-smallest-value-in-three-moves |
| 2299-merge-nodes-in-between-zeros |
| 2299-merge-nodes-in-between-zeros |