Functions — github.com/FreeTymeKiyan/LeetCode-Sol-Res

CodeHub MCPcopy Create free account

hub / github.com/FreeTymeKiyan/LeetCode-Sol-Res / functions

Functions1,974 in github.com/FreeTymeKiyan/LeetCode-Sol-Res

⨍ Functions 1,974◇ Types & classes 889

↓ 1 callersMethodvalidWordAbbreviation

Word and abbreviation don't match if: <ol> <li>The lengths are different</li> <li>The actual characters at specific positions are different</li> <

src/main/java/com/freetymekiyan/algorithms/level/easy/ValidWordAbbreviation.java:48

↓ 1 callersMethodvalidate

Validate given the max sum whether we can generate <= m subarrays. If it needs more than m, return false. Otherwise return true. <p> Use a long sum fo

src/main/java/com/freetymekiyan/algorithms/level/hard/SplitArrayLargestSum.java:82

↓ 1 callersMethodwallsAndGates

BFS. Search from gate to rooms. As its breadth first search, it makes sure that: The rooms are visited level by level. So that rooms at distance 1 won

src/main/java/com/freetymekiyan/algorithms/level/medium/WallsAndGates.java:56

↓ 1 callersMethodwallsAndGates2

BFS. Level-order Traversal. Use queue size to pull each level. Unnecessary since we can always update a grid's adjacent grids with it's value.

src/main/java/com/freetymekiyan/algorithms/level/medium/WallsAndGates.java:95

↓ 1 callersMethodwiggleSort

One-pass Solution. First 2 elements already sorted, start from second element For A[n-1], A[n], A[n+1], n >= 1, n < length - 1 Suppose sorted sequence

src/main/java/com/freetymekiyan/algorithms/other/WiggleSortUnsorted.java:31

↓ 1 callersMethodwordBreak2

DP. Top-down. If a String s is breakable, it consists of one word from the wordDict. And the rest of the String is also breakable. When a String is br

src/main/java/com/freetymekiyan/algorithms/level/medium/WordBreak.java:62

↓ 1 callersMethodwordPattern

(String pattern, String str)

src/main/java/com/freetymekiyan/algorithms/level/easy/WordPattern.java:38

↓ 1 callersMethodwordPatternMatch

(String pattern, String str)

src/main/java/com/freetymekiyan/algorithms/level/hard/WordPattern2.java:42

MethodAutocompleteSystem

Go through the sentences and times and build a Trie.

src/main/java/com/freetymekiyan/algorithms/level/hard/DesignSearchAutocompleteSystem.java:90

MethodBSTIterator

src/main/cpp/173_Binary_Search_Tree_Iterator.cpp:46

MethodBSTIterator

Push all left child, and left child's left child and on and on to stack

src/main/java/com/freetymekiyan/algorithms/level/medium/BSTIterator.java:26

MethodBinaryIndexedTree

(int[] arr, int len)

src/main/java/com/freetymekiyan/datastructures/BinaryIndexedTree.java:22

MethodBinarySearchTreeIterator

Simulate in-order traversal. Push all left children into a Stack to get prepared.

src/main/java/com/freetymekiyan/algorithms/level/medium/BinarySearchTreeIterator.java:31

src/main/java/com/freetymekiyan/algorithms/level/hard/DataStreamAsDisjointIntervals.java:262

(int row, int col, int minBorderHeight)

src/main/java/com/freetymekiyan/algorithms/level/hard/TrappingRainWater2.java:102

MethodCountIndex

src/main/java/com/freetymekiyan/algorithms/other/FirstNonRepeatingChar.java:51

MethodDoubleLinkedList

(int key, int value)

others/LRUCache_shuna.java:20

(int number, int row, int col)

src/main/java/com/freetymekiyan/algorithms/level/medium/KthSmallestElementInASortedMatrix.java:95

(int x, int min)

src/main/java/com/freetymekiyan/algorithms/level/easy/MinStack.java:93

(double timestamp, boolean isLogin)

src/main/java/com/freetymekiyan/algorithms/other/UserSessions.java:91

MethodGetNumberOfOnes

Save cumulative sum. The sum is the number of ones. A rectangle can be represented by 4 other rectangles.

src/main/java/com/freetymekiyan/algorithms/other/GetNumberOfOnes.java:17

src/main/java/com/freetymekiyan/algorithms/other/Graph.java:62

MethodHitCounter

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/medium/DesignHitCounter.java:54

MethodInOrderTravel

src/main/cpp/099_Recover_Binary_Search_Tree.cpp:40

MethodIntegerIterator

(List<List<Integer>> integerList)

src/main/java/com/freetymekiyan/algorithms/other/IntegerIterator.java:17

src/main/java/com/freetymekiyan/algorithms/utils/Utils.java:184

src/main/java/com/freetymekiyan/datastructures/LRUCache.java:25

Remember capacity. Create cache map and doubly linked list.

src/main/java/com/freetymekiyan/algorithms/level/hard/LRUCache.java:36

MethodLRUCacheLinkedHashMap

(int capacity, float loadFactor)

src/main/java/com/freetymekiyan/algorithms/level/hard/LRUCacheLinkedHashMap.java:24

MethodLRUCacheShuna

others/LRUCache_shuna.java:33

src/main/cpp/092_Reverse_Linked_List_II.cpp:24

src/main/cpp/021_Merge_Two_Sorted_List.cpp:21

src/main/cpp/141_Linked_List_Cycle.cpp:25

src/main/cpp/147_Insertion_Sort_List.cpp:16

src/main/cpp/082_Remove_Duplicates_From_Sorted_Lists_II.cpp:28

src/main/cpp/083_Remove_Duplicates_from_Sorted_List.cpp:20

src/main/cpp/143_Reorder_List.cpp:27

src/main/java/com/freetymekiyan/algorithms/utils/Utils.java:158

src/main/java/com/freetymekiyan/algorithms/level/medium/InsertionSortList.java:37

src/main/java/com/freetymekiyan/algorithms/level/medium/SortList.java:73

src/main/java/com/freetymekiyan/algorithms/level/medium/PartitionList.java:76

src/main/java/com/freetymekiyan/algorithms/level/medium/RotateList.java:82

src/main/java/com/freetymekiyan/algorithms/level/medium/LinkedListCycle.java:37

src/main/java/com/freetymekiyan/algorithms/level/medium/SwapNode.java:43

src/main/java/com/freetymekiyan/algorithms/level/medium/RemoveDuplicatesFromSortedList2.java:86

src/main/java/com/freetymekiyan/algorithms/level/medium/LinkedListCycle2.java:48

src/main/java/com/freetymekiyan/algorithms/level/easy/RemoveLinkedListElements.java:112

src/main/java/com/freetymekiyan/algorithms/level/easy/RemoveDuplicatesFromSortedList.java:53

src/main/java/com/freetymekiyan/algorithms/level/easy/IntersectionOfTwoLinkedLists.java:60

add no-arg constructor and use resizing array

src/main/java/com/freetymekiyan/datastructures/MaxPQ.java:27

MethodMaxSubseqDifferenceNoOverlap

Cut input array in two halves Find max contiguous subsequences sum in left half, min sum in right half Find max contiguous subsequences sum in right h

src/main/java/com/freetymekiyan/algorithms/other/MaxSubseqDifferenceNoOverlap.java:21

MethodMovingAverage

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/easy/MovingAverageFromDataStream.java:28

MethodNestedInteger

src/main/java/com/freetymekiyan/algorithms/level/medium/MiniParser.java:110

MethodNestedIterator

(List<NestedInteger> nestedList)

src/main/java/com/freetymekiyan/algorithms/level/medium/FlattenNestedListIterator.java:70

src/main/java/com/freetymekiyan/datastructures/LRUCache.java:93

(Key key, Value val)

src/main/java/com/freetymekiyan/datastructures/BST.java:183

src/main/java/com/freetymekiyan/algorithms/other/LowestCommonAncestor.java:38

src/main/java/com/freetymekiyan/algorithms/level/hard/CountOfSmallerNumbersAfterSelf.java:59

src/main/java/com/freetymekiyan/algorithms/level/hard/LRUCache.java:124

src/main/java/com/freetymekiyan/algorithms/level/medium/RangeSumQueryMutable.java:31

src/main/java/com/freetymekiyan/algorithms/level/easy/RangeSumQueryImmutable.java:33

MethodNumMatrix

(int[][] matrix)

src/main/java/com/freetymekiyan/algorithms/level/hard/RangeSumQuery2DMutable.java:45

MethodNumMatrix

(int[][] matrix)

src/main/java/com/freetymekiyan/algorithms/level/medium/RangeSumQuery2DImmutable.java:47

(int a, int ai, int b, int bi)

src/main/java/com/freetymekiyan/algorithms/level/medium/FourSumTreeMap.java:24

(Vertex d, double c)

src/main/java/com/freetymekiyan/algorithms/other/Dijkstra.java:25

MethodPeekIterator

(Iterator<T> iterator)

src/main/java/com/freetymekiyan/algorithms/other/PeekIterator.java:24

MethodPeekingIterator

Peeking iterator is based on normal iterator. Just a wrapper class. Use a variable to cache the next element.

src/main/java/com/freetymekiyan/algorithms/level/medium/PeekingIterator.java:43

MethodPhoneDirectory

Initialize your data structure here @param maxNumbers - The maximum numbers that can be stored in the phone directory.

src/main/java/com/freetymekiyan/algorithms/level/medium/DesignPhoneDirectory.java:57

src/main/cpp/149_Max_Points_on_a_Line.cpp:22

src/main/java/com/freetymekiyan/algorithms/level/hard/MaxPointsOnALine.java:111

src/main/java/com/freetymekiyan/algorithms/level/hard/MaxPoints.java:102

MethodQuickUnionUF

src/main/java/com/freetymekiyan/algorithms/other/QuickUnionUF.java:10

MethodRandomListNode

src/main/java/com/freetymekiyan/algorithms/level/hard/CopyListWithRandomP.java:83

MethodRandomizedCollection

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/hard/InsertDeleteGetRandomDuplicatesAllowed.java:58

MethodRandomizedSet

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/medium/InsertDeleteGetRandom.java:65

(int size, int lower, int upper)

src/main/java/com/freetymekiyan/algorithms/level/medium/LargestBstSubtree.java:67

(int size, int lower, int upper)

src/main/java/com/freetymekiyan/algorithms/level/medium/LargestBstSubtree.java:106

MethodSnakeGame

(int width, int height, int[][] food)

src/main/java/com/freetymekiyan/algorithms/level/medium/DesignSnakeGame.java:79

src/main/java/com/freetymekiyan/algorithms/level/medium/ShuffleAnArray.java:30

@param head The linked list's head. Note that the head is guaranteed to be not null, so it contains at least one node.

src/main/java/com/freetymekiyan/algorithms/level/medium/LinkedListRandomNode.java:50

src/main/java/com/freetymekiyan/algorithms/level/medium/RandomPickIndex.java:41

MethodSummaryRanges

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/hard/DataStreamAsDisjointIntervals.java:45

MethodSummaryRanges2

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/hard/DataStreamAsDisjointIntervals.java:107

MethodTicTacToe

Initialize your data structure here.

src/main/java/com/freetymekiyan/algorithms/level/medium/DesignTicTacToe.java:69

MethodTreeLinkNode

src/main/cpp/117_Populating_Next_Right_Pointers_in_Each_Node_II.cpp:42

MethodTreeLinkNode

src/main/cpp/116_Populating_Next_Right_Pointers_in_Each_Node.cpp:51

MethodTreeLinkNode

src/main/java/com/freetymekiyan/algorithms/level/hard/PopulatingNextRight2.java:114

src/main/cpp/107_Binary_Tree_Level_Order_Traversal_II.cpp:37

src/main/cpp/199_Binary_Tree_Right_Side_View.cpp:33

src/main/cpp/100_Same_Tree.cpp:22

src/main/cpp/102_Binary_Tree_Level_Order_Traversal.cpp:37

src/main/cpp/108_Convert_Sorted_Array_to_Binary_Search_Tree.cpp:24

src/main/cpp/094_Binary_Tree_Inorder_Traversal.cpp:29

src/main/cpp/101_Symmetric_Tree.cpp:39

src/main/cpp/145_Binary_Tree_Postorder_Traversal.cpp:37

src/main/cpp/110_Balanced_Binary_Tree.cpp:27

src/main/cpp/099_Recover_Binary_Search_Tree.cpp:23

src/main/cpp/173_Binary_Search_Tree_Iterator.cpp:29

src/main/cpp/104_Maximum_Depth_of_Binary_Tree.cpp:25

src/main/cpp/124_Binary_Tree_Maximum_Path_Sum.cpp:32

← previous next →701–800 of 1,974, ranked by callers