Update: deleting notes for now
This commit is contained in:
2
.gitignore
vendored
2
.gitignore
vendored
@@ -1,6 +1,8 @@
|
||||
# Created by https://www.toptal.com/developers/gitignore/api/node,java,python,c++
|
||||
# Edit at https://www.toptal.com/developers/gitignore?templates=node,java,python,c++
|
||||
.cursor*
|
||||
*src/notes*
|
||||
./src/notes/
|
||||
*sync_leetcode.sh
|
||||
### C++ ###
|
||||
# Prerequisites
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
from string import *
|
||||
from re import *
|
||||
from datetime import *
|
||||
erom datetime import *
|
||||
from collections import *
|
||||
from heapq import *
|
||||
from bisect import *
|
||||
@@ -50,6 +50,8 @@ class Solution:
|
||||
if complement in hash_map:
|
||||
return [i, hash_map[complement]]
|
||||
hash_map[nums[i]] = i
|
||||
|
||||
|
||||
|
||||
return arr
|
||||
|
||||
|
||||
@@ -44,5 +44,14 @@ from typing import *
|
||||
|
||||
class Solution:
|
||||
def hasCycle(self, head: Optional[ListNode]) -> bool:
|
||||
m, n = head, head
|
||||
while n and n.next:
|
||||
m = m.next
|
||||
n = n.next.next
|
||||
if m == n:
|
||||
return True
|
||||
return False
|
||||
|
||||
|
||||
|
||||
# @leet end
|
||||
# @leet end
|
||||
|
||||
@@ -41,18 +41,16 @@ from typing import *
|
||||
# self.val = val
|
||||
# self.next = next
|
||||
class Solution:
|
||||
def node(self, val, next=None):
|
||||
def node(self, val, next = None):
|
||||
self.val = val
|
||||
self.next = next
|
||||
|
||||
def addTwoNumbers(
|
||||
self, l1: Optional[ListNode], l2: Optional[ListNode]
|
||||
) -> Optional[ListNode]:
|
||||
def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
|
||||
carry = 0
|
||||
value_l1 = l1
|
||||
value_l2 = l2
|
||||
head = None
|
||||
tail = None
|
||||
tail = None
|
||||
while value_l1 or value_l2:
|
||||
l2_val = l2.val if l2 else 0
|
||||
l1_val = l1.val if l1 else 0
|
||||
@@ -80,6 +78,4 @@ class Solution:
|
||||
tail = new_node
|
||||
|
||||
return head
|
||||
|
||||
|
||||
# @leet end
|
||||
|
||||
@@ -43,16 +43,12 @@ class Solution:
|
||||
while j < len(s):
|
||||
if s[j] not in window:
|
||||
window[s[j]] = 1
|
||||
max_char = (
|
||||
len(window.keys()) if max_char < len(window.keys()) else max_char
|
||||
)
|
||||
max_char = len(window.keys()) if max_char < len(window.keys()) else max_char
|
||||
j += 1
|
||||
elif s[j] in window:
|
||||
del window[s[i]]
|
||||
i += 1
|
||||
|
||||
|
||||
return max_char
|
||||
|
||||
|
||||
# @leet end
|
||||
|
||||
|
||||
@@ -1,3 +1,40 @@
|
||||
from string import *
|
||||
from re import *
|
||||
from datetime import *
|
||||
from collections import *
|
||||
from heapq import *
|
||||
from bisect import *
|
||||
from copy import *
|
||||
from math import *
|
||||
from random import *
|
||||
from statistics import *
|
||||
from itertools import *
|
||||
from functools import *
|
||||
from operator import *
|
||||
from io import *
|
||||
from sys import *
|
||||
from json import *
|
||||
from builtins import *
|
||||
import string
|
||||
import re
|
||||
import datetime
|
||||
import collections
|
||||
import heapq
|
||||
import bisect
|
||||
import copy
|
||||
import math
|
||||
import random
|
||||
import statistics
|
||||
import itertools
|
||||
import functools
|
||||
import operator
|
||||
import io
|
||||
import sys
|
||||
import json
|
||||
from typing import *
|
||||
|
||||
|
||||
# @leet start
|
||||
class Solution:
|
||||
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
|
||||
N1, N2 = nums1, nums2
|
||||
@@ -28,3 +65,5 @@ class Solution:
|
||||
h = midA - 1
|
||||
else:
|
||||
l = midA + 1
|
||||
|
||||
# @leet end
|
||||
|
||||
@@ -1,22 +0,0 @@
|
||||
# Two Sum
|
||||
|
||||
**Problem Number:** 1
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Add Two Numbers
|
||||
|
||||
**Problem Number:** 2
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Longest Substring Without Repeating Characters
|
||||
|
||||
**Problem Number:** 3
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Median of Two Sorted Arrays
|
||||
|
||||
**Problem Number:** 4
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Longest Palindromic Substring
|
||||
|
||||
**Problem Number:** 5
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Zigzag Conversion
|
||||
|
||||
**Problem Number:** 6
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Reverse Integer
|
||||
|
||||
**Problem Number:** 7
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Palindrome Number
|
||||
|
||||
**Problem Number:** 9
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Regular Expression Matching
|
||||
|
||||
**Problem Number:** 10
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Container With Most Water
|
||||
|
||||
**Problem Number:** 11
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Roman to Integer
|
||||
|
||||
**Problem Number:** 13
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Longest Common Prefix
|
||||
|
||||
**Problem Number:** 14
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# 3Sum
|
||||
|
||||
**Problem Number:** 15
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Valid Parentheses
|
||||
|
||||
**Problem Number:** 20
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Merge Two Sorted Lists
|
||||
|
||||
**Problem Number:** 21
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Generate Parentheses
|
||||
|
||||
**Problem Number:** 22
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Find the Index of the First Occurrence in a String
|
||||
|
||||
**Problem Number:** 28
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Search Insert Position
|
||||
|
||||
**Problem Number:** 35
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Valid Sudoku
|
||||
|
||||
**Problem Number:** 36
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Trapping Rain Water
|
||||
|
||||
**Problem Number:** 42
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Jump Game II
|
||||
|
||||
**Problem Number:** 45
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Pow(x, n)
|
||||
|
||||
**Problem Number:** 50
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Jump Game
|
||||
|
||||
**Problem Number:** 55
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Plus One
|
||||
|
||||
**Problem Number:** 66
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Sqrt(x)
|
||||
|
||||
**Problem Number:** 69
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Search a 2D Matrix
|
||||
|
||||
**Problem Number:** 74
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Remove Duplicates from Sorted Array II
|
||||
|
||||
**Problem Number:** 80
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Merge Sorted Array
|
||||
|
||||
**Problem Number:** 88
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Gray Code
|
||||
|
||||
**Problem Number:** 89
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Subsets II
|
||||
|
||||
**Problem Number:** 90
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Decode Ways
|
||||
|
||||
**Problem Number:** 91
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Reverse Linked List II
|
||||
|
||||
**Problem Number:** 92
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Minimum Absolute Difference
|
||||
|
||||
**Problem Number:** 1200
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Best Time to Buy and Sell Stock
|
||||
|
||||
**Problem Number:** 121
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Best Time to Buy and Sell Stock II
|
||||
|
||||
**Problem Number:** 122
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Valid Palindrome
|
||||
|
||||
**Problem Number:** 125
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Longest Consecutive Sequence
|
||||
|
||||
**Problem Number:** 128
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Maximum Candies You Can Get from Boxes
|
||||
|
||||
**Problem Number:** 1298
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Candy
|
||||
|
||||
**Problem Number:** 135
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Linked List Cycle
|
||||
|
||||
**Problem Number:** 141
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Max Points on a Line
|
||||
|
||||
**Problem Number:** 149
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Evaluate Reverse Polish Notation
|
||||
|
||||
**Problem Number:** 150
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Find Minimum in Rotated Sorted Array
|
||||
|
||||
**Problem Number:** 153
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Min Stack
|
||||
|
||||
**Problem Number:** 155
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Two Sum II - Input Array Is Sorted
|
||||
|
||||
**Problem Number:** 167
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,32 +0,0 @@
|
||||
# two sum ii input array is sorted
|
||||
|
||||
[](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
|
||||
[](https://leetcode.com/problemset/?difficulty=MEDIUM)
|
||||
[](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
|
||||
|
||||
**Problem Number:** [167](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
|
||||
**Difficulty:** [Medium](https://leetcode.com/problemset/?difficulty=MEDIUM)(https://leetcode.com/problemset/?difficulty=MEDIUM)
|
||||
**Category:**
|
||||
**LeetCode Link:** [https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
|
||||
|
||||
## Problem Description
|
||||
|
||||
> **View the full problem description on LeetCode:** [two sum ii input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
|
||||
[](../../README.md#-problem-index) | [](../exercises/167.two-sum-ii-input-array-is-sorted.py)
|
||||
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Majority Element
|
||||
|
||||
**Problem Number:** 169
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Factorial Trailing Zeroes
|
||||
|
||||
**Problem Number:** 172
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Maximum Number of Accepted Invitations
|
||||
|
||||
**Problem Number:** 1820
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Rotate Array
|
||||
|
||||
**Problem Number:** 189
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Happy Number
|
||||
|
||||
**Problem Number:** 202
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Kth Smallest Product of Two Sorted Arrays
|
||||
|
||||
**Problem Number:** 2040
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Kth Distinct String in an Array
|
||||
|
||||
**Problem Number:** 2053
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Isomorphic Strings
|
||||
|
||||
**Problem Number:** 205
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Reverse Linked List
|
||||
|
||||
**Problem Number:** 206
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Check if a Parentheses String Can Be Valid
|
||||
|
||||
**Problem Number:** 2116
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Contains Duplicate
|
||||
|
||||
**Problem Number:** 217
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Contains Duplicate II
|
||||
|
||||
**Problem Number:** 219
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Summary Ranges
|
||||
|
||||
**Problem Number:** 228
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Partition Array Such That Maximum Difference Is K
|
||||
|
||||
**Problem Number:** 2294
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Product of Array Except Self
|
||||
|
||||
**Problem Number:** 238
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Valid Anagram
|
||||
|
||||
**Problem Number:** 242
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Shortest Word Distance
|
||||
|
||||
**Problem Number:** 243
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Largest Positive Integer That Exists With Its Negative
|
||||
|
||||
**Problem Number:** 2441
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Shortest Word Distance II
|
||||
|
||||
**Problem Number:** 244
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Shortest Word Distance III
|
||||
|
||||
**Problem Number:** 245
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Strobogrammatic Number
|
||||
|
||||
**Problem Number:** 246
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Strobogrammatic Number III
|
||||
|
||||
**Problem Number:** 248
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Minimize the Maximum Difference of Pairs
|
||||
|
||||
**Problem Number:** 2616
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Word Pattern
|
||||
|
||||
**Problem Number:** 290
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Divide Array Into Arrays With Max Difference
|
||||
|
||||
**Problem Number:** 2966
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Maximum Difference Between Even and Odd Frequency I
|
||||
|
||||
**Problem Number:** 3442
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Maximum Difference Between Even and Odd Frequency II
|
||||
|
||||
**Problem Number:** 3445
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Ransom Note
|
||||
|
||||
**Problem Number:** 383
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Is Subsequence
|
||||
|
||||
**Problem Number:** 392
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Binary Search
|
||||
|
||||
**Problem Number:** 704
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Koko Eating Bananas
|
||||
|
||||
**Problem Number:** 875
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -1,22 +0,0 @@
|
||||
# Satisfiability of Equality Equations
|
||||
|
||||
**Problem Number:** 990
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
Reference in New Issue
Block a user