added Perfect Squares (Medium)

Author: minhyeong-joe

Medium/PerfectSquares/README.md

@@ -0,0 +1,21 @@
+# Perfect Squares
+
+[Leetcode Link](https://leetcode.com/problems/perfect-squares/)
+
+## Problem:
+
+Given a positive integer _n_, find the least number of perfect square numbers (for example, `1, 4, 9, 16, ...`) which sum to _n_.
+
+## Example:
+
+```
+Input: n = 12
+Output: 3
+Explanation: 12 = 4 + 4 + 4.
+```
+
+```
+Input: n = 13
+Output: 2
+Explanation: 13 = 4 + 9.
+```

Medium/PerfectSquares/solution.py

@@ -0,0 +1,21 @@
+import math
+
+
+def numSquares(n: int) -> int:
+ queue = list([(n, 0)])
+ visited = set([n])
+ while queue:
+ currentNum, depth = queue.pop(0)
+ maxSqrt = math.floor(math.sqrt(currentNum))
+ for i in range(maxSqrt, -1, -1):
+ remainingNum = currentNum - i * i
+ if remainingNum == 0:
+ return depth+1
+ elif remainingNum not in visited:
+ queue.append((remainingNum, depth+1))
+
+
+print(numSquares(12))
+print(numSquares(13))
+print(numSquares(61))
+print(numSquares(48))

README.md

@@ -9,96 +9,96 @@ Languages used: Java and Python
 ## Navigation
 
 - Easy
-  - [Sum of Even Numbers After Queries](Easy/SumOfEvenNumbersAfterQueries)
-  - [Next Greater Element 1](Easy/NextGreaterElement1)
-  - [Longest Common Prefix](Easy/LongestCommonPrefix)
-  - [Intersection of Two Arrays](Easy/IntersectionOfTwoArrays)
-  - [Backspace String Compare](Easy/BackspaceStringCompare)
-  - [Merge Two Sorted Lists](Easy/MergeTwoSortedLists)
-  - [Climbing Stairs](Easy/ClimbingStairs)
-  - [Fair Candy Swap](Easy/FairCandySwap)
-  - [Maximize Distance to Closest Person](Easy/MaximizeDistanceToClosestPerson)
-  - [Find Common Characters](Easy/FindCommonCharacters)
-  - [Third Maximum Number](Easy/ThirdMaximumNumber)
-  - [String Matching in an Array](Easy/StringMatchingInArray)
-  - [Minimum Value to Get Positive Step by Step Sum](Easy/MinValStepSum)
-  - [Maximum Product of Three Numbers](Easy/MaxProductofThreeNumbers)
-  - [Maximize Sum Of Array After K Negations](Easy/MaximizeSumAfterKNegations)
-  - [House Robber](Easy/HouseRobber)
-  - [Majority Element](Easy/MajorityElement)
-  - [Reshape the Matrix](Easy/ReshapeMatrix)
-  - [Shortest Unsorted Continuous Subarray](Easy/ShortedUnsortedContinuousSubarray)
-  - [Find Lucky Integer in an Array](Easy/FindLuckyIntegerInArray)
-  - [N-Repeated Element in Size 2N Array](Easy/N_RepeatedElementInArray)
-  - [Sort Array By Parity](Easy/SortArrayByParity)
-  - [Isomorphic Strings](Easy/IsomorphicStrings)
-  - [Binary Prefix Divisible By 5](Easy/BinaryPrefixDivBy5)
-  - [Rank Transform of an Array](Easy/RankTransformArray)
-  - [Add to Array-Form of Integer](Easy/AddToArrayFormInteger)
-  - [Sqrt(x)](Easy/SqrtX)
-  - [Shuffle the Array](Easy/ShuffleArray)
-  - [Remove Duplicates from Sorted List](Easy/RemoveDuplicatesFromSortedList)
-  - [Longest Continuous Increasing Subsequence](Easy/LongestIncreasingSubsequence)
-  - [Happy Number](Easy/HappyNumber)
-  - [Assign Cookies](Easy/AssignCookies)
-  - [Rotate Array](Easy/RotateArray)
-  - [N-ary Tree Postorder Traversal](Easy/NaryTreePostorderTraversal)
+ - [Sum of Even Numbers After Queries](Easy/SumOfEvenNumbersAfterQueries)
+ - [Next Greater Element 1](Easy/NextGreaterElement1)
+ - [Longest Common Prefix](Easy/LongestCommonPrefix)
+ - [Intersection of Two Arrays](Easy/IntersectionOfTwoArrays)
+ - [Backspace String Compare](Easy/BackspaceStringCompare)
+ - [Merge Two Sorted Lists](Easy/MergeTwoSortedLists)
+ - [Climbing Stairs](Easy/ClimbingStairs)
+ - [Fair Candy Swap](Easy/FairCandySwap)
+ - [Maximize Distance to Closest Person](Easy/MaximizeDistanceToClosestPerson)
+ - [Find Common Characters](Easy/FindCommonCharacters)
+ - [Third Maximum Number](Easy/ThirdMaximumNumber)
+ - [String Matching in an Array](Easy/StringMatchingInArray)
+ - [Minimum Value to Get Positive Step by Step Sum](Easy/MinValStepSum)
+ - [Maximum Product of Three Numbers](Easy/MaxProductofThreeNumbers)
+ - [Maximize Sum Of Array After K Negations](Easy/MaximizeSumAfterKNegations)
+ - [House Robber](Easy/HouseRobber)
+ - [Majority Element](Easy/MajorityElement)
+ - [Reshape the Matrix](Easy/ReshapeMatrix)
+ - [Shortest Unsorted Continuous Subarray](Easy/ShortedUnsortedContinuousSubarray)
+ - [Find Lucky Integer in an Array](Easy/FindLuckyIntegerInArray)
+ - [N-Repeated Element in Size 2N Array](Easy/N_RepeatedElementInArray)
+ - [Sort Array By Parity](Easy/SortArrayByParity)
+ - [Isomorphic Strings](Easy/IsomorphicStrings)
+ - [Binary Prefix Divisible By 5](Easy/BinaryPrefixDivBy5)
+ - [Rank Transform of an Array](Easy/RankTransformArray)
+ - [Add to Array-Form of Integer](Easy/AddToArrayFormInteger)
+ - [Sqrt(x)](Easy/SqrtX)
+ - [Shuffle the Array](Easy/ShuffleArray)
+ - [Remove Duplicates from Sorted List](Easy/RemoveDuplicatesFromSortedList)
+ - [Longest Continuous Increasing Subsequence](Easy/LongestIncreasingSubsequence)
+ - [Happy Number](Easy/HappyNumber)
+ - [Assign Cookies](Easy/AssignCookies)
+ - [Rotate Array](Easy/RotateArray)
+ - [N-ary Tree Postorder Traversal](Easy/NaryTreePostorderTraversal)
 - Medium
- - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
- - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)
- - [Find Minimum Number of Fibonacci Numbers Whose Sum is K](Medium/FindMinNumFibNumSumK)
- - [Find the Duplicate Number](Medium/FindDuplicateNumber)
- - [Unique Paths](Medium/UniquePaths)
- - [Apply Discount Every n Orders](Medium/ApplyDiscountEveryNOrders)
- - [All Elements in Two Binary Search Trees](Medium/AllElementsInTwoBSTs)
- - [Elimination Game](Medium/EliminationGame)
- - [Increasing Triplet Subsequence](Medium/IncreasingTripletSubsequence)
- - [Design Browser History](Medium/DesignBrowserHistory)
- - [Rearrange Words in a Sentence](Medium/RearrangeWordsInSentence)
- - [Diagonal Traverse II](Medium/DiagonalTraverse2)
- - [Total Hamming Distance](Medium/TotalHammingDistance)
- - [Partition Array into Disjoint Intervals](Medium/PartitionArrayIntoDisjointIntervals)
- - [Search in Rotated Sorted Array](Medium/SearchInRotatedSortedArray)
- - [Car Pooling](Medium/CarPooling)
- - [Palindromic Substrings](Medium/PalindromicSubstrings)
- - [Prison Cells After N Days](Medium/PrisonCellsAfterNDays)
- - [Minimum Number of Steps to Make Two Strings Anagram](Medium/MinStepsToMakeTwoStringsAnagram)
- - [Maximum Length of Pair Chain](Medium/MaximumLengthPairChain)
- - [Linked List Cycle II](Medium/LinkedListCycle2)
- - [Swap Nodes in Pairs](Medium/SwapNodesInPairs)
- - [All Paths From Source to Target](Medium/AllPathsFromSrcToTarget)
- - [Queens That Can Attack The King](Medium/QueensThatCanAttackKing)
- - [Reverse Substrings Between Each Pair of Parentheses](Medium/ReverseSubstringsBetweenParentheses)
- - [Asteroid Collision](Medium/AsteroidCollision)
- - [Surrounded Regions](Medium/SurroundedRegions)
- - [Predict the Winner](Medium/PredictWinner)
- - [Subarray Sum Equals K](Medium/SubarraySumEqualsK)
- - [Find Minimum in Rotated Sorted Array](Medium/FindMinInRotatedSortedArray)
- - [Maximum Swap](Medium/MaximumSwap)
- - [Number of Operations to Make Network Connected](Medium/NumToMakeNetworkConnected)
- - [Sort Colors](Medium/SortColors)
- - [Design Linked List](Medium/DesignLinkedList)
- - [Single Number II](Medium/SingleNumber2)
- - [Count Square Submatrices with All Ones](Medium/CountSquareWithOnes)
- - [Divide Array is Sets of K Consecutive Numbers](Medium/DivideArrayInKConsecNums)
+ - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
+ - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)
+ - [Find Minimum Number of Fibonacci Numbers Whose Sum is K](Medium/FindMinNumFibNumSumK)
+ - [Find the Duplicate Number](Medium/FindDuplicateNumber)
+ - [Unique Paths](Medium/UniquePaths)
+ - [Apply Discount Every n Orders](Medium/ApplyDiscountEveryNOrders)
+ - [All Elements in Two Binary Search Trees](Medium/AllElementsInTwoBSTs)
+ - [Elimination Game](Medium/EliminationGame)
+ - [Increasing Triplet Subsequence](Medium/IncreasingTripletSubsequence)
+ - [Design Browser History](Medium/DesignBrowserHistory)
+ - [Rearrange Words in a Sentence](Medium/RearrangeWordsInSentence)
+ - [Diagonal Traverse II](Medium/DiagonalTraverse2)
+ - [Total Hamming Distance](Medium/TotalHammingDistance)
+ - [Partition Array into Disjoint Intervals](Medium/PartitionArrayIntoDisjointIntervals)
+ - [Search in Rotated Sorted Array](Medium/SearchInRotatedSortedArray)
+ - [Car Pooling](Medium/CarPooling)
+ - [Palindromic Substrings](Medium/PalindromicSubstrings)
+ - [Prison Cells After N Days](Medium/PrisonCellsAfterNDays)
+ - [Minimum Number of Steps to Make Two Strings Anagram](Medium/MinStepsToMakeTwoStringsAnagram)
+ - [Maximum Length of Pair Chain](Medium/MaximumLengthPairChain)
+ - [Linked List Cycle II](Medium/LinkedListCycle2)
+ - [Swap Nodes in Pairs](Medium/SwapNodesInPairs)
+ - [All Paths From Source to Target](Medium/AllPathsFromSrcToTarget)
+ - [Queens That Can Attack The King](Medium/QueensThatCanAttackKing)
+ - [Reverse Substrings Between Each Pair of Parentheses](Medium/ReverseSubstringsBetweenParentheses)
+ - [Asteroid Collision](Medium/AsteroidCollision)
+ - [Surrounded Regions](Medium/SurroundedRegions)
+ - [Predict the Winner](Medium/PredictWinner)
+ - [Subarray Sum Equals K](Medium/SubarraySumEqualsK)
+ - [Find Minimum in Rotated Sorted Array](Medium/FindMinInRotatedSortedArray)
+ - [Maximum Swap](Medium/MaximumSwap)
+ - [Number of Operations to Make Network Connected](Medium/NumToMakeNetworkConnected)
+ - [Sort Colors](Medium/SortColors)
+ - [Design Linked List](Medium/DesignLinkedList)
+ - [Single Number II](Medium/SingleNumber2)
+ - [Count Square Submatrices with All Ones](Medium/CountSquareWithOnes)
+ - [Divide Array is Sets of K Consecutive Numbers](Medium/DivideArrayInKConsecNums)
+ - [Perfect Squares](Medium/PerfectSquares)
 - Hard
-  - [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)
-  - [Reducing Dishes](Hard/ReducingDishes)
-  - [Longest Consecutive Sequence](Hard/LongestConsecutiveSequence)
-  - [First Missing Positive](Hard/FirstMissingPositive)
-  - [Insert Interval](Hard/InsertInterval)
-  - [Find Median From Data Stream](Hard/FindMedianFromDataStream)
-  - [Escape a Large Maze](Hard/EscapeLargeMaze)
+ - [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)
+ - [Reducing Dishes](Hard/ReducingDishes)
+ - [Longest Consecutive Sequence](Hard/LongestConsecutiveSequence)
+ - [First Missing Positive](Hard/FirstMissingPositive)
+ - [Insert Interval](Hard/InsertInterval)
+ - [Find Median From Data Stream](Hard/FindMedianFromDataStream)
+ - [Escape a Large Maze](Hard/EscapeLargeMaze)
 
 ---
 
 # Challenge_README_Template
+
 [Leetcode Link](#)
 
 ## Problem:
 
-
-
 ## Example:
 
 ```