https://github.com/darkmatter18/leetcode

Practicing Code, killing time. My Leetcode Solutions. Don't copy, try yourself.
https://github.com/darkmatter18/leetcode

competitive-programming leetcode leetcode-solutions

Last synced: 4 months ago
JSON representation

Practicing Code, killing time. My Leetcode Solutions. Don't copy, try yourself.

• Host: GitHub
• URL: https://github.com/darkmatter18/leetcode
• Owner: darkmatter18
• Created: 2022-10-10T08:15:57.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2025-01-08T15:25:24.000Z (9 months ago)
• Last Synced: 2025-03-31T05:09:27.452Z (6 months ago)
• Topics: competitive-programming, leetcode, leetcode-solutions
• Language: C++
• Homepage:
• Size: 571 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# My Leetcode solution

I don't know why.......... But I am doing it.

![forthebadge](https://forthebadge.com/images/badges/uses-badges.svg)![forthebadge](https://forthebadge.com/images/badges/built-by-developers.svg)![forthebadge](https://forthebadge.com/images/badges/contains-17-coffee-cups.svg)![forthebadge](https://forthebadge.com/images/badges/ctrl-c-ctrl-v.svg)![forthebadge](https://forthebadge.com/images/badges/for-robots.svg)

## Don't ask how, Just remember it ![forthebadge](https://forthebadge.com/images/badges/works-on-my-machine.svg).

[![forthebadge](https://forthebadge.com/images/badges/no-ragrets.svg)](https://forthebadge.com)

# LeetCode Topics

## Array

|  |

| ------- |

| [0001-two-sum](https://github.com/darkmatter18/leetcode/tree/master/0001-two-sum) |

| [0039-combination-sum](https://github.com/darkmatter18/leetcode/tree/master/0039-combination-sum) |

| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |

| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |

| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |

| [0238-product-of-array-except-self](https://github.com/darkmatter18/leetcode/tree/master/0238-product-of-array-except-self) |

| [0747-min-cost-climbing-stairs](https://github.com/darkmatter18/leetcode/tree/master/0747-min-cost-climbing-stairs) |

| [2358-number-of-ways-to-split-array](https://github.com/darkmatter18/leetcode/tree/master/2358-number-of-ways-to-split-array) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Prefix Sum

|  |

| ------- |

| [0238-product-of-array-except-self](https://github.com/darkmatter18/leetcode/tree/master/0238-product-of-array-except-self) |

| [2358-number-of-ways-to-split-array](https://github.com/darkmatter18/leetcode/tree/master/2358-number-of-ways-to-split-array) |

## Hash Table

|  |

| ------- |

| [0001-two-sum](https://github.com/darkmatter18/leetcode/tree/master/0001-two-sum) |

| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |

## Union Find

|  |

| ------- |

| [0128-longest-consecutive-sequence](https://github.com/darkmatter18/leetcode/tree/master/0128-longest-consecutive-sequence) |

## Math

|  |

| ------- |

| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |

## Stack

|  |

| ------- |

| [0150-evaluate-reverse-polish-notation](https://github.com/darkmatter18/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |

## Tree

|  |

| ------- |

| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |

| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |

| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |

| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |

| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |

| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |

## Depth-First Search

|  |

| ------- |

| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |

| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |

| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |

| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |

| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |

| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |

## Breadth-First Search

|  |

| ------- |

| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |

| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |

| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |

## Binary Tree

|  |

| ------- |

| [0100-same-tree](https://github.com/darkmatter18/leetcode/tree/master/0100-same-tree) |

| [0104-maximum-depth-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |

| [0110-balanced-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0110-balanced-binary-tree) |

| [0226-invert-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0226-invert-binary-tree) |

| [0543-diameter-of-binary-tree](https://github.com/darkmatter18/leetcode/tree/master/0543-diameter-of-binary-tree) |

| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |

## String Matching

|  |

| ------- |

| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Hash Function

|  |

| ------- |

| [0572-subtree-of-another-tree](https://github.com/darkmatter18/leetcode/tree/master/0572-subtree-of-another-tree) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Backtracking

|  |

| ------- |

| [0039-combination-sum](https://github.com/darkmatter18/leetcode/tree/master/0039-combination-sum) |

| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |

## Bit Manipulation

|  |

| ------- |

| [0078-subsets](https://github.com/darkmatter18/leetcode/tree/master/0078-subsets) |

## Dynamic Programming

|  |

| ------- |

| [0747-min-cost-climbing-stairs](https://github.com/darkmatter18/leetcode/tree/master/0747-min-cost-climbing-stairs) |

## Trie

|  |

| ------- |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Rolling Hash

|  |

| ------- |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/darkmatter18/leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |