Functions — github.com/SHY-Corp/LeetCode-Solutions

CodeHub MCPcopy Create free account

hub / github.com/SHY-Corp/LeetCode-Solutions / functions

Functions846 in github.com/SHY-Corp/LeetCode-Solutions

⨍ Functions 846◇ Types & classes 583

C++/855. ExamRoom.cpp:55

MethodFreqStack

C++/895. MaximumFrequencyStack.cpp:19

MethodKthLargest

C++/703.KthLargestElementInAStream.cpp:6

C++/146. LRUCache.cpp:48

C++/203. RemoveLinkedListElements.cpp:17

C++/143. Reorder List.cpp:22

C++/141. Linked List Cycle.cpp:28

MethodMedianFinder

initialize your data structure here. */

C++/295. FindMedianfromDataStream.cpp:15

C++/155. Min Stack.cpp:21

MethodMyHashMap

C++/706.DesignHashMap.cpp:68

MethodMyHashSet

C++/705.DesignHashSet.cpp:5

MethodNestedIterator

C++/341. FlattenNestedListIterator.cpp:67

C++/1365. SmallestNumberThanCurrentNumber.cpp:28

C++/103. BinaryTreeZigzagLevelOrderTraversal.cpp:10

C++/303.RangeSumQueryImmutable.cpp:19

Java/307. Range Sum Query - Mutable.java:29

MethodParkingSystem

C++/1603. Design Parking System.cpp:30

MethodPeekingIterator

C++/284.PeekingIterator.cpp:27

MethodRandomizedSet

Initialize your data structure here. */

C++/380. Insert Delete GetRandom O(1).cpp:26

Java/20. ValidParentheses.java:47

C++/225. Implement Stack Using Queues.cpp:19

MethodSubrectangleQueries

C++/1476. Subrectangle Queries.cpp:12

Trienode constructor in which end is initially false indicating node is NOT a leaf node

C++/720.LongestWordInDictionary.cpp:9

C++/355. DesignTwitter.cpp:27

MethodUndergroundSystem

C++/1396.DesignUndergroundSystem.cpp:9

Initialize your data structure here.

Python/225.ImplementStackUsingQueues.py:7

Python/208. ImplementTrie.py:3

Initialize your data structure here.

Python/208. ImplementTrie.py:8

Initialize your data structure here.

Python/295. FindMedianFromDataStream.py:13

Method_isSymmetric

C++/101. SymmetricTree.cpp:51

C++/705.DesignHashSet.cpp:10

C++/703.KthLargestElementInAStream.cpp:22

MethodaddBinary

C++/67. AddBinary.cpp:9

C++/1603. Design Parking System.cpp:36

MethodaddElementFromList

C++/341. FlattenNestedListIterator.cpp:57

(self, num: int)

Python/295. FindMedianFromDataStream.py:19

C++/295. FindMedianfromDataStream.cpp:19

MethodaddTwoNumbers

(self, l1: ListNode, l2: ListNode)

Python/2. AddTwoNumbers.py:24

MethodaddTwoNumbers

C++/445. Add Two Numbers II.cpp:41

MethodaddTwoNumbers

C++/2. AddTwoNumbers.cpp:11

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

Java/2.Add Two Numbers.java:15

MethodallPathsSourceTarget

(int[][] graph)

Java/797. AllPathsFromSourceToTarget.java:45

MethodareAlmostEqual

C++/1790.CheckIfOneStringSwapCanMakeStringsEqual.cpp:3

MethodareConnected

C++/1627. Graph Connectivity With Threshold.cpp:31

MethodarrangeCoins

Python/441. ArrangingCoins.py:7

MethodarrayPairSum

C++/561. Array Partition I.cpp:4

MethodarraySign

C++/1822.SignOfTheProductOfAnArray.cpp:3

MethodasteroidCollision

C++/735. Asteroid Collision.cpp:35

Finds the substring with atmost K unique chars

C++/992. Subarrays with K Different Integers.cpp:12

C++/1491.AverageSalaryExcludingTheMinimumAndMaximumSalary.cpp:3

MethodaverageOfLevels

C++/637.AverageOfLevelsInBinaryTree.cpp:3

MethodbackspaceCompare

C++/844. BackspaceStringCompare.cpp:23

Methodbacktrack

using backtracking

C++/46. Permutations.cpp:13

Methodbacktrack

using backtracking

C++/47. Permutations II.cpp:13

MethodbalancedStringSplit

:type s: str :rtype: int

Python/1221. SplitAStringInBalancedStrings.py:25

MethodbalancedStringSplit

C++/1221. SplitaStringInBalancedStrings.cpp:7

FunctionbestTeamScore

C++/1626. Best Team With No Conflicts.cpp:11

MethodbrokenCalc

C++/991.BrokenCalculator.cpp:3

MethodbuddyStrings

C++/859. BuddyStrings.cpp:57

MethodbuildTree

C++/105.ConstructBinaryTreefromPreorderandInorderTraversal.cpp:34

MethodbulbSwitch

C++/319. BulbSwitcher.cpp:13

MethodbusyStudent

:type startTime: List[int] :type endTime: List[int] :type queryTime: int :rtype: int

Python/1450. NumberOfStudentsDoingHomeworkAtAGivenTime.py:23

MethodcalPoints

C++/682.BaseballGame.cpp:3

C++/1026. Maximum Difference Between Node and Ancestor.cpp:26

MethodcalcEquation

C++/399.EvaluateDivision.cpp:43

calculates the tilt recursively

C++/563. Binary Tree Tilt.cpp:28

C++/1170. CompareStringsByFrequencyOfTheSmallestCharacter.cpp:25

Methodcalculate

Returns the computed value of the expression. >>>calculate("(1+(4+5+2)-3)+(6+8)") 23 >>>calculate("( 11 + ( 41 + 51

Python/224. BasicCalculator.py:81

Methodcalculate

Python/227. BasicCalculatorII.py:58

Methodcalculate

Java/224.BasicCalculator.java:8

MethodcamelMatch

C++/1023. CammelCaseMatching.cpp:13

MethodcanCompleteCircuit

C++/134. GasStation.cpp:11

MethodcanConstruct

C++/383. RansomNote.cpp:30

MethodcanMakeArithmeticProgression

(self, arr: List[int])

Python/1502.CanMakeArithmeticProgressionFromSequence.py:3

MethodcanMakeArithmeticProgression

C++/1502.CanMakeArithmeticProgressionFromSequence.cpp:3

MethodcanPartition

(self, nums: List[int])

Python/416. PartitionEqualSubsetSum.py:34

MethodcanPartition

C++/414.PartitionEqualSubsetSum.cpp:17

MethodcanPlaceFlowers

C++/605. CanPlaceFlowers.cpp:24

C++/1306. Jump Game III.cpp:34

MethodcanReachHelper

C++/1306. Jump Game III.cpp:13

MethodcanThreePartsEqualSum

(self, A: List[int])

Python/1013. PartitionArrayIntoThreePartsWithEqualSum.py:2

C++/135. Candy.cpp:28

MethodchampagneTower

C++/799. Champagne Tower.cpp:16

C++/461. HammingDistance.cpp:26

C++/414.PartitionEqualSubsetSum.cpp:7

C++/202. HappyNumber.cpp:28

MethodcheckIfExist

Java/1346. CheckIfNandItsDoubleExist.java:3

C++/1396.DesignUndergroundSystem.cpp:13

MethodcheckLetter

auxiliary method to check if a given char is a letter

C++/917. ReverseOnlyLetters.cpp:22

C++/1396.DesignUndergroundSystem.cpp:18

MethodcheckPath

C++/113.PathSumII.cpp:18

MethodcheckPossibility

C++/665. Non-decreasingArray.cpp:22

MethodcheckRight

C++/199. BinaryTreeRightSideView.cpp:14

MethodcheckStraightLine

(self, coordinates: List[List[int]])

Python/1232.CheckIfItIsAStraightLine.py:4

MethodcheckStraightLine

C++/1232.CheckIfItIsAStraight Line.cpp:3

MethodcheckTarget

I am traversing the whole binary tree and storing its node values into a vector 'v'. When we have all the values in our vector array, I start

C++/437.PathSumIII.cpp:18

MethodcherryPickup

Using Dynamic Programing

C++/1463. CherryPickup2.cpp:4

MethodclosestToTarget

(int[] arr, int target)

Java/1521.FindAValueOfAMysteriousFunctionClosestToTarget.java:2

C++/1029. TwoCityScheduling.cpp:16

checking the no. of 1-bits in the successive numbers of the array for sorting them

C++/1356.SortIntegersByTheNumberOf1Bits.cpp:16

← previous next →101–200 of 846, ranked by callers