MCPcopy Create free account

hub / github.com/Semaserg/LeetCodeProblems / functions

Functions1,412 in github.com/Semaserg/LeetCodeProblems

⨍ Functions 1,412◇ Types & classes 729
↓ 1 callersMethodgetCellValue
(char item)
hashtable/ValidSudoku_36/Solution.java:38
↓ 1 callersMethodgetColSet
(int col)
backTracking/SudokuSolver_37/Solution.java:86
↓ 1 callersMethodgetCombination
(int[] candidates, int target, int index, LinkedList<Integer> list, List<List<Integer>> result)
backTracking/CombinationSum_39/Solution.java:39
↓ 1 callersMethodgetEdges
(int row, int col, int[][] grid)
array/IslandPerimeter_463_/Solution.java:37
↓ 1 callersMethodgetFreeNeighbors
()
array/ShortestDistanceFromAllBuildings_317/Solution.java:110
↓ 1 callersMethodgetFullSet
()
backTracking/SudokuSolver_37/Solution.java:72
↓ 1 callersMethodgetIndegrees
(int numCourses, int[][] prerequisites)
graph/CourseSchedule_207/Solution.java:145
↓ 1 callersMethodgetIndegrees
(int numCourses, int[][] prerequisites)
graph/CourseSchedule2_210/Solution.java:164
↓ 1 callersMethodgetInteger
()
stack/FlattenNestedListIterator_341/NestedInteger.java:28
↓ 1 callersMethodgetIntersectionNode
(ListNode headA, ListNode headB)
linkedList/IntersectionOfTwoLinkedLists_160/Solution.java:41
↓ 1 callersMethodgetIsStart
()
heap/TheSkylineProblem_218/Solution.java:115
↓ 1 callersMethodgetItemBeforeMiddle
(ListNode head)
linkedList/ReorderList_143/Solution.java:56
↓ 1 callersMethodgetItems
()
design/ImplementGraphBfs/BreadthFirstSearch.java:28
↓ 1 callersMethodgetItems
()
design/ImplementGraphDfs/DepthFirstSearch.java:27
↓ 1 callersMethodgetKthElement
(List<Integer> list, int k)
sorting/QuickSort/QuickSelection.java:38
↓ 1 callersMethodgetList
()
stack/FlattenNestedListIterator_341/NestedInteger.java:32
↓ 1 callersMethodgetMin
(int row, int col, List<List<Integer>> triangle)
array/Triangle_120/Solution.java:89
↓ 1 callersMethodgetNotEmptyIndexes
(int[] arr)
array/SparseMatrixMultiplication_311/Solution.java:46
↓ 1 callersMethodgetPath
(int endVertex)
design/ImplementGraphBfs/BreadthFirstSearch.java:32
↓ 1 callersMethodgetPath
(int endVertex)
design/ImplementGraphDfs/DepthFirstSearch.java:31
↓ 1 callersMethodgetPivot
(int[] nums)
array/SearchInRotatedSortedArray_33/Solution.java:48
↓ 1 callersMethodgetPrefix
(String first, String second)
string/LongestCommonPrefix_14/Solution.java:22
↓ 1 callersMethodgetRandom
()
linkedList/LinkedListRandomNode_382/Solution.java:52
↓ 1 callersMethodgetResult
(int[] candidates, int target, int index, LinkedList<Integer> list, List<List<Integer>> result)
backTracking/CombinationSum_39/Solution.java:63
↓ 1 callersMethodgetRoot
(HashMap<Character,Integer> inDegree)
graph/AlienDictionary_269/Solution.java:100
↓ 1 callersMethodgetRowSet
(int row)
backTracking/SudokuSolver_37/Solution.java:78
↓ 1 callersMethodgetSkyline
(int[][] buildings)
heap/TheSkylineProblem_218/Solution.java:66
↓ 1 callersMethodgetSum
(int a, int b)
bitManipulation/SumOfTwoIntegers_371/Solution.java:31
↓ 1 callersMethodgetSum
(int row, int col, List<Integer> indexes, int[][] A, int[][] B)
array/SparseMatrixMultiplication_311/Solution.java:54
↓ 1 callersMethodgetTokens
(String s)
string/BasicCalculator2_227/Solution.java:81
↓ 1 callersMethodgetTopDoctorsBFS
(Doctor doctor, int topCounter)
graph/DoctorsRating_real/Solution.java:14
↓ 1 callersMethodgetTopDoctorsDFS
(Doctor doctor, int topCounter)
graph/DoctorsRating_real/Solution.java:52
↓ 1 callersMethodgetTopologicalOrder
()
design/ImplementTopologicalSortInDigraph/DepthFirstOrder.java:35
↓ 1 callersMethodgroupAnagrams
(String[] strs)
hashtable/GroupAnagrams_49/Solution.java:27
↓ 1 callersMethodguess
(int num)
binarySearch/GuessNumberHigherOrLower_374/Solution.java:47
↓ 1 callersMethodguessNumber
(int n)
binarySearch/GuessNumberHigherOrLower_374/Solution.java:30
↓ 1 callersMethodhIndex
(int[] citations)
array/HIndex_274/Solution.java:51
↓ 1 callersMethodhammingDistance
(int x, int y)
bitManipulation/HammingDistance_461/Solution.java:30
↓ 1 callersMethodhammingWeight
(int n)
bitManipulation/NumberOfOneBits_191/Solution.java:17
↓ 1 callersMethodhasCycle
(int current, boolean[] visited, boolean[] recStack, List<Integer>[] graph)
graph/CourseSchedule_207/Solution.java:95
↓ 1 callersMethodhasData
(char item)
hashtable/ValidSudoku_36/Solution.java:34
↓ 1 callersMethodhasFreeSlots
()
design/Mocks/UserDaySchedule.java:75
↓ 1 callersMethodhasNext
()
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:322
↓ 1 callersMethodhasPathSum
(TreeNode root, int sum)
tree/PathSum_112/Solution.java:32
↓ 1 callersMethodhasValue
()
backTracking/WordSquares_425/Trie.java:17
↓ 1 callersMethodhashCode
()
array/ShortestDistanceFromAllBuildings_317/Solution.java:143
↓ 1 callersMethodheight
(int[] point)
heap/TheSkylineProblem_218/Solution.java:99
↓ 1 callersMethodhelper
(int part)
string/IntegerToEnglishWords_273/Solution.java:44
↓ 1 callersMethodhelper
(List<String> results, String expression, String num, int target, int position, long curr, long multiplied)
dynamic/ExpressionAddOperators_282/Solution.java:31
↓ 1 callersMethodinit
()
graph/GenerateMaze_vstar/Maze.java:36
↓ 1 callersMethodinorder
(Node curr, LinkedList<Key> list)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:146
↓ 1 callersMethodinorder
(Node current, LinkedList<Key> list)
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:156
↓ 1 callersMethodinorderSuccessor
(TreeNode root, TreeNode p)
tree/InorderSuccessorInBST_285_/Solution.java:26
↓ 1 callersMethodinorderTraversal
(TreeNode root)
stack/BinaryTreeInorderTraversal_94/Solution.java:47
↓ 1 callersMethodinputValidation
(char[][] board)
hashtable/ValidSudoku_36/Solution2.java:18
↓ 1 callersMethodinputValidation
(char[][] board)
hashtable/ValidSudoku_36/Solution1.java:18
↓ 1 callersMethodinputValidation
(char[][] board)
hashtable/ValidSudoku_36/Solution.java:18
↓ 1 callersMethodinsertionSortList
(ListNode head)
linkedList/InsertionSortList_147/Solution.java:23
↓ 1 callersMethodintToRoman
(int num)
math/IntegerToRoman_12/Solution.java:16
↓ 1 callersMethodintegerBreak
(int n)
math/IntegerBreak_343/Solution.java:17
↓ 1 callersMethodintersect
(int[] nums1, int[] nums2)
array/IntersectionOfTwoArrays2_350/Solution.java:39
↓ 1 callersMethodintersection
(int[] nums1, int[] nums2)
hashtable/IntersectionOfTwoArrays_349/Solution.java:20
↓ 1 callersMethodisAnagram
(HashMap<Character, Integer> map, String a, String b)
hashtable/GroupAnagrams_49/Solution.java:76
↓ 1 callersMethodisAnagram
(String s, String t)
hashtable/ValidAnagram_242/Solution.java:25
↓ 1 callersMethodisBadVersion
(int version)
binarySearch/FirstBadVersion_278/Solution.java:41
↓ 1 callersMethodisBalanced
(TreeNode root)
tree/BalancedBinaryTree_110/Solution.java:28
↓ 1 callersMethodisBodyCrash
()
design/SnakeGame_353/SnakeGame.java:119
↓ 1 callersMethodisBoundaryCrash
()
design/SnakeGame_353/SnakeGame.java:113
↓ 1 callersMethodisBuilding
()
array/ShortestDistanceFromAllBuildings_317/Solution.java:139
↓ 1 callersMethodisCellDataValid
(char item)
hashtable/ValidSudoku_36/Solution2.java:25
↓ 1 callersMethodisCellDataValid
(char item)
hashtable/ValidSudoku_36/Solution1.java:25
↓ 1 callersMethodisCellDataValid
(char item)
hashtable/ValidSudoku_36/Solution.java:25
↓ 1 callersMethodisClose
(Character c)
string/ValidParentheses_20/Solution.java:35
↓ 1 callersMethodisCycle
(List<Integer>[] g, int curr, boolean[] visited, boolean[] recStack)
graph/CourseSchedule_207/Solution.java:67
↓ 1 callersMethodisCycle
(int current, int parent, LinkedList<Integer>[] graph, boolean[] visited)
graph/GraphValidTree_261/Solution.java:50
↓ 1 callersMethodisEmpty
()
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:116
↓ 1 callersMethodisEmpty
()
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:122
↓ 1 callersMethodisFood
(Point point)
design/SnakeGame_353/SnakeGame.java:130
↓ 1 callersMethodisHappy
(int n)
hashtable/HappyNumber_202/Solution.java:44
↓ 1 callersMethodisInteger
()
stack/FlattenNestedListIterator_341/NestedInteger.java:24
↓ 1 callersMethodisIsomorphic
(String s, String t)
hashtable/IsomorphicStrings_205/Solution.java:29
↓ 1 callersMethodisMatch
(String s, String p)
string/RegularExpressionMatching_10/Solution.java:30
↓ 1 callersMethodisMatch
(Character open, Character close)
string/ValidParentheses_20/Solution.java:39
↓ 1 callersMethodisMatch
Algorithm: build matrix new boolean[s.len + 1][p.len + 1]; 1. fill dp[0][0] == true. Fill first column using next rule true if current is and prev-pre
dynamic/RegularExpressionMatching_10/Solution.java:45
↓ 1 callersMethodisMatch
(String s, String p)
dynamic/WildcardMatching_44/Solution.java:30
↓ 1 callersMethodisOneCharDist
(String first, String second)
graph/WordLadder_127/Solution.java:159
↓ 1 callersMethodisOneEditDistance
(String s, String t)
string/OneEditDistance_161/Solution.java:16
↓ 1 callersMethodisOpen
(Character c)
string/ValidParentheses_20/Solution.java:31
↓ 1 callersMethodisOperator
(String s)
stack/EvaluateReversePolishNotation_150/Solution.java:35
↓ 1 callersMethodisOverlap
(Interval first, Interval second)
array/MergeIntervals_56/Solution.java:16
↓ 1 callersMethodisPalindrome
(ListNode head)
linkedList/PalindromeLinkedList_234/Solution.java:61
↓ 1 callersMethodisPalindrome
(String s)
string/ValidPalindrome_125/Solution.java:46
↓ 1 callersMethodisPalindrome
(int x)
math/PalindromeNumber_9/Solution.java:45
↓ 1 callersMethodisPerfectSquare
(int num)
math/ValidPerfectSquare_367/Solution.java:22
↓ 1 callersMethodisPowerOfFour
(int num)
bitManipulation/PowerOfFour_342/Solution.java:20
↓ 1 callersMethodisPowerOfTwo
(int n)
bitManipulation/PowerOfTwo_231/Solution.java:31
↓ 1 callersMethodisReflected
(int[][] points)
math/LineReflection_356/Solution.java:30
↓ 1 callersMethodisSectionValid
(String section)
backTracking/RestoreIPAddresses_93_/Solution.java:46
↓ 1 callersMethodisSelfCrossing
(int[] x)
math/SelfCrossing_335/Solution.java:67
↓ 1 callersMethodisShipStart
(int row, int col, char[][] board)
array/BattleshipsInABoard_419_/Solution.java:46
← previousnext →401–500 of 1,412, ranked by callers