MCPcopy Create free account

hub / github.com/Semaserg/LeetCodeProblems / functions

Functions1,412 in github.com/Semaserg/LeetCodeProblems

⨍ Functions 1,412◇ Types & classes 729
↓ 1 callersMethodcountComponents
(int n, int[][] edges)
graph/NumberOfConnectedComponentsInAnUndirectedGraph_323/Solution.java:98
↓ 1 callersMethodcountNodes
(TreeNode root)
tree/CountCompleteTreeNodes_222/Solution.java:31
↓ 1 callersMethodcountNumbersWithUniqueDigits
(int n)
math/CountNumbersWithUniqueDigits_357/Solution.java:55
↓ 1 callersMethodcountPrimes
(int n)
array/CountPrimes_204/Solution.java:18
↓ 1 callersMethodcreateMenuBar
()
graph/GenerateMaze_vstar/StdDraw.java:707
↓ 1 callersMethoddecode
(String shortUrl)
hashtable/EncodeAndDecodeTinyURL_535_/Codec.java:58
↓ 1 callersMethoddecode
(String s)
string/EncodeAndDecodeStrings_271/Codec.java:55
↓ 1 callersMethoddecodeString
(String s)
stack/DecodeString_394/Solution.java:36
↓ 1 callersMethoddecreaseKey
Decrease the key associated with index {@code i} to the specified value. @param i the index of the key to decrease @param key decrease the key asso
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:212
↓ 1 callersMethoddelete
Remove the key associated with index {@code i}. @param i the index of the key to remove @throws IndexOutOfBoundsException unless {@code 0 <= i < maxN
design/ImplementShortestPathTreeViaDijkstra/IndexMinPQ.java:246
↓ 1 callersMethoddeleteDuplicates
(ListNode head)
linkedList/RemoveDuplicatesFromSortedList2_82_/Solution.java:24
↓ 1 callersMethoddeleteMax
()
design/ImplementSymbolTableViaBinarySearchTree/SymbolTable.java:97
↓ 1 callersMethoddeleteNode
(ListNode node)
linkedList/DeleteNodeInALinkedList_237/Solution.java:23
↓ 1 callersMethoddeserialize
(String s)
stack/MiniParser_385/Solution.java:71
↓ 1 callersMethoddeserialize
(String data)
dynamic/SerializeAndDeserializeBinaryTree_297/Codec.java:41
↓ 1 callersMethoddestroyIsland
(int i, int j, char[][] grid)
unionFind/NumberOfIslands_200/Solution.java:51
↓ 1 callersMethoddetectCycle
(ListNode head)
linkedList/LinkedListCycle2_142/Solution.java:32
↓ 1 callersMethoddfs
(int curr)
design/ImplementConnectedComponents/ConnectedComponents.java:30
↓ 1 callersMethoddfs
(Digraph g, int curr, LinkedList<Integer> list)
design/ImplementTopologicalSortInDigraph/DepthFirstOrder.java:25
↓ 1 callersMethoddfs
(int current, LinkedList result)
design/ImplementGraphDfs/DepthFirstSearch.java:41
↓ 1 callersMethoddfs
(int[] candidates, int target, int index, ArrayList<Integer> path, List<List<Integer>> res)
backTracking/CombinationSum2_40/Solution.java:71
↓ 1 callersMethoddfs
(int current, Queue<Integer> queue, List<Integer>[] graph, boolean[] visited, boolean[] recStack)
graph/CourseSchedule2_210/Solution.java:93
↓ 1 callersMethoddfs
(int current, LinkedList<Integer>[] graph, boolean[] visited)
graph/NumberOfConnectedComponentsInAnUndirectedGraph_323/Solution.java:88
↓ 1 callersMethoddfs
(int root)
graph/GraphTraversal_BFS_DFS_iterativeDFS/Graph.java:20
↓ 1 callersMethoddfs
(TreeNode current, TreeNode parent, int prevLength)
tree/BinaryTreeLongestConsecutiveSequence_298/Solution.java:46
↓ 1 callersMethoddfs
(int level, TreeNode current)
tree/BinaryTreeVerticalOrderTraversal_314/Solution.java:53
↓ 1 callersMethoddfs1
(String departure)
graph/ReconstructItinerary_332/Solution.java:59
↓ 1 callersMethoddfsIterative
(int root)
graph/GraphTraversal_BFS_DFS_iterativeDFS/Graph.java:38
↓ 1 callersMethoddfsRecursive
(int current, boolean[] visited, List<Integer> res)
graph/GraphTraversal_BFS_DFS_iterativeDFS/Graph.java:27
↓ 1 callersMethoddfsUtil
(Doctor start, Doctor current, int topCounter, PriorityQueue<Doctor> heap, Set<String> visited)
graph/DoctorsRating_real/Solution.java:74
↓ 1 callersMethoddigitSquareSum
(int n)
hashtable/HappyNumber_202/Solution.java:59
↓ 1 callersMethoddp
(int row, int col, int[][] grid, Set<String> visited)
array/IslandPerimeter_463_/Solution.java:69
↓ 1 callersMethoddp
(String s, int left, int right, HashSet<String> dict)
dynamic/WordBreak_139/Solution.java:34
↓ 1 callersMethoddp
(TreeNode current)
tree/BinaryTreeUpsideDown_156_/Solution.java:53
↓ 1 callersMethoddraw
()
graph/GenerateMaze_vstar/Maze.java:146
↓ 1 callersMethoddrawMaze
()
graph/GenerateMaze_vstar/Maze.java:153
↓ 1 callersMethodencode
(String longUrl)
hashtable/EncodeAndDecodeTinyURL_535_/Codec.java:49
↓ 1 callersMethodencode
(List<String> strs)
string/EncodeAndDecodeStrings_271/Codec.java:46
↓ 1 callersMethodeval
(int a, int b, char operator)
stack/EvaluateReversePolishNotation_150/Solution.java:39
↓ 1 callersMethodevalRPN
(String[] tokens)
stack/EvaluateReversePolishNotation_150/Solution.java:19
↓ 1 callersMethodexecute
(int left, int right, String sign)
string/BasicCalculator2_227/Solution.java:115
↓ 1 callersMethodexist
(char[][] board, String word)
backTracking/WordSearch_79/Solution.java:33
↓ 1 callersMethodfib
(int N)
array/FibonacciNumber_509/Solution.java:13
↓ 1 callersMethodfilledPolygon
Draws a polygon with the vertices (<em>x</em><sub>0</sub>, <em>y</em><sub>0</sub>), (<em>x</em><sub>1</sub>, <em>y</em><sub>1</sub>), ..., (<em>x</em>
graph/GenerateMaze_vstar/StdDraw.java:1224
↓ 1 callersMethodfilledSquare
Draws a filled square of the specified size, centered at (<em>x</em>, <em>y</em>). @param x the <em>x</em>-coordinate of the center of the square @p
graph/GenerateMaze_vstar/StdDraw.java:1129
↓ 1 callersMethodfinalize
(int[][] board)
array/GameOfLife_289/Solution.java:51
↓ 1 callersMethodfindCelebrity
(int n)
array/FindTheCelebrity_277/Solution.java:34
↓ 1 callersMethodfindComplement
(int num)
bitManipulation/NumberComplement_476/Solution.java:30
↓ 1 callersMethodfindDiagonalOrder
(int[][] matrix)
array/DiagonalTraverse_498/Solution.java:23
↓ 1 callersMethodfindDisappearedNumbers
(int[] nums)
array/FindAllNumbersDisappearedInAnArray_448/Solution.java:25
↓ 1 callersMethodfindDuplicate
(int[] nums)
array/FindTheDuplicateNumber_287_/Solution.java:20
↓ 1 callersMethodfindDuplicates
(int[] nums)
array/FindAllDuplicatesInAnArray_442/Solution.java:26
↓ 1 callersMethodfindIndex
(int[] inorder, int inordLeftInd, int inordRightInd, int value)
tree/ConstructBinaryTreeFromPreorderAndInorderTraversal_105/Solution.java:41
↓ 1 callersMethodfindIndexByValue
(int[] inorder, int inorderLeftInd, int inorderRightInd, int value)
tree/ConstructBinaryTreeFromInorderAndPostorderTraversal_106/Solution.java:69
↓ 1 callersMethodfindItinerary
(String[][] tickets)
graph/ReconstructItinerary_332/Solution.java:39
↓ 1 callersMethodfindKthLargest
(int[] nums, int k)
array/KthLargestElementInAnArray_215/Solution.java:65
↓ 1 callersMethodfindKthSmallest
(int[] nums, int k)
array/WiggleSort2_324/Solution.java:50
↓ 1 callersMethodfindLca
(TreeNode root, TreeNode p, TreeNode q)
tree/LowestCommonAncestorOfABinaryTree_236/Solution.java:44
↓ 1 callersMethodfindMaxConsecutiveOnes
(int[] nums)
array/MaxConsecutiveOnes_485/Solution.java:22
↓ 1 callersMethodfindMedianSortedArrays
(int[] nums1, int[] nums2)
binarySearch/MedianOfTwoSortedArrays_4/Solution.java:45
↓ 1 callersMethodfindMin
(int[] nums)
array/FindMinimumInRotatedSortedArray_153/Solution.java:29
↓ 1 callersMethodfindMinEditDistance
(String a, String b)
dynamic/LevenshteinDistance/Solution.java:11
↓ 1 callersMethodfindMinHeightTrees
(int n, int[][] edges)
graph/MinimumHeightTrees_310/Solution.java:63
↓ 1 callersMethodfindMissingRanges
(int[] nums, int lower, int upper)
array/MissingRanges_163/Solution.java:17
↓ 1 callersMethodfindOrder
(int numCourses, int[][] prerequisites)
graph/CourseSchedule2_210/Solution.java:61
↓ 1 callersMethodfindPath
(char[][] board, int i, int j, String word, int index)
backTracking/WordSearch_79/Solution.java:56
↓ 1 callersMethodfindPeakElement
(int[] nums)
array/FindPeakElement_162/Solution.java:57
↓ 1 callersMethodfindRepeatedDnaSequences
(String s)
hashtable/RepeatedDNASequences_187/Solution.java:46
↓ 1 callersMethodfindShortestSubArray
(int[] nums)
array/DegreeOfAnArray_697/Solution.java:30
↓ 1 callersMethodfindSubstring
(String s, String[] words)
hashtable/SubstringWithConcatenationOfAllWords_30/Solution.java:28
↓ 1 callersMethodfindTarget
(TreeNode root, int k)
tree/TwoSum4InputIsBST_653/Solution.java:35
↓ 1 callersMethodfindTargetRecursive
(TreeNode root, Set<Integer> set, int k)
tree/TwoSum4InputIsBST_653/Solution.java:39
↓ 1 callersMethodfindTheDifference
(String s, String t)
bitManipulation/FindTheDifference_389/Solution.java:27
↓ 1 callersMethodfindUnsortedSubarray
(int[] nums)
array/ShortestUnsortedContinuousSubarray_581/Solution.java:26
↓ 1 callersMethodfindWords
(String[] words)
hashtable/KeyboardRow_500/Solution.java:20
↓ 1 callersMethodfirstBadVersion
(int n)
binarySearch/FirstBadVersion_278/Solution.java:30
↓ 1 callersMethodfirstUniqChar
(String s)
string/FirstUniqueCharacterInAString_387/Solution.java:21
↓ 1 callersMethodfizzBuzz
(int n)
string/FizzBuzz_412/Solution.java:40
↓ 1 callersMethodflatten
(TreeNode root)
tree/FlattenBinaryTreeToLinkedList_114/Solution.java:83
↓ 1 callersMethodflipColors
(Node h)
design/ImplementRedBlackTree/LeanLeftRedBlackTree.java:60
↓ 1 callersMethodfollow
Follower follows a followee. If the operation is invalid, it should be a no-op.
design/DesignTwitter_355/Twitter.java:117
↓ 1 callersMethodfourSum
(int[] nums, int target)
array/FourSum_18/Solution.java:28
↓ 1 callersMethodfractionToDecimal
(int numerator, int denominator)
math/FractionToRecurringDecimal_166/Solution.java:80
↓ 1 callersMethodfrequencySort1
(String s)
hashtable/SortCharactersByFrequency_451_/Solution.java:71
↓ 1 callersMethodfreshCopy
(List<User> users)
design/Mocks/Solution.java:32
↓ 1 callersMethodfromArray
(String[] words)
backTracking/WordSquares_425/Trie.java:68
↓ 1 callersMethodgameOfLife
(int[][] board)
array/GameOfLife_289/Solution.java:35
↓ 1 callersMethodgen1
(int start, int end)
dynamic/UniqueBinarySearchTrees2_95/Solution.java:92
↓ 1 callersMethodgenerate
(int numRows)
array/PascalTriangle_118/Solution.java:39
↓ 1 callersMethodgenerate
(int x, int y)
graph/GenerateMaze_vstar/Maze.java:107
↓ 1 callersMethodgenerateKey
()
hashtable/EncodeAndDecodeTinyURL_535_/Codec.java:63
↓ 1 callersMethodgenerateMatrix
(int n)
array/SpiralMatrix2_59/Solution.java:24
↓ 1 callersMethodgenerateParenthesis
(int n)
string/GenerateParentheses_22/Solution.java:56
↓ 1 callersMethodgenerateParenthesisRecursive
(List<String> res, String current, int leftCnt, int rightCnt)
string/GenerateParentheses_22/Solution.java:41
↓ 1 callersMethodgenerateRecursive
(List<List<Integer>> arr, int num)
array/PascalTriangle_118/Solution.java:25
↓ 1 callersMethodgenerateTimetable
(List<User> users)
design/Mocks/Timetable.java:19
↓ 1 callersMethodgenerateTimetableCandidates
(String[] userRecords)
design/Mocks/Solution.java:9
↓ 1 callersMethodgenerateTrees
(int n)
dynamic/UniqueBinarySearchTrees2_95/Solution.java:34
↓ 1 callersMethodgetBoxSet
(int rowStart, int colStart)
backTracking/SudokuSolver_37/Solution.java:95
↓ 1 callersMethodgetByPrefix
(String prefix)
backTracking/WordSquares_425/Trie.java:49
← previousnext →301–400 of 1,412, ranked by callers