Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

226 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Math

0007-reverse-integer
0012-integer-to-roman
0029-divide-two-integers
0168-excel-sheet-column-title
0171-excel-sheet-column-number
0628-maximum-product-of-three-numbers
0633-sum-of-square-numbers
1979-find-greatest-common-divisor-of-array
2769-find-the-maximum-achievable-number
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3512-minimum-operations-to-make-array-sum-divisible-by-k
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3518-smallest-palindromic-rearrangement-ii
3536-maximum-product-of-two-digits
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Array

0018-4sum
0053-maximum-subarray
0075-sort-colors
0628-maximum-product-of-three-numbers
0674-longest-continuous-increasing-subsequence
0697-degree-of-an-array
0704-binary-search
0744-find-smallest-letter-greater-than-target
1260-shift-2d-grid
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3501-maximize-active-section-with-trade-ii
3512-minimum-operations-to-make-array-sum-divisible-by-k
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3739-count-subarrays-with-majority-element-ii
3867-sum-of-gcd-of-formed-pairs
3898-find-the-degree-of-each-vertex
3925-concatenate-array-with-reverse

Hash Table

0012-integer-to-roman
0697-degree-of-an-array
1331-rank-transform-of-an-array
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii
3532-path-existence-queries-in-a-graph-i
3739-count-subarrays-with-majority-element-ii

Binary Search

0633-sum-of-square-numbers
0704-binary-search
0744-find-smallest-letter-greater-than-target
3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii

Union-Find

2685-count-the-number-of-complete-components
3532-path-existence-queries-in-a-graph-i

Graph Theory

2685-count-the-number-of-complete-components
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3898-find-the-degree-of-each-vertex

Two Pointers

0018-4sum
0075-sort-colors
0344-reverse-string
0633-sum-of-square-numbers
3534-path-existence-queries-in-a-graph-ii
3867-sum-of-gcd-of-formed-pairs

Dynamic Programming

0053-maximum-subarray
3336-find-the-number-of-subsequences-with-equal-gcd
3534-path-existence-queries-in-a-graph-ii

Greedy

1081-smallest-subsequence-of-distinct-characters
1846-maximum-element-after-decreasing-and-rearranging
3534-path-existence-queries-in-a-graph-ii

Bit Manipulation

0029-divide-two-integers
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3534-path-existence-queries-in-a-graph-ii

Sorting

0018-4sum
0075-sort-colors
0628-maximum-product-of-three-numbers
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
3517-smallest-palindromic-rearrangement-i
3534-path-existence-queries-in-a-graph-ii
3536-maximum-product-of-two-digits
3867-sum-of-gcd-of-formed-pairs

String

0012-integer-to-roman
0168-excel-sheet-column-title
0171-excel-sheet-column-number
0344-reverse-string
1081-smallest-subsequence-of-distinct-characters
3499-maximize-active-section-with-trade-i
3501-maximize-active-section-with-trade-ii
3517-smallest-palindromic-rearrangement-i
3518-smallest-palindromic-rearrangement-ii

Depth-First Search

2685-count-the-number-of-complete-components

Breadth-First Search

2685-count-the-number-of-complete-components

Enumeration

1291-sequential-digits
3499-maximize-active-section-with-trade-i
3514-number-of-unique-xor-triplets-ii

Number Theory

1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Simulation

1260-shift-2d-grid
3867-sum-of-gcd-of-formed-pairs
3925-concatenate-array-with-reverse

Combinatorics

3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

Counting

3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

Prefix Sum

3312-sorted-gcd-pair-queries
3739-count-subarrays-with-majority-element-ii

Divide and Conquer

0053-maximum-subarray
3739-count-subarrays-with-majority-element-ii

Stack

1081-smallest-subsequence-of-distinct-characters

Monotonic Stack

1081-smallest-subsequence-of-distinct-characters

Matrix

1260-shift-2d-grid
3898-find-the-degree-of-each-vertex

Segment Tree

3501-maximize-active-section-with-trade-ii
3739-count-subarrays-with-majority-element-ii

Merge Sort

3739-count-subarrays-with-majority-element-ii

Heap (Priority Queue)

1464-maximum-product-of-two-elements-in-an-array

Counting Sort

3517-smallest-palindromic-rearrangement-i

About

My Data Structures & Algorithms solutions from LeetCode, solved primarily in C++.

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages