MCPcopy Create free account

hub / github.com/Semaserg/LeetCodeProblems / functions

Functions1,412 in github.com/Semaserg/LeetCodeProblems

↓ 250 callersMethodadd
(String word)
backTracking/WordSquares_425/Trie.java:24
↓ 146 callersMethodget
(int key)
design/LRUCache_146/LRUCache.java:46
↓ 122 callersMethodsize
()
design/ImplementConnectedComponents/Graph.java:32
↓ 105 callersMethodput
(int key, int value)
design/LRUCache_146/LRUCache.java:93
↓ 68 callersMethodisEmpty
()
design/ImplementPriorityQueue/MyPriorityQueue.java:16
↓ 63 callersMethodremove
(int key)
design/LRUCache_146/LRUCache.java:58
↓ 54 callersMethodmax
()
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:126
↓ 49 callersMethodadd
(int level, int value)
tree/BinaryTreeVerticalOrderTraversal_314/Solution.java:60
↓ 48 callersMethodcontains
Is {@code i} an index on this priority queue? @param i an index @return {@code true} if {@code i} is an index on this priority queue; {@code false} o
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:87
↓ 47 callersMethodpush
(int x)
stack/MinStack_155/MinStack.java:41
↓ 46 callersMethodmin
()
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:120
↓ 41 callersMethodpop
()
stack/MinStack_155/MinStack.java:49
↓ 36 callersMethodget
(int[] array, int i)
sorting/HeapSort/HeapSort.java:40
↓ 33 callersMethodadd
(int heapNums)
heap/WaysToFormMaxHeap_intbit/Solution.java:80
↓ 32 callersMethodadd
(NestedInteger ni)
stack/MiniParser_385/NestedInteger.java:39
↓ 31 callersMethodequals
(Object point)
design/SnakeGame_353/SnakeGame.java:154
↓ 28 callersMethoddraw
()
graph/GenerateMaze_vstar/StdDraw.java:1566
↓ 26 callersMethodsort
(int[] array)
sorting/HeapSort/HeapSort.java:8
↓ 25 callersMethodscaleX
(double x)
graph/GenerateMaze_vstar/StdDraw.java:798
↓ 25 callersMethodscaleY
(double y)
graph/GenerateMaze_vstar/StdDraw.java:799
↓ 24 callersMethodinsert
(String word)
design/ImplementTrie_208/Trie.java:23
↓ 24 callersMethodtoString
()
design/Mocks/User.java:87
↓ 22 callersMethodtoString
()
stack/MiniParser_385/NestedInteger.java:53
↓ 21 callersMethodtoString
()
array/MergeIntervals_56/Interval.java:9
↓ 15 callersMethodget
Provide a number which is not assigned to anyone. @return - Return an available number. Return -1 if none is available.
design/DesignPhoneDirectory_379_/PhoneDirectory.java:56
↓ 13 callersMethodcheck
(boolean condition, String message)
design/Mocks/Timetable.java:269
↓ 13 callersMethodpeek
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:80
↓ 12 callersMethodpixel
Draws one pixel at (<em>x</em>, <em>y</em>). This method is private because pixels depend on the display. To achieve the same effect, set the pen radi
graph/GenerateMaze_vstar/StdDraw.java:965
↓ 11 callersMethodaddEdge
(int v, int w)
design/ImplementTopologicalSortInDigraph/Digraph.java:23
↓ 11 callersMethodempty
()
stack/ImplementStackUsingQueues_225/MyStack.java:46
↓ 11 callersMethodfactorX
(double w)
graph/GenerateMaze_vstar/StdDraw.java:800
↓ 11 callersMethodfactorY
(double h)
graph/GenerateMaze_vstar/StdDraw.java:801
↓ 11 callersMethodisRed
(Node node)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:68
↓ 9 callersMethodgetDataByPattern
(String userRecord, String patternStart)
design/Mocks/User.java:54
↓ 9 callersMethodput
(Key key, Value value)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:15
↓ 9 callersMethodset
(int[] array, int i, int value)
sorting/HeapSort/HeapSort.java:45
↓ 9 callersMethodsetPenColor
Set the pen color to the default color (black).
graph/GenerateMaze_vstar/StdDraw.java:874
↓ 8 callersMethodaddEdge
(int v, int w)
design/ImplementGraphBfs/Graph.java:23
↓ 8 callersMethodaddEdge
(int v, int w)
design/ImplementDigraphShortestPath/Digraph.java:23
↓ 8 callersMethodaddEdge
(int v, int w)
design/ImplementConnectedComponents/Graph.java:23
↓ 8 callersMethodaddEdge
(int v, int w)
design/ImplementGraphDfs/Graph.java:23
↓ 8 callersMethodget
(Key key)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:37
↓ 8 callersMethodgetX
()
heap/TheSkylineProblem_218/Solution.java:113
↓ 8 callersMethodmove
Moves the snake. @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down @return The game's score after the move. Return -1 if game
design/SnakeGame_353/SnakeGame.java:86
↓ 8 callersMethodput
(Key key, Value value)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:15
↓ 8 callersMethodsize
()
design/ImplementDigraphShortestPath/Digraph.java:31
↓ 8 callersMethodunvisited
(int x, int y, Direction direction)
graph/GenerateMaze_vstar/Maze.java:68
↓ 7 callersMethodgetY
()
heap/TheSkylineProblem_218/Solution.java:114
↓ 7 callersMethodparseDay
(String preferableTimeSlots, String dayShort)
design/Mocks/UserDaySchedule.java:8
↓ 7 callersMethodpick
(int target)
math/RandomPickIndex_398/Solution.java:38
↓ 7 callersMethodrotate
(int[][] matrix)
array/RotateImage_48/Solution.java:37
↓ 6 callersMethodaddEdge
(DirectedEdge e)
design/ImplementShortestPathTreeViaDijkstra/EdgeWeightedDigraph.java:21
↓ 6 callersMethodaddEdge
(int v, int w)
graph/GraphTraversal_BFS_DFS_iterativeDFS/Graph.java:16
↓ 6 callersMethodcalcInterviewsWithSameOpponent
()
design/Mocks/User.java:116
↓ 6 callersMethodget
(Key key)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:72
↓ 6 callersMethodgetMaxLowerThan
(int[] nums, Integer top)
array/ThirdMaximumNumber_414/Solution.java:58
↓ 6 callersMethodhasNext
()
design/ZigzagIterator_281/ZigzagIterator.java:89
↓ 6 callersMethodind
(int i, int n)
array/WiggleSort2_324/Solution.java:44
↓ 6 callersMethodinitUser
(int userId)
design/DesignTwitter_355/Twitter.java:79
↓ 6 callersMethodkeys
()
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:150
↓ 6 callersMethodshouldPrintMessage
Returns true if the message should be printed in the given timestamp, otherwise returns false. If this method returns false, the message will not
design/LoggerRateLimiter_359/Logger.java:31
↓ 6 callersMethodtoString
()
graph/DoctorsRating_real/Doctor.java:20
↓ 5 callersMethodclear
Clears the screen to the default color (white).
graph/GenerateMaze_vstar/StdDraw.java:809
↓ 5 callersMethoddelMax
()
design/ImplementPriorityQueue/MyPriorityQueue.java:52
↓ 5 callersMethodfind
(int i, int[] parents)
graph/NumberOfConnectedComponentsInAnUndirectedGraph_323/Solution.java:58
↓ 5 callersMethodget
(String prefix)
backTracking/WordSquares_425/Trie.java:36
↓ 5 callersMethodgetArea
(int x1, int y1, int x2, int y2)
math/RectangleArea_223/Solution.java:59
↓ 5 callersMethodgetFirst
(List<Integer> list)
array/MaximumDistanceInArrays_624/Solution.java:50
↓ 5 callersMethodinsert
(int value)
design/ImplementPriorityQueue/MyPriorityQueue.java:46
↓ 5 callersMethodisFree
()
array/ShortestDistanceFromAllBuildings_317/Solution.java:131
↓ 5 callersMethodreverse
(int x)
math/ReverseInteger_7/Solution.java:31
↓ 5 callersMethodsort
(Comparable[] array)
design/QuickSort/QuickSort.java:4
↓ 5 callersMethodstartsWith
(String prefix)
design/ImplementTrie_208/Trie.java:50
↓ 5 callersMethodswap
(int[] nums, int i, int j)
array/WiggleSort2_324/Solution.java:80
↓ 5 callersMethodswap
(int[] nums, int i, int j)
array/KthLargestElementInAnArray_215/Solution.java:58
↓ 4 callersMethodcanGo
(int x, int y, Direction dir)
graph/GenerateMaze_vstar/Maze.java:195
↓ 4 callersMethodcollect
(List<String> result, TrieNode current)
backTracking/WordSquares_425/Trie.java:58
↓ 4 callersMethoddelete
(Key key)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:52
↓ 4 callersMethodexch
(int i, int j)
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:265
↓ 4 callersMethodfrom
()
design/ImplementShortestPathTreeViaDijkstra/DirectedEdge.java:16
↓ 4 callersMethodget
(Key key)
design/ImplementHashTable_SeparateChaining/SeparateChainingHashTable.java:36
↓ 4 callersMethodgetHeight
Go to bottom of the tree by left side. So right side can be smaller. @param node @return
tree/CountCompleteTreeNodes_222/Solution.java:60
↓ 4 callersMethodgetImage
(String filename)
graph/GenerateMaze_vstar/StdDraw.java:1247
↓ 4 callersMethodinPlane
(int row, int col, int[][] rooms)
graph/WallsAndGates_286/Solution.java:69
↓ 4 callersMethodinitWallArr
()
graph/GenerateMaze_vstar/Maze.java:44
↓ 4 callersMethodline
Draws a line segment between (<em>x</em><sub>0</sub>, <em>y</em><sub>0</sub>) and (<em>x</em><sub>1</sub>, <em>y</em><sub>1</sub>). @param x0 the <e
graph/GenerateMaze_vstar/StdDraw.java:952
↓ 4 callersMethodnext
(int val)
design/MovingAverageFromDataStream_346/MovingAverage.java:31
↓ 4 callersMethodpause
Pause for t milliseconds. This method is intended to support computer animations. @param t number of milliseconds
graph/GenerateMaze_vstar/StdDraw.java:1547
↓ 4 callersMethodpoint
(int x, int y)
heap/TheSkylineProblem_218/Solution.java:100
↓ 4 callersMethodpop
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:74
↓ 4 callersMethodpush
(int x)
stack/ImplementQueueUsingStacks_232/MyQueue.java:67
↓ 4 callersMethodremoveWall
(int x, int y, Direction direction)
graph/GenerateMaze_vstar/Maze.java:83
↓ 4 callersMethodsetFont
Sets the font to the default font (sans serif, 16 point).
graph/GenerateMaze_vstar/StdDraw.java:924
↓ 4 callersMethodshow
Copies the offscreen buffer to the onscreen buffer, pauses for t milliseconds and enables double buffering. @param t number of milliseconds @deprecate
graph/GenerateMaze_vstar/StdDraw.java:1536
↓ 4 callersMethodshuffle
()
array/ShuffleAnArray_384_/Solution.java:69
↓ 4 callersMethodsink
(int k)
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:284
↓ 4 callersMethodsize
Returns the number of keys on this priority queue. @return the number of keys on this priority queue
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:97
↓ 4 callersMethodswim
Heap helper functions.
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:277
↓ 3 callersMethodaddRange
(int left, int right)
array/RangeModule_715/RangeModule.java:14
↓ 3 callersMethodaddRange
(int lower, boolean includeLower, int upper, boolean includeUpper, ArrayList<String> result)
array/MissingRanges_163/Solution.java:50
next →1–100 of 1,412, ranked by callers