Here I am sharing my solution of Leetcode Problems.
0014-longest-common-prefix |
3309-count-prefix-and-suffix-pairs-i |
0070-climbing-stairs |
1013-fibonacci-number |
1680-count-all-possible-routes |
0004-median-of-two-sorted-arrays |
0023-merge-k-sorted-lists |
0108-convert-sorted-array-to-binary-search-tree |
0169-majority-element |
0190-reverse-bits |
0191-number-of-1-bits |
0108-convert-sorted-array-to-binary-search-tree |
0501-find-mode-in-binary-search-tree |
0175-combine-two-tables |
0181-employees-earning-more-than-their-managers |
0146-lru-cache |
0225-implement-stack-using-queues |
0816-design-hashset |
0817-design-hashmap |
2389-design-a-text-editor |
2678-design-graph-with-shortest-path-calculator |
0225-implement-stack-using-queues |
2868-continuous-subarrays |
0572-subtree-of-another-tree |
0816-design-hashset |
0817-design-hashmap |
3309-count-prefix-and-suffix-pairs-i |
0051-n-queens |
0257-binary-tree-paths |
0401-binary-watch |
0494-target-sum |
2107-find-unique-binary-string |
0496-next-greater-element-i |
0780-max-chunks-to-make-sorted |
1570-final-prices-with-a-special-discount-in-a-shop |
3181-find-building-where-alice-and-bob-can-meet |
1349-check-if-it-is-a-straight-line |
0561-array-partition |
1137-height-checker |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
2678-design-graph-with-shortest-path-calculator |
0278-first-bad-version |
0146-lru-cache |
0766-flatten-a-multilevel-doubly-linked-list |
2389-design-a-text-editor |
0023-merge-k-sorted-lists |
2868-continuous-subarrays |
2868-continuous-subarrays |
3181-find-building-where-alice-and-bob-can-meet |
3181-find-building-where-alice-and-bob-can-meet |
3309-count-prefix-and-suffix-pairs-i |
2533-bitwise-xor-of-all-pairings |
0684-redundant-connection |
1396-count-servers-that-communicate |
2764-maximum-number-of-fish-in-a-grid |
3219-make-lexicographically-smallest-array-by-swapping-elements |
0820-find-eventual-safe-states |
1558-course-schedule-iv |
2246-maximum-employees-to-be-invited-to-a-meeting |