Skip to content

Latest commit

 

History

History

LeetCodeQuestions

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
0001-two-sum
0001-two-sum
 
 
0077-combinations
0077-combinations
 
 
0078-subsets
0078-subsets
 
 
33. Search in Rotated Sorted Array
33. Search in Rotated Sorted Array
 
 
50. Pow(x, n)
50. Pow(x, n)
 
 
557. Reverse Words in a String III
557. Reverse Words in a String III
 
 
74. Search a 2D Matrix
74. Search a 2D Matrix
 
 
75. Sort Colors
75. Sort Colors
 
 
77. Combinations
77. Combinations
 
 
easy_array_leetcode
easy_array_leetcode
 
 
0112.cpp
0112.cpp
 
 
0113.cpp
0113.cpp
 
 
11-container-with-most-water.py
11-container-with-most-water.py
 
 
123_pattern.cpp
123_pattern.cpp
 
 
15. 3sum.cpp
15. 3sum.cpp
 
 
2038-remove-colored-pieces-if-both-neighbors-are-same-color.py
2038-remove-colored-pieces-if-both-neighbors-are-same-color.py
 
 
236-Lowest_Common_Ancestor_of_a_Binary_Tree.cpp
236-Lowest_Common_Ancestor_of_a_Binary_Tree.cpp
 
 
2869.cpp
2869.cpp
 
 
2870.cpp
2870.cpp
 
 
2871.cpp
2871.cpp
 
 
2872.cpp
2872.cpp
 
 
2873.cpp
2873.cpp
 
 
31. Next Permutation.cpp
31. Next Permutation.cpp
 
 
7th October LeetCode Solution.cpp
7th October LeetCode Solution.cpp
 
 
901. OnlineStockSpan.cpp
901. OnlineStockSpan.cpp
 
 
987-Vertical_Order_Traversal_of_a_Binary_Tree.cpp
987-Vertical_Order_Traversal_of_a_Binary_Tree.cpp
 
 
Add Strings.cpp
Add Strings.cpp
 
 
BestTimeToBuyAndSellStockI.cpp
BestTimeToBuyAndSellStockI.cpp
 
 
BestTimeToBuyAndSellStockII.cpp
BestTimeToBuyAndSellStockII.cpp
 
 
BestTimeToBuyAndSellStockIII.cpp
BestTimeToBuyAndSellStockIII.cpp
 
 
BestTimeToBuyAndSellStockIV.cpp
BestTimeToBuyAndSellStockIV.cpp
 
 
BestTimeToBuyAndSellStockV.cpp
BestTimeToBuyAndSellStockV.cpp
 
 
BinaryTreeMaximumPathSum.cpp
BinaryTreeMaximumPathSum.cpp
 
 
CombinationSum4.cpp
CombinationSum4.cpp
 
 
Count Primes.cpp
Count Primes.cpp
 
 
CountWaysToBuildGoodString.cpp
CountWaysToBuildGoodString.cpp
 
 
EditDistance.cpp
EditDistance.cpp
 
 
FindMedianFromDataStream.cpp
FindMedianFromDataStream.cpp
 
 
Find_First_and_Last_Position_of_Element_in_Sorted_Array.cpp
Find_First_and_Last_Position_of_Element_in_Sorted_Array.cpp
 
 
Find_Peak_Element.cpp
Find_Peak_Element.cpp
 
 
GuessNumberHigherOrLower.cpp
GuessNumberHigherOrLower.cpp
 
 
HouseRobber.cpp
HouseRobber.cpp
 
 
HouseRobberIII.cpp
HouseRobberIII.cpp
 
 
ImplementQueueUsingStack.cpp
ImplementQueueUsingStack.cpp
 
 
ImplementStackUsingQueue.cpp
ImplementStackUsingQueue.cpp
 
 
JumpGame.cpp
JumpGame.cpp
 
 
Kadane'sAlgorithm.cpp
Kadane'sAlgorithm.cpp
 
 
LongestArithmeticSubsequence.cpp
LongestArithmeticSubsequence.cpp
 
 
LongestArithmeticSubsequencecOfGivenDifference.cpp
LongestArithmeticSubsequencecOfGivenDifference.cpp
 
 
LongestCommonSubsequence.cpp
LongestCommonSubsequence.cpp
 
 
LongestPalindromicSubsequence.cpp
LongestPalindromicSubsequence.cpp
 
 
MaximalRectangle.cpp
MaximalRectangle.cpp
 
 
MaximumHeightByStackingCuboids.cpp
MaximumHeightByStackingCuboids.cpp
 
 
MergeTwoSortedLinkedList.cpp
MergeTwoSortedLinkedList.cpp
 
 
MinCostClimbingStairs.cpp
MinCostClimbingStairs.cpp
 
 
MinStack.cpp
MinStack.cpp
 
 
MinimumAddToMakeParenthesisValid.cpp
MinimumAddToMakeParenthesisValid.cpp
 
 
MinimumCoinChange.cpp
MinimumCoinChange.cpp
 
 
MinimumCostForTickets.cpp
MinimumCostForTickets.cpp
 
 
MinimumScoreTriangulationOfPolygon.cpp
MinimumScoreTriangulationOfPolygon.cpp
 
 
MinimumSidewaysJumps.cpp
MinimumSidewaysJumps.cpp
 
 
MinimumSwapsToMakeSequencesIncreasing.cpp
MinimumSwapsToMakeSequencesIncreasing.cpp
 
 
NumberOfDiceRollsWithTargetSum.cpp
NumberOfDiceRollsWithTargetSum.cpp
 
 
PartitionEqualSubsetSum.cpp
PartitionEqualSubsetSum.cpp
 
 
PizzaWith3nSlices.cpp
PizzaWith3nSlices.cpp
 
 
README.md
README.md
 
 
ReducingDishes.cpp
ReducingDishes.cpp
 
 
Regular-Expression-Matching.cpp
Regular-Expression-Matching.cpp
 
 
Remove Duplicates from Sorted List.cpp
Remove Duplicates from Sorted List.cpp
 
 
Reverse words in a string III.py
Reverse words in a string III.py
 
 
ReverseInteger.cpp
ReverseInteger.cpp
 
 
Roman_To_int.cpp
Roman_To_int.cpp
 
 
Rotoate_Image.cpp
Rotoate_Image.cpp
 
 
RussianDolls.cpp
RussianDolls.cpp
 
 
Search_in_Rotated_Sorted_Array.cpp
Search_in_Rotated_Sorted_Array.cpp
 
 
SmallestRangeCoveringElementsFromKLists.cpp
SmallestRangeCoveringElementsFromKLists.cpp
 
 
SortColors.cpp
SortColors.cpp
 
 
TopologicalSort.cpp
TopologicalSort.cpp
 
 
Two_sum.cpp
Two_sum.cpp
 
 
UncrossedLines.cpp
UncrossedLines.cpp
 
 
UniqueBinarySearchTrees.cpp
UniqueBinarySearchTrees.cpp
 
 
WildCardMatching.cpp
WildCardMatching.cpp
 
 
add_digits.java
add_digits.java
 
 
contains_duplicate.py
contains_duplicate.py
 
 
length_of_lastword.py
length_of_lastword.py
 
 
letterCombinations.java
letterCombinations.java
 
 
minimum-ascii-delete-sum-for-two-strings.cpp
minimum-ascii-delete-sum-for-two-strings.cpp
 
 
paranthesis_matching_problem_stack.c
paranthesis_matching_problem_stack.c
 
 
remove_nth_node_from_end_of_linkedlist.cpp
remove_nth_node_from_end_of_linkedlist.cpp
 
 
roman_to_integer.py
roman_to_integer.py
 
 
valid_anagram.py
valid_anagram.py
 
 

README.md

LeetCode Questions

This folder contains solutions to various LeetCode coding problems. Each subfolder corresponds to a specific problem and contains the code solution along with explanations where necessary.

Table of Contents

  • [Problem 1: Title of Problem 1]

    • [Java Solution]
    • Explanation: Provide a brief explanation of the problem and your approach.

  • [Problem 2: Title of Problem 2]

    • [Java Solution]
    • Explanation: Describe the problem and how you solved it.

Getting Started

You can clone this repository and navigate to the specific problem folder to view the code and explanations. Each problem folder may contain multiple solutions in different programming languages.

cd LeetCodeQuestions/Problem1/