Skip to content

Suraj-1250/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

leetcode

Daily Problem of the Day

LeetCode Topics

String

0010-regular-expression-matching
2221-check-if-a-parentheses-string-can-be-valid
2463-minimum-recolors-to-get-k-consecutive-black-blocks
3455-minimum-length-of-string-after-operations

Stack

2221-check-if-a-parentheses-string-can-be-valid

Greedy

1448-maximum-69-number
2221-check-if-a-parentheses-string-can-be-valid
2509-minimize-xor

Dynamic Programming

0010-regular-expression-matching
0121-best-time-to-buy-and-sell-stock
1402-count-square-submatrices-with-all-ones

Recursion

0010-regular-expression-matching
0050-powx-n

Hash Table

2473-max-sum-of-a-pair-with-equal-sum-of-digits
2766-find-the-prefix-common-array-of-two-arrays
3455-minimum-length-of-string-after-operations

Counting

3455-minimum-length-of-string-after-operations

Array

0121-best-time-to-buy-and-sell-stock
0238-product-of-array-except-self
0882-peak-index-in-a-mountain-array
1402-count-square-submatrices-with-all-ones
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1927-maximum-ascending-subarray-sum
2265-partition-array-according-to-given-pivot
2473-max-sum-of-a-pair-with-equal-sum-of-digits
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
3332-minimum-operations-to-exceed-threshold-value-ii

Bit Manipulation

2509-minimize-xor
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor

Math

0050-powx-n
1448-maximum-69-number
1889-check-if-number-is-a-sum-of-powers-of-three
2610-closest-prime-numbers-in-range
2649-count-total-number-of-colored-cells

Prefix Sum

0238-product-of-array-except-self

Brainteaser

2533-bitwise-xor-of-all-pairings

Breadth-First Search

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Graph

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Heap (Priority Queue)

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2473-max-sum-of-a-pair-with-equal-sum-of-digits
3332-minimum-operations-to-exceed-threshold-value-ii

Matrix

1402-count-square-submatrices-with-all-ones
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Shortest Path

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

Linked List

0019-remove-nth-node-from-end-of-list

Two Pointers

0019-remove-nth-node-from-end-of-list
2265-partition-array-according-to-given-pivot

Sorting

2473-max-sum-of-a-pair-with-equal-sum-of-digits

Simulation

2265-partition-array-according-to-given-pivot
3332-minimum-operations-to-exceed-threshold-value-ii

Binary Search

0882-peak-index-in-a-mountain-array

Number Theory

2610-closest-prime-numbers-in-range

Sliding Window

2463-minimum-recolors-to-get-k-consecutive-black-blocks

About

Daily Problem of the Day

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages