- AkashKobal/leet-code-python: Mastering LeetCode: A comprehensive collection of solved LeetCode challenges along with detailed solutions, showcasing proficiency in algorithmic problem-solving.

Question	Leetcode	Level	Topic
Concatenation of Array	Leetcode	$${\color{green}Easy}$$	Array
Find All Duplicates in an Array	Leetcode	$${\color{orange}Medium}$$	Array
Find the Highest Altitude	Leetcode	$${\color{green}Easy}$$	Array
Matrix Diagonal Sum	Leetcode	$${\color{green}Easy}$$	Array, Matrix
Maximum Product Difference Between Two Pairs	Leetcode	$${\color{green}Easy}$$	Array, Sorting
Middle of the Linked List	Leetcode	$${\color{green}Easy}$$	-------------
Palindrome Number	Leetcode	$${\color{green}Easy}$$	-------------
Reverse Linked List	Leetcode	$${\color{green}Easy}$$	-------------
Roman to Integer	Leetcode	$${\color{green}Easy}$$	-------------
Rotate Image	Leetcode	$${\color{orange}Medium}$$	-------------
Running Sum of 1d Array	Leetcode	$${\color{green}Easy}$$	-------------
Two Sum	Leetcode	$${\color{green}Easy}$$	-------------
Add Two Numbers	Leetcode	$${\color{orange}Medium}$$	Linked List, Math, Recursion
Sum of Digits of String After Convert	Leetcode	$${\color{green}Easy}$$	String

Name		Name	Last commit message	Last commit date
Latest commit History 725 Commits
3Sum		3Sum
Add-Two-Numbers		Add-Two-Numbers
Adding-Spaces-to-a-String		Adding-Spaces-to-a-String
All-O`one-Data-Structure		All-O`one-Data-Structure
Best-Sightseeing-Pair		Best-Sightseeing-Pair
Best-Time-to-Buy-and-Sell-Stock-II		Best-Time-to-Buy-and-Sell-Stock-II
Best-Time-to-Buy-and-Sell-Stock		Best-Time-to-Buy-and-Sell-Stock
Bitwise-XOR-of-All-Pairings		Bitwise-XOR-of-All-Pairings
Check-If-Array-Pairs-Are-Divisible-by-k		Check-If-Array-Pairs-Are-Divisible-by-k
Check-If-N-and-Its-Double-Exist		Check-If-N-and-Its-Double-Exist
Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence		Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence
Check-if-a-Parentheses-String-Can-Be-Valid		Check-if-a-Parentheses-String-Can-Be-Valid
Circular-Sentence		Circular-Sentence
Concatenation-of-Array		Concatenation-of-Array
Construct-K-Palindrome-Strings		Construct-K-Palindrome-Strings
Construct-String-With-Repeat-Limit		Construct-String-With-Repeat-Limit
Container-With-Most-Water		Container-With-Most-Water
Continuous-Subarrays		Continuous-Subarrays
Convert-1D-Array-Into-2D-Array		Convert-1D-Array-Into-2D-Array
Count-Number-of-Maximum-Bitwise-OR-Subsets		Count-Number-of-Maximum-Bitwise-OR-Subsets
Count-Prefix-and-Suffix-Pairs-I		Count-Prefix-and-Suffix-Pairs-I
Count-Servers-that-Communicate		Count-Servers-that-Communicate
Count-Square-Submatrices-with-All-Ones		Count-Square-Submatrices-with-All-Ones
Count-Unguarded-Cells-in-the-Grid		Count-Unguarded-Cells-in-the-Grid
Count-Vowel-Strings-in-Ranges		Count-Vowel-Strings-in-Ranges
Count-Ways-To-Build-Good-Strings		Count-Ways-To-Build-Good-Strings
Count-the-Number-of-Consistent-Strings		Count-the-Number-of-Consistent-Strings
Count-the-Number-of-Fair-Pairs		Count-the-Number-of-Fair-Pairs
Counting-Words-With-a-Given-Prefix		Counting-Words-With-a-Given-Prefix
Cousins-in-Binary-Tree-II		Cousins-in-Binary-Tree-II
Defuse-the-Bomb		Defuse-the-Bomb
Delete-Characters-to-Make-Fancy-String		Delete-Characters-to-Make-Fancy-String
Delete-Nodes-From-Linked-List-Present-in-Array		Delete-Nodes-From-Linked-List-Present-in-Array
Design-Circular-Deque		Design-Circular-Deque
Design-a-Stack-With-Increment-Operation		Design-a-Stack-With-Increment-Operation
Different-Ways-to-Add-Parentheses		Different-Ways-to-Add-Parentheses
Divide-Intervals-Into-Minimum-Number-of-Groups		Divide-Intervals-Into-Minimum-Number-of-Groups
Divide-Players-Into-Teams-of-Equal-Skill		Divide-Players-Into-Teams-of-Equal-Skill
Extra-Characters-in-a-String		Extra-Characters-in-a-String
Fibonacci-Number		Fibonacci-Number
Final-Array-State-After-K-Multiplication-Operations-I		Final-Array-State-After-K-Multiplication-Operations-I
Final-Prices-With-a-Special-Discount-in-a-Shop		Final-Prices-With-a-Special-Discount-in-a-Shop
Find-All-Duplicates-in-an-Array		Find-All-Duplicates-in-an-Array
Find-Building-Where-Alice-and-Bob-Can-Meet		Find-Building-Where-Alice-and-Bob-Can-Meet
Find-Champion-II		Find-Champion-II
Find-Eventual-Safe-States		Find-Eventual-Safe-States
Find-Kth-Bit-in-Nth-Binary-String		Find-Kth-Bit-in-Nth-Binary-String
Find-Largest-Value-in-Each-Tree-Row		Find-Largest-Value-in-Each-Tree-Row
Find-Longest-Special-Substring-That-Occurs-Thrice-I		Find-Longest-Special-Substring-That-Occurs-Thrice-I
Find-Minimum-Diameter-After-Merging-Two-Trees		Find-Minimum-Diameter-After-Merging-Two-Trees
Find-Missing-Observations		Find-Missing-Observations
Find-Score-of-an-Array-After-Marking-All-Elements		Find-Score-of-an-Array-After-Marking-All-Elements
Find-if-Array-Can-Be-Sorted		Find-if-Array-Can-Be-Sorted
Find-the-Highest-Altitude		Find-the-Highest-Altitude
Find-the-Length-of-the-Longest-Common-Prefix		Find-the-Length-of-the-Longest-Common-Prefix
Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts		Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts
Find-the-Power-of-K-Size-Subarrays-I		Find-the-Power-of-K-Size-Subarrays-I
Find-the-Prefix-Common-Array-of-Two-Arrays		Find-the-Prefix-Common-Array-of-Two-Arrays
Find-the-Student-that-Will-Replace-the-Chalk		Find-the-Student-that-Will-Replace-the-Chalk
First-Completely-Painted-Row-or-Column		First-Completely-Painted-Row-or-Column
Flip-Columns-For-Maximum-Number-of-Equal-Rows		Flip-Columns-For-Maximum-Number-of-Equal-Rows
Flip-Equivalent-Binary-Trees		Flip-Equivalent-Binary-Trees
Game-of-Life		Game-of-Life
Gas-Station		Gas-Station
Grid-Game		Grid-Game
H-Index		H-Index
Height-of-Binary-Tree-After-Subtree-Removal-Queries		Height-of-Binary-Tree-After-Subtree-Removal-Queries
Insert-Delete-GetRandom-O(1)		Insert-Delete-GetRandom-O(1)
Insert-Greatest-Common-Divisors-in-Linked-List		Insert-Greatest-Common-Divisors-in-Linked-List
Is-Subsequence		Is-Subsequence
Jump-Game-II		Jump-Game-II
Jump-Game		Jump-Game
K-th-Smallest-in-Lexicographical-Order		K-th-Smallest-in-Lexicographical-Order
Kth-Largest-Sum-in-a-Binary-Tree		Kth-Largest-Sum-in-a-Binary-Tree
Largest-Combination-With-Bitwise-AND-Greater-Than-Zero		Largest-Combination-With-Bitwise-AND-Greater-Than-Zero
Largest-Number		Largest-Number
LeetCode		LeetCode
Lexicographical-Numbers		Lexicographical-Numbers
Linked-List-in-Binary-Tree		Linked-List-in-Binary-Tree
Longest-Happy-String		Longest-Happy-String
Longest-Palindromic-Substring		Longest-Palindromic-Substring
Longest-Square-Streak-in-an-Array		Longest-Square-Streak-in-an-Array
Longest-Subarray-With-Maximum-Bitwise-AND		Longest-Subarray-With-Maximum-Bitwise-AND
Longest-Substring-Without-Repeating-Characters		Longest-Substring-Without-Repeating-Characters
Majority-Element		Majority-Element
Make-Lexicographically-Smallest-Array-by-Swapping-Elements		Make-Lexicographically-Smallest-Array-by-Swapping-Elements
Make-String-a-Subsequence-Using-Cyclic-Increments		Make-String-a-Subsequence-Using-Cyclic-Increments
Make-Sum-Divisible-by-P		Make-Sum-Divisible-by-P
Map-of-Highest-Peak		Map-of-Highest-Peak
Matrix-Diagonal-Sum		Matrix-Diagonal-Sum
Max-Chunks-To-Make-Sorted		Max-Chunks-To-Make-Sorted
Maximal-Score-After-Applying-K-Operations		Maximal-Score-After-Applying-K-Operations
Maximum-Average-Pass-Ratio		Maximum-Average-Pass-Ratio
Maximum-Beauty-of-an-Array-After-Applying-Operation		Maximum-Beauty-of-an-Array-After-Applying-Operation
Maximum-Matrix-Sum		Maximum-Matrix-Sum
Maximum-Number-of-Integers-to-Choose-From-a-Range-I		Maximum-Number-of-Integers-to-Choose-From-a-Range-I
Maximum-Number-of-K-Divisible-Components		Maximum-Number-of-K-Divisible-Components
Maximum-Number-of-Moves-in-a-Grid		Maximum-Number-of-Moves-in-a-Grid
Maximum-Product-Difference-Between-Two-Pairs		Maximum-Product-Difference-Between-Two-Pairs
Maximum-Score-After-Splitting-a-String		Maximum-Score-After-Splitting-a-String

Repository files navigation

About

Uh oh!

Releases

Packages

Languages

AkashKobal/leet-code-python

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

License

Code of conduct

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages