Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Semaserg/LeetCodeProblems
/ functions
Functions
1,412 in github.com/Semaserg/LeetCodeProblems
⨍
Functions
1,412
◇
Types & classes
729
↓ 3 callers
Method
calcAbbr
(String word)
design/UniqueWordAbbreviation_288/ValidWordAbbr.java:62
↓ 3 callers
Method
deleteMin
()
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:83
↓ 3 callers
Method
digitToStr
(int digit, String one, String five, String ten)
math/IntegerToRoman_12/Solution.java:31
↓ 3 callers
Method
either
(int v)
graph/CommutableIslands_intbit/Solution.java:122
↓ 3 callers
Method
exch
(int i, int j)
design/ImplementPriorityQueue/MyPriorityQueue.java:20
↓ 3 callers
Method
factorial
(int n)
heap/WaysToFormMaxHeap_intbit/Solution.java:89
↓ 3 callers
Method
filledCircle
Draws a filled circle of the specified radius, centered at (<em>x</em>, <em>y</em>). @param x the <em>x</em>-coordinate of the center of the circle
graph/GenerateMaze_vstar/StdDraw.java:1019
↓ 3 callers
Method
findCrossSlot
returns -1 if no cross slots
design/Mocks/Timetable.java:136
↓ 3 callers
Method
getExtCopy
(List<Integer> path, int value)
tree/PathSum_113/Solution.java:63
↓ 3 callers
Method
getHash
(Key key)
design/ImplementHashTable_SeparateChaining/SeparateChainingHashTable.java:21
↓ 3 callers
Method
getNewsFeed
Retrieve the 10 most recent tweet ids in the user's news feed. Each item in the news feed must be posted by users who the user followed or by the user
design/DesignTwitter_355/Twitter.java:100
↓ 3 callers
Method
greater
General helper functions.
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:261
↓ 3 callers
Method
hasInterview
(User userA, User userB, int dayIndex)
design/Mocks/Timetable.java:196
↓ 3 callers
Method
hashCode
()
math/MaxPointsOnALine_149/Tuple.java:15
↓ 3 callers
Method
insert
Associates key with index {@code i}. @param i an index @param key the key to associate with index {@code i} @throws IndexOutOfBoundsException unles
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:110
↓ 3 callers
Method
isIntersect
(int[] a, int[] b)
array/RangeModule_715/RangeModule.java:35
↓ 3 callers
Method
isPortionValid
(char[][] board, int xFrom, int yFrom, int xTo, int yTo)
hashtable/ValidSudoku_36/Solution2.java:51
↓ 3 callers
Method
isPortionValid
(char item, Set<Character> set)
hashtable/ValidSudoku_36/Solution1.java:34
↓ 3 callers
Method
isValid
(char item, Set<Integer> set)
hashtable/ValidSudoku_36/Solution.java:43
↓ 3 callers
Method
knows
(int a, int b)
array/FindTheCelebrity_277/Relation.java:7
↓ 3 callers
Method
makeGraph
(int numCourses, int[][] prerequisites)
graph/CourseSchedule_207/Solution.java:155
↓ 3 callers
Method
next
()
design/ZigzagIterator_281/ZigzagIterator.java:63
↓ 3 callers
Method
other
()
graph/CommutableIslands_intbit/Solution.java:118
↓ 3 callers
Method
pop
()
stack/ImplementStackUsingQueues_225/MyStack.java:36
↓ 3 callers
Method
push
(int x)
stack/ImplementStackUsingQueues_225/MyStack.java:30
↓ 3 callers
Method
put
(Key key, Value value)
design/ImplementHashTable_SeparateChaining/SeparateChainingHashTable.java:25
↓ 3 callers
Method
queryRange
(int left, int right)
array/RangeModule_715/RangeModule.java:44
↓ 3 callers
Method
reduce
(Stack<String> stack)
string/BasicCalculator2_227/Solution.java:105
↓ 3 callers
Method
remove
()
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:326
↓ 3 callers
Method
removeRange
(int left, int right)
array/RangeModule_715/RangeModule.java:52
↓ 3 callers
Method
rep
(String c, int times)
math/IntegerToRoman_12/Solution.java:39
↓ 3 callers
Method
reverse
(int[] nums, int from, int to)
array/RotateArray_189/Solution.java:28
↓ 3 callers
Method
setPenRadius
Sets the pen size to the default size (0.002). The pen is circular, so that lines have rounded ends, and when you set the pen radius and draw a point,
graph/GenerateMaze_vstar/StdDraw.java:840
↓ 3 callers
Method
setXscale
Sets the <em>x</em>-scale to be the default (between 0.0 and 1.0).
graph/GenerateMaze_vstar/StdDraw.java:727
↓ 3 callers
Method
setYscale
Sets the <em>y</em>-scale to be the default (between 0.0 and 1.0).
graph/GenerateMaze_vstar/StdDraw.java:734
↓ 3 callers
Method
top
()
stack/ImplementStackUsingQueues_225/MyStack.java:41
↓ 3 callers
Method
userX
(double x)
graph/GenerateMaze_vstar/StdDraw.java:802
↓ 3 callers
Method
userY
(double y)
graph/GenerateMaze_vstar/StdDraw.java:803
↓ 3 callers
Method
visit
(int v)
graph/CommutableIslands_intbit/Solution.java:77
↓ 3 callers
Method
weight
()
design/ImplementShortestPathTreeViaDijkstra/DirectedEdge.java:18
↓ 3 callers
Method
weight
()
graph/CommutableIslands_intbit/Solution.java:127
↓ 3 callers
Method
write
()
appTemplates/FileIO/Main.java:35
↓ 2 callers
Method
adj
(int v)
design/ImplementDigraphShortestPath/Digraph.java:27
↓ 2 callers
Method
bfs
(Digraph g, int start)
design/ImplementDigraphShortestPath/ShortestPathInDigraph.java:39
↓ 2 callers
Method
buildGraph
(int n, int[][] edges)
graph/NumberOfConnectedComponentsInAnUndirectedGraph_323/Solution.java:128
↓ 2 callers
Method
buildGraph
(String beginWord, String endWord, List<String> wordList)
graph/WordLadder_127/Solution.java:91
↓ 2 callers
Method
buildGraph
(int n, int[][] edges)
graph/GraphValidTree_261/Solution.java:94
↓ 2 callers
Method
bulkExec
(List<String> urls)
design/WebCrawler/WebCrawler.java:34
↓ 2 callers
Method
check
Check if a number is available or not.
design/DesignPhoneDirectory_379_/PhoneDirectory.java:72
↓ 2 callers
Method
check
(boolean condition, String message)
design/Mocks/User.java:48
↓ 2 callers
Method
checkIntervals
()
array/RangeModule_715/RangeModule.java:20
↓ 2 callers
Method
contains
(Key key)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:103
↓ 2 callers
Method
contains
(Key key)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:111
↓ 2 callers
Method
convertMapToList
()
tree/BinaryTreeVerticalOrderTraversal_314/Solution.java:69
↓ 2 callers
Method
convertToBase7
(int num)
math/Base7_504/Solution.java:39
↓ 2 callers
Method
delMin
Removes a minimum key and returns its associated index. @return an index associated with a minimum key @throws NoSuchElementException if this priorit
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:148
↓ 2 callers
Method
dp
(String s, int left, int right, StringBuilder builder, ArrayList<String> result, HashSet<String> dictionary)
backTracking/WordBreak2_140/Solution.java:37
↓ 2 callers
Method
drawRedPoint
(int x, int y)
graph/GenerateMaze_vstar/Maze.java:209
↓ 2 callers
Method
empty
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:86
↓ 2 callers
Method
enableDoubleBuffering
Enable double buffering. All subsequent calls to drawing methods such as {@code line()}, {@code circle()}, and {@code square()} will be deffered until
graph/GenerateMaze_vstar/StdDraw.java:1576
↓ 2 callers
Method
equals
(Object obj)
array/ShortestDistanceFromAllBuildings_317/Solution.java:148
↓ 2 callers
Method
exch
(int[] array, int i, int j)
sorting/HeapSort/HeapSort.java:33
↓ 2 callers
Method
exch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/QuickSort.java:10
↓ 2 callers
Method
exch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/QuickSelection.java:10
↓ 2 callers
Method
exch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/ThreeWayPartitioning.java:10
↓ 2 callers
Method
findOpponentsForUser
dayIndex is 0 to 6: 0 is Friday, 6 - is Thursday
design/Mocks/Timetable.java:94
↓ 2 callers
Method
getLast
(List<Integer> list)
array/MaximumDistanceInArrays_624/Solution.java:54
↓ 2 callers
Method
getLeft
(TreeNode root, boolean isLeft)
tree/SumofLeftLeaves_404/Solution.java:32
↓ 2 callers
Method
getLength
(ListNode head)
linkedList/IntersectionOfTwoLinkedLists_160/Solution.java:64
↓ 2 callers
Method
getMadian
(int[] nums)
binarySearch/MedianOfTwoSortedArrays_4/Solution.java:83
↓ 2 callers
Method
getMin
()
stack/MinStack_155/MinStack.java:70
↓ 2 callers
Method
getPath
(int w)
design/ImplementDigraphShortestPath/ShortestPathInDigraph.java:74
↓ 2 callers
Method
hasNext
()
stack/FlattenNestedListIterator_341/NestedIterator.java:57
↓ 2 callers
Method
hasNext
@return whether we have a next smallest number
tree/BinarySearchTreeIterator_173/BSTIterator.java:36
↓ 2 callers
Method
holdNeighborSlot
makes slots around ONHOLD
design/Mocks/Timetable.java:182
↓ 2 callers
Method
init
()
graph/GenerateMaze_vstar/StdDraw.java:665
↓ 2 callers
Method
initVisitedArr
()
graph/GenerateMaze_vstar/Maze.java:54
↓ 2 callers
Method
isConnected
(int v, int w)
design/ImplementConnectedComponents/ConnectedComponents.java:42
↓ 2 callers
Method
isEmpty
Returns true if this priority queue is empty. @return {@code true} if this priority queue is empty; {@code false} otherwise
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:75
↓ 2 callers
Method
isOdd
(int i)
array/WiggleSort_280/Solution.java:21
↓ 2 callers
Method
isUnique
(String word)
design/UniqueWordAbbreviation_288/ValidWordAbbr.java:57
↓ 2 callers
Method
isValid
(int k)
hashtable/LongestSubstringWithAtMostKDistinctCharacters_340/Solution.java:37
↓ 2 callers
Method
isValid
(Map<Character, Integer> map)
string/LongestSubstringWithAtMostTwoDistinctCharacters_159/Solution.java:48
↓ 2 callers
Method
isValid
(TreeNode root, Integer min, Integer max)
tree/ValidateBinarySearchTree_98/Solution.java:51
↓ 2 callers
Method
iterator
Returns an iterator that iterates over the keys on the priority queue in ascending order. The iterator doesn't implement {@code remove()} since it's o
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:306
↓ 2 callers
Method
makeGrapth
(int numCourses, int[][] prerequisites)
graph/CourseSchedule2_210/Solution.java:151
↓ 2 callers
Method
moveIfNeeded
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:90
↓ 2 callers
Method
parse
(String version)
string/CompareVersionNumbers_165/Solution.java:40
↓ 2 callers
Method
partition
(Comparable[] array, int lo, int hi)
design/QuickSort/QuickSort.java:33
↓ 2 callers
Method
partition
(int[] nums, int lo, int hi)
array/KthLargestElementInAnArray_215/Solution.java:35
↓ 2 callers
Method
postTweet
Compose a new tweet.
design/DesignTwitter_355/Twitter.java:89
↓ 2 callers
Method
pushLeftBrunch
(TreeNode root)
tree/BinarySearchTreeIterator_173/BSTIterator.java:48
↓ 2 callers
Method
putNewest
(int key, int val)
design/LRUCache_146/LRUCache.java:83
↓ 2 callers
Method
read
()
appTemplates/FileIO/Main.java:15
↓ 2 callers
Method
removeFromLinkedList
(CacheItem item)
design/LRUCache_146/LRUCache.java:66
↓ 2 callers
Method
reorderList
(ListNode head)
linkedList/ReorderList_143/Solution.java:47
↓ 2 callers
Method
right
(int[] point)
heap/TheSkylineProblem_218/Solution.java:98
↓ 2 callers
Method
scheduleInterview
(User userA, User userB, int dayIndex, int slotIndex)
design/Mocks/Timetable.java:149
↓ 2 callers
Method
scheduledInterviews
(int dayIndex)
design/Mocks/User.java:83
↓ 2 callers
Method
serialize
(TreeNode root)
dynamic/SerializeAndDeserializeBinaryTree_297/Codec.java:24
← previous
next →
101–200 of 1,412, ranked by callers