Python-Problems

LeetCode Topics

Array

0474-ones-and-zeroes
0717-1-bit-and-2-bit-characters
0759-set-intersection-size-at-least-two
1548-check-if-all-1s-are-at-least-length-k-places-away
1700-minimum-time-to-make-rope-colorful
2058-concatenation-of-array
2274-keep-multiplying-found-values-by-two
2618-maximize-the-minimum-powered-city
2625-increment-submatrices-by-one
2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1
3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i
3834-minimum-operations-to-convert-all-elements-to-zero
3863-power-grid-maintenance

String

0474-ones-and-zeroes
1636-number-of-substrings-with-only-1s
1700-minimum-time-to-make-rope-colorful
1747-lexicographically-smallest-string-after-applying-operations
2059-unique-length-3-palindromic-subsequences
3233-maximize-the-number-of-partitions-after-operations
3479-count-the-number-of-substrings-with-dominant-ones
3493-maximum-number-of-operations-to-move-ones-to-the-end

Dynamic Programming

0474-ones-and-zeroes
1700-minimum-time-to-make-rope-colorful
1732-minimum-one-bit-operations-to-make-integers-zero
3233-maximize-the-number-of-partitions-after-operations

Greedy

0759-set-intersection-size-at-least-two
1700-minimum-time-to-make-rope-colorful
2618-maximize-the-minimum-powered-city
3493-maximum-number-of-operations-to-move-ones-to-the-end
3834-minimum-operations-to-convert-all-elements-to-zero

Depth-First Search

1747-lexicographically-smallest-string-after-applying-operations
3863-power-grid-maintenance

Breadth-First Search

1747-lexicographically-smallest-string-after-applying-operations
3863-power-grid-maintenance

Enumeration

1747-lexicographically-smallest-string-after-applying-operations
3479-count-the-number-of-substrings-with-dominant-ones

Bit Manipulation

1732-minimum-one-bit-operations-to-make-integers-zero
2059-unique-length-3-palindromic-subsequences
3233-maximize-the-number-of-partitions-after-operations

Bitmask

3233-maximize-the-number-of-partitions-after-operations

Hash Table

2059-unique-length-3-palindromic-subsequences
2274-keep-multiplying-found-values-by-two
3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i
3834-minimum-operations-to-convert-all-elements-to-zero
3863-power-grid-maintenance

Sliding Window

2618-maximize-the-minimum-powered-city
3479-count-the-number-of-substrings-with-dominant-ones
3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i

Heap (Priority Queue)

3592-find-x-sum-of-all-k-long-subarrays-ii
3610-find-x-sum-of-all-k-long-subarrays-i
3863-power-grid-maintenance

Union Find

3863-power-grid-maintenance

Graph

3863-power-grid-maintenance

Ordered Set

3863-power-grid-maintenance

Binary Search

2618-maximize-the-minimum-powered-city

Queue

2618-maximize-the-minimum-powered-city

Prefix Sum

2059-unique-length-3-palindromic-subsequences
2618-maximize-the-minimum-powered-city
2625-increment-submatrices-by-one

Memoization

1732-minimum-one-bit-operations-to-make-integers-zero

Math

1636-number-of-substrings-with-only-1s
2288-count-operations-to-obtain-zero
2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1

Simulation

2058-concatenation-of-array
2274-keep-multiplying-found-values-by-two
2288-count-operations-to-obtain-zero

Stack

3834-minimum-operations-to-convert-all-elements-to-zero

Monotonic Stack

3834-minimum-operations-to-convert-all-elements-to-zero

Number Theory

2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1

Counting

3493-maximum-number-of-operations-to-move-ones-to-the-end

Matrix

2625-increment-submatrices-by-one

Sorting

0759-set-intersection-size-at-least-two
2274-keep-multiplying-found-values-by-two