MCPcopy Create free account

hub / github.com/Semaserg/LeetCodeProblems / functions

Functions1,412 in github.com/Semaserg/LeetCodeProblems

↓ 3 callersMethodcalcAbbr
(String word)
design/UniqueWordAbbreviation_288/ValidWordAbbr.java:62
↓ 3 callersMethoddeleteMin
()
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:83
↓ 3 callersMethoddigitToStr
(int digit, String one, String five, String ten)
math/IntegerToRoman_12/Solution.java:31
↓ 3 callersMethodeither
(int v)
graph/CommutableIslands_intbit/Solution.java:122
↓ 3 callersMethodexch
(int i, int j)
design/ImplementPriorityQueue/MyPriorityQueue.java:20
↓ 3 callersMethodfactorial
(int n)
heap/WaysToFormMaxHeap_intbit/Solution.java:89
↓ 3 callersMethodfilledCircle
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 callersMethodfindCrossSlot
returns -1 if no cross slots
design/Mocks/Timetable.java:136
↓ 3 callersMethodgetExtCopy
(List<Integer> path, int value)
tree/PathSum_113/Solution.java:63
↓ 3 callersMethodgetHash
(Key key)
design/ImplementHashTable_SeparateChaining/SeparateChainingHashTable.java:21
↓ 3 callersMethodgetNewsFeed
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 callersMethodgreater
General helper functions.
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:261
↓ 3 callersMethodhasInterview
(User userA, User userB, int dayIndex)
design/Mocks/Timetable.java:196
↓ 3 callersMethodhashCode
()
math/MaxPointsOnALine_149/Tuple.java:15
↓ 3 callersMethodinsert
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 callersMethodisIntersect
(int[] a, int[] b)
array/RangeModule_715/RangeModule.java:35
↓ 3 callersMethodisPortionValid
(char[][] board, int xFrom, int yFrom, int xTo, int yTo)
hashtable/ValidSudoku_36/Solution2.java:51
↓ 3 callersMethodisPortionValid
(char item, Set<Character> set)
hashtable/ValidSudoku_36/Solution1.java:34
↓ 3 callersMethodisValid
(char item, Set<Integer> set)
hashtable/ValidSudoku_36/Solution.java:43
↓ 3 callersMethodknows
(int a, int b)
array/FindTheCelebrity_277/Relation.java:7
↓ 3 callersMethodmakeGraph
(int numCourses, int[][] prerequisites)
graph/CourseSchedule_207/Solution.java:155
↓ 3 callersMethodnext
()
design/ZigzagIterator_281/ZigzagIterator.java:63
↓ 3 callersMethodother
()
graph/CommutableIslands_intbit/Solution.java:118
↓ 3 callersMethodpop
()
stack/ImplementStackUsingQueues_225/MyStack.java:36
↓ 3 callersMethodpush
(int x)
stack/ImplementStackUsingQueues_225/MyStack.java:30
↓ 3 callersMethodput
(Key key, Value value)
design/ImplementHashTable_SeparateChaining/SeparateChainingHashTable.java:25
↓ 3 callersMethodqueryRange
(int left, int right)
array/RangeModule_715/RangeModule.java:44
↓ 3 callersMethodreduce
(Stack<String> stack)
string/BasicCalculator2_227/Solution.java:105
↓ 3 callersMethodremove
()
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:326
↓ 3 callersMethodremoveRange
(int left, int right)
array/RangeModule_715/RangeModule.java:52
↓ 3 callersMethodrep
(String c, int times)
math/IntegerToRoman_12/Solution.java:39
↓ 3 callersMethodreverse
(int[] nums, int from, int to)
array/RotateArray_189/Solution.java:28
↓ 3 callersMethodsetPenRadius
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 callersMethodsetXscale
Sets the <em>x</em>-scale to be the default (between 0.0 and 1.0).
graph/GenerateMaze_vstar/StdDraw.java:727
↓ 3 callersMethodsetYscale
Sets the <em>y</em>-scale to be the default (between 0.0 and 1.0).
graph/GenerateMaze_vstar/StdDraw.java:734
↓ 3 callersMethodtop
()
stack/ImplementStackUsingQueues_225/MyStack.java:41
↓ 3 callersMethoduserX
(double x)
graph/GenerateMaze_vstar/StdDraw.java:802
↓ 3 callersMethoduserY
(double y)
graph/GenerateMaze_vstar/StdDraw.java:803
↓ 3 callersMethodvisit
(int v)
graph/CommutableIslands_intbit/Solution.java:77
↓ 3 callersMethodweight
()
design/ImplementShortestPathTreeViaDijkstra/DirectedEdge.java:18
↓ 3 callersMethodweight
()
graph/CommutableIslands_intbit/Solution.java:127
↓ 3 callersMethodwrite
()
appTemplates/FileIO/Main.java:35
↓ 2 callersMethodadj
(int v)
design/ImplementDigraphShortestPath/Digraph.java:27
↓ 2 callersMethodbfs
(Digraph g, int start)
design/ImplementDigraphShortestPath/ShortestPathInDigraph.java:39
↓ 2 callersMethodbuildGraph
(int n, int[][] edges)
graph/NumberOfConnectedComponentsInAnUndirectedGraph_323/Solution.java:128
↓ 2 callersMethodbuildGraph
(String beginWord, String endWord, List<String> wordList)
graph/WordLadder_127/Solution.java:91
↓ 2 callersMethodbuildGraph
(int n, int[][] edges)
graph/GraphValidTree_261/Solution.java:94
↓ 2 callersMethodbulkExec
(List<String> urls)
design/WebCrawler/WebCrawler.java:34
↓ 2 callersMethodcheck
Check if a number is available or not.
design/DesignPhoneDirectory_379_/PhoneDirectory.java:72
↓ 2 callersMethodcheck
(boolean condition, String message)
design/Mocks/User.java:48
↓ 2 callersMethodcheckIntervals
()
array/RangeModule_715/RangeModule.java:20
↓ 2 callersMethodcontains
(Key key)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:103
↓ 2 callersMethodcontains
(Key key)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:111
↓ 2 callersMethodconvertMapToList
()
tree/BinaryTreeVerticalOrderTraversal_314/Solution.java:69
↓ 2 callersMethodconvertToBase7
(int num)
math/Base7_504/Solution.java:39
↓ 2 callersMethoddelMin
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 callersMethoddp
(String s, int left, int right, StringBuilder builder, ArrayList<String> result, HashSet<String> dictionary)
backTracking/WordBreak2_140/Solution.java:37
↓ 2 callersMethoddrawRedPoint
(int x, int y)
graph/GenerateMaze_vstar/Maze.java:209
↓ 2 callersMethodempty
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:86
↓ 2 callersMethodenableDoubleBuffering
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 callersMethodequals
(Object obj)
array/ShortestDistanceFromAllBuildings_317/Solution.java:148
↓ 2 callersMethodexch
(int[] array, int i, int j)
sorting/HeapSort/HeapSort.java:33
↓ 2 callersMethodexch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/QuickSort.java:10
↓ 2 callersMethodexch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/QuickSelection.java:10
↓ 2 callersMethodexch
(List<Integer> list, int indexA, int indexB)
sorting/QuickSort/ThreeWayPartitioning.java:10
↓ 2 callersMethodfindOpponentsForUser
dayIndex is 0 to 6: 0 is Friday, 6 - is Thursday
design/Mocks/Timetable.java:94
↓ 2 callersMethodgetLast
(List<Integer> list)
array/MaximumDistanceInArrays_624/Solution.java:54
↓ 2 callersMethodgetLeft
(TreeNode root, boolean isLeft)
tree/SumofLeftLeaves_404/Solution.java:32
↓ 2 callersMethodgetLength
(ListNode head)
linkedList/IntersectionOfTwoLinkedLists_160/Solution.java:64
↓ 2 callersMethodgetMadian
(int[] nums)
binarySearch/MedianOfTwoSortedArrays_4/Solution.java:83
↓ 2 callersMethodgetMin
()
stack/MinStack_155/MinStack.java:70
↓ 2 callersMethodgetPath
(int w)
design/ImplementDigraphShortestPath/ShortestPathInDigraph.java:74
↓ 2 callersMethodhasNext
()
stack/FlattenNestedListIterator_341/NestedIterator.java:57
↓ 2 callersMethodhasNext
@return whether we have a next smallest number
tree/BinarySearchTreeIterator_173/BSTIterator.java:36
↓ 2 callersMethodholdNeighborSlot
makes slots around ONHOLD
design/Mocks/Timetable.java:182
↓ 2 callersMethodinit
()
graph/GenerateMaze_vstar/StdDraw.java:665
↓ 2 callersMethodinitVisitedArr
()
graph/GenerateMaze_vstar/Maze.java:54
↓ 2 callersMethodisConnected
(int v, int w)
design/ImplementConnectedComponents/ConnectedComponents.java:42
↓ 2 callersMethodisEmpty
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 callersMethodisOdd
(int i)
array/WiggleSort_280/Solution.java:21
↓ 2 callersMethodisUnique
(String word)
design/UniqueWordAbbreviation_288/ValidWordAbbr.java:57
↓ 2 callersMethodisValid
(int k)
hashtable/LongestSubstringWithAtMostKDistinctCharacters_340/Solution.java:37
↓ 2 callersMethodisValid
(Map<Character, Integer> map)
string/LongestSubstringWithAtMostTwoDistinctCharacters_159/Solution.java:48
↓ 2 callersMethodisValid
(TreeNode root, Integer min, Integer max)
tree/ValidateBinarySearchTree_98/Solution.java:51
↓ 2 callersMethoditerator
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 callersMethodmakeGrapth
(int numCourses, int[][] prerequisites)
graph/CourseSchedule2_210/Solution.java:151
↓ 2 callersMethodmoveIfNeeded
()
stack/ImplementQueueUsingStacks_232/MyQueue.java:90
↓ 2 callersMethodparse
(String version)
string/CompareVersionNumbers_165/Solution.java:40
↓ 2 callersMethodpartition
(Comparable[] array, int lo, int hi)
design/QuickSort/QuickSort.java:33
↓ 2 callersMethodpartition
(int[] nums, int lo, int hi)
array/KthLargestElementInAnArray_215/Solution.java:35
↓ 2 callersMethodpostTweet
Compose a new tweet.
design/DesignTwitter_355/Twitter.java:89
↓ 2 callersMethodpushLeftBrunch
(TreeNode root)
tree/BinarySearchTreeIterator_173/BSTIterator.java:48
↓ 2 callersMethodputNewest
(int key, int val)
design/LRUCache_146/LRUCache.java:83
↓ 2 callersMethodread
()
appTemplates/FileIO/Main.java:15
↓ 2 callersMethodremoveFromLinkedList
(CacheItem item)
design/LRUCache_146/LRUCache.java:66
↓ 2 callersMethodreorderList
(ListNode head)
linkedList/ReorderList_143/Solution.java:47
↓ 2 callersMethodright
(int[] point)
heap/TheSkylineProblem_218/Solution.java:98
↓ 2 callersMethodscheduleInterview
(User userA, User userB, int dayIndex, int slotIndex)
design/Mocks/Timetable.java:149
↓ 2 callersMethodscheduledInterviews
(int dayIndex)
design/Mocks/User.java:83
↓ 2 callersMethodserialize
(TreeNode root)
dynamic/SerializeAndDeserializeBinaryTree_297/Codec.java:24
← previousnext →101–200 of 1,412, ranked by callers