Skip to content

royalpranjal/LeetCode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

308 Commits
Algorithms
Algorithms
 
 
Database
Database
 
 
Coin Change.cpp
Coin Change.cpp
 
 
CombinationSum.cpp
CombinationSum.cpp
 
 
CombinationSumII.cpp
CombinationSumII.cpp
 
 
Combinations.cpp
Combinations.cpp
 
 
ComplexNumberMultiplication.cpp
ComplexNumberMultiplication.cpp
 
 
ConstructBinaryTreeFromInorderAndPostorderTraversal.cpp
ConstructBinaryTreeFromInorderAndPostorderTraversal.cpp
 
 
ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp
ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp
 
 
ConstructStringFromBinaryTree.cpp
ConstructStringFromBinaryTree.cpp
 
 
ConstructTheRectangle.cpp
ConstructTheRectangle.cpp
 
 
ContainerWithMostWater.cpp
ContainerWithMostWater.cpp
 
 
ContainsDuplicateII.cpp
ContainsDuplicateII.cpp
 
 
Contiguous Array.cpp
Contiguous Array.cpp
 
 
ContinuousSubarraySum.cpp
ContinuousSubarraySum.cpp
 
 
ConvertBSTToGreaterTree.cpp
ConvertBSTToGreaterTree.cpp
 
 
ConvertSortedArrayToBinarySearchTree.cpp
ConvertSortedArrayToBinarySearchTree.cpp
 
 
CountBinarySubstrings.cpp
CountBinarySubstrings.cpp
 
 
CountPrimes.cpp
CountPrimes.cpp
 
 
CountingBits.cpp
CountingBits.cpp
 
 
Daily Temperatures.cpp
Daily Temperatures.cpp
 
 
Decode String.cpp
Decode String.cpp
 
 
DecodeWaysII.cpp
DecodeWaysII.cpp
 
 
DegreeOfAnArray.cpp
DegreeOfAnArray.cpp
 
 
DeleteNodeInABST.cpp
DeleteNodeInABST.cpp
 
 
DeleteOperationForTwoStrings.cpp
DeleteOperationForTwoStrings.cpp
 
 
DesignCompressedStringIterator.cpp
DesignCompressedStringIterator.cpp
 
 
Detect Capital.cpp
Detect Capital.cpp
 
 
DiagonalTraverse.cpp
DiagonalTraverse.cpp
 
 
DiameterOfBinaryTree.cpp
DiameterOfBinaryTree.cpp
 
 
DistributeCandies.cpp
DistributeCandies.cpp
 
 
EmployeeImportance.cpp
EmployeeImportance.cpp
 
 
EqualTreePartition.cpp
EqualTreePartition.cpp
 
 
EvaluateReversePolishNotation.cpp
EvaluateReversePolishNotation.cpp
 
 
Find Anagram Mappings.cpp
Find Anagram Mappings.cpp
 
 
Find BottomLeftTreeValue.cpp
Find BottomLeftTreeValue.cpp
 
 
Find Pivot Index.cpp
Find Pivot Index.cpp
 
 
Find Smallest Letter Greater Than Target.cpp
Find Smallest Letter Greater Than Target.cpp
 
 
FindAllAnagramsInAString.cpp
FindAllAnagramsInAString.cpp
 
 
FindAllDuplicatesInAnArray.cpp
FindAllDuplicatesInAnArray.cpp
 
 
FindAllNumbersDisappearedInAnArray.cpp
FindAllNumbersDisappearedInAnArray.cpp
 
 
FindKClosestElements.cpp
FindKClosestElements.cpp
 
 
FindKPairsWithSmallestSums.cpp
FindKPairsWithSmallestSums.cpp
 
 
FindLargestValueInEachTreeRow.cpp
FindLargestValueInEachTreeRow.cpp
 
 
FindMinimumInRotatedSortedArray.cpp
FindMinimumInRotatedSortedArray.cpp
 
 
FindPeakElement.cpp
FindPeakElement.cpp
 
 
FindTheDifference.cpp
FindTheDifference.cpp
 
 
FindTheDuplicateNumber.cpp
FindTheDuplicateNumber.cpp
 
 
FirstBadVersion.cpp
FirstBadVersion.cpp
 
 
FirstMissingPositive.cpp
FirstMissingPositive.cpp
 
 
FirstUniqueCharacterInAString.cpp
FirstUniqueCharacterInAString.cpp
 
 
FizzBuzz.cpp
FizzBuzz.cpp
 
 
FlattenBinaryTreeToLinkedList.cpp
FlattenBinaryTreeToLinkedList.cpp
 
 
Flood Fill.cpp
Flood Fill.cpp
 
 
FractionAdditionAndSubtraction.cpp
FractionAdditionAndSubtraction.cpp
 
 
GenerateParentheses.cpp
GenerateParentheses.cpp
 
 
GroupAnagrams.cpp
GroupAnagrams.cpp
 
 
GuessNumberHigherOrLower.cpp
GuessNumberHigherOrLower.cpp
 
 
HammingDistance.cpp
HammingDistance.cpp
 
 
HappyNumber.cpp
HappyNumber.cpp
 
 
HouseRobber.cpp
HouseRobber.cpp
 
 
ImageSmoother.cpp
ImageSmoother.cpp
 
 
ImplementTrie(PrefixTree).cpp
ImplementTrie(PrefixTree).cpp
 
 
IntersectionOfTwoArrays.cpp
IntersectionOfTwoArrays.cpp
 
 
IsSubsequence.cpp
IsSubsequence.cpp
 
 
IslandPerimeter.cpp
IslandPerimeter.cpp
 
 
IsomorphicStrings.cpp
IsomorphicStrings.cpp
 
 
JudgeRouteCircle.cpp
JudgeRouteCircle.cpp
 
 
JumpGameII.cpp
JumpGameII.cpp
 
 
K-diffPairsInAnArray.cpp
K-diffPairsInAnArray.cpp
 
 
KeyboardRow.cpp
KeyboardRow.cpp
 
 
KthSmallestElementInaBST.cpp
KthSmallestElementInaBST.cpp
 
 
Largest Number Greater Than Twice of Others.cpp
Largest Number Greater Than Twice of Others.cpp
 
 
LetterCombinationsOfAPhoneNumber.cpp
LetterCombinationsOfAPhoneNumber.cpp
 
 
LinkedListCycleII.cpp
LinkedListCycleII.cpp
 
 
LonelyPixelI.cpp
LonelyPixelI.cpp
 
 
Longest Word in Dictionary.cpp
Longest Word in Dictionary.cpp
 
 
LongestCommonPrefix.cpp
LongestCommonPrefix.cpp
 
 
LongestContinuousIncreasingSubsequence.cpp
LongestContinuousIncreasingSubsequence.cpp
 
 
LongestHarmoniousSubsequence.cpp
LongestHarmoniousSubsequence.cpp
 
 
LongestPalindrome.cpp
LongestPalindrome.cpp
 
 
LongestSubstringWithoutRepeatingCharacters.cpp
LongestSubstringWithoutRepeatingCharacters.cpp
 
 
LongestUncommonSubsequenceI.cpp
LongestUncommonSubsequenceI.cpp
 
 
LongestUnivaluePath.cpp
LongestUnivaluePath.cpp
 
 
LongestValidParentheses.cpp
LongestValidParentheses.cpp
 
 
LongestWordInDictionaryThroughDeleting.cpp
LongestWordInDictionaryThroughDeleting.cpp
 
 
LowestCommonAncestorOfABinaryTree.cpp
LowestCommonAncestorOfABinaryTree.cpp
 
 
MajorityElement.cpp
MajorityElement.cpp
 
 
MapSumPairs.cpp
MapSumPairs.cpp
 
 
MaxAreaOfIsland.cpp
MaxAreaOfIsland.cpp
 
 
MaxConsecutiveOnes.cpp
MaxConsecutiveOnes.cpp
 
 
MaximalSquare.cpp
MaximalSquare.cpp
 
 
MaximumAverageSubarrayI.cpp
MaximumAverageSubarrayI.cpp
 
 
MaximumBinaryTree.cpp
MaximumBinaryTree.cpp
 
 
MaximumDistanceInArrays.cpp
MaximumDistanceInArrays.cpp
 
 
MaximumProductOfThreeNumbers.cpp
MaximumProductOfThreeNumbers.cpp
 
 
MaximumProductSubarray.cpp
MaximumProductSubarray.cpp
 
 
MaximumSubarray.cpp
MaximumSubarray.cpp
 
 
MaximumSwap.cpp
MaximumSwap.cpp
 
 
MergeKSortedLists.cpp
MergeKSortedLists.cpp
 
 

Repository files navigation

LeetCode solutions

General Information

The repository contains solutions to various problems on leetcode. The solutions for the following types of questions are available :-

How to contribute?

  1. Fork the repository
  2. Do the desired changes (add/delete/modify)
  3. Make a pull request

When to contribute?

  1. If there is no solution to a problem in the main branch.
  2. If your solution is asymptotically faster than the one in the main branch.
  3. If your algorithm is of the same time complexity but with reduced code size. In this case, comment out the original solution & make a pull request with your solution.
  4. If you have another method of solving the problem which is asymptotically slower than the original method then, comment your solution in the main file & make a pull request.

About

Solutions to problems on LeetCode

Topics

sql algorithms leetcode cpp data-structures leetcode-solutions

Resources

Readme
Activity

Stars

23 stars

Watchers

3 watching

Forks

12 forks
Report repository

Releases

No releases published

Packages

 
 
 

Languages