Here I solve leetcode problems by different approach , you can see and try to solve by own . Here you can find the problems solution if you find problem or have doubt in any problem . Try to understand , then solve by yourself .
Keep learning and Growing .
| 0075-sort-colors |
| 0853-most-profit-assigning-work |
| 2572-append-characters-to-string-to-make-subsequence |
| 0648-replace-words |
| 1044-find-common-characters |
| 2572-append-characters-to-string-to-make-subsequence |
| 1553-count-triplets-that-can-form-two-arrays-of-equal-xor |
| 1631-number-of-sub-arrays-with-odd-sum |
| 1553-count-triplets-that-can-form-two-arrays-of-equal-xor |
| 1553-count-triplets-that-can-form-two-arrays-of-equal-xor |
| 1631-number-of-sub-arrays-with-odd-sum |
| 0648-replace-words |
| 1631-number-of-sub-arrays-with-odd-sum |
| 0982-minimum-increment-to-make-array-unique |
| 1217-relative-sort-array |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0853-most-profit-assigning-work |
| 0594-longest-harmonious-subsequence |
| 0900-reordered-power-of-2 |
| 3276-minimum-number-of-pushes-to-type-word-ii |
| 3360-minimum-deletions-to-make-string-k-special |
| 0037-sudoku-solver |
| 0039-combination-sum |
| 0040-combination-sum-ii |
| 0037-sudoku-solver |
| 1628-count-submatrices-with-all-ones |
| 2132-convert-1d-array-into-2d-array |
| 2794-maximum-number-of-moves-in-a-grid |
| 0906-walking-robot-simulation |
| 2006-find-the-student-that-will-replace-the-chalk |
| 2132-convert-1d-array-into-2d-array |
| 3790-fruits-into-baskets-ii |
| 1435-xor-queries-of-a-subarray |
| 2044-number-of-wonderful-substrings |
| 2503-longest-subarray-with-maximum-bitwise-and |
| 2503-longest-subarray-with-maximum-bitwise-and |
| 0080-remove-duplicates-from-sorted-array-ii |
| 0088-merge-sorted-array |
| 0295-find-median-from-data-stream |
| 2095-minimum-number-of-swaps-to-make-the-string-balanced |
| 0274-h-index |
| 0144-binary-tree-preorder-traversal |
| 1628-count-submatrices-with-all-ones |
| 2095-minimum-number-of-swaps-to-make-the-string-balanced |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0144-binary-tree-preorder-traversal |
| 0543-diameter-of-binary-tree |
| 2646-kth-largest-sum-in-a-binary-tree |
| 0104-maximum-depth-of-binary-tree |
| 2646-kth-largest-sum-in-a-binary-tree |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0144-binary-tree-preorder-traversal |
| 0543-diameter-of-binary-tree |
| 2646-kth-largest-sum-in-a-binary-tree |
| 0539-minimum-time-difference |
| 0900-reordered-power-of-2 |
| 1411-convert-binary-number-in-a-linked-list-to-integer |
| 2998-count-symmetric-integers |
| 3279-alice-and-bob-playing-flower-game |
| 0900-reordered-power-of-2 |
| 2998-count-symmetric-integers |
| 0128-longest-consecutive-sequence |
| 0076-minimum-window-substring |
| 0438-find-all-anagrams-in-a-string |
| 0594-longest-harmonious-subsequence |
| 1586-longest-subarray-of-1s-after-deleting-one-element |
| 1813-maximum-erasure-value |
| 0215-kth-largest-element-in-an-array |
| 0215-kth-largest-element-in-an-array |
| 0295-find-median-from-data-stream |
| 0902-minimum-number-of-refueling-stops |
| 1917-maximum-average-pass-ratio |
| 2204-find-subsequence-of-length-k-with-the-largest-sum |
| 0215-kth-largest-element-in-an-array |
| 0295-find-median-from-data-stream |
| 0295-find-median-from-data-stream |
| 1411-convert-binary-number-in-a-linked-list-to-integer |
| 3790-fruits-into-baskets-ii |
| 3790-fruits-into-baskets-ii |
| 0104-maximum-depth-of-binary-tree |
| 0110-balanced-binary-tree |
| 0144-binary-tree-preorder-traversal |
| 0543-diameter-of-binary-tree |
| 1628-count-submatrices-with-all-ones |