MCPcopy Create free account

hub / github.com/Cee/Leetcode / functions

Functions840 in github.com/Cee/Leetcode

⨍ Functions 840◇ Types & classes 540
↓ 326 callersMethodadd
(int val)
703 - Kth Largest Element in a Stream.java:14
↓ 286 callersMethodget
(int key)
146 - LRU Cache.java:56
↓ 162 callersMethodput
(int key, int value)
146 - LRU Cache.java:66
↓ 82 callersMethodisEmpty
Checks whether the circular queue is empty or not.
622 - Design Circular Queue.java:43
↓ 73 callersMethodcontains
(TreeNode t)
814 - Binary Tree Pruning.java:16
↓ 46 callersMethodmin
(int[][] dis, boolean[] visited, int k)
913 - Cat and Mouse.java:3
↓ 40 callersMethodpeek
()
284 - Peeking Iterator.java:16
↓ 40 callersMethodpush
(int x)
155 - Min Stack.java:11
↓ 36 callersMethodremove
Removes the mapping of the specified value key if this map contains a mapping for the key
706 - Design HashMap.java:23
↓ 35 callersMethodpop
()
155 - Min Stack.java:18
↓ 10 callersMethodintValue
(char c)
642 - Design Search Autocomplete System.java:17
↓ 9 callersMethodgetValue
(String var)
736 - Parse Lisp Expression.java:72
↓ 6 callersMethodempty
Returns whether the queue is empty.
232 - Implement Queue using Stacks.java:33
↓ 6 callersMethodreverse
(int x)
7 - Reverse Integer.java:2
↓ 5 callersMethodintValue
(char c)
642 - Design Search Autocomplete System (with HashMap).java:20
↓ 5 callersMethodnext
(int n)
900 - RLE Iterator.java:20
↓ 5 callersMethodrep
(int i, int j)
54 - Spiral Matrix.java:65
↓ 4 callersMethoddfs
(char[][] visited, int i, int j, int n, int m, Set<Integer> set)
130 - Surrounded Regions.java:45
↓ 4 callersMethodfind
(String s)
399 - Evaluate Division.java:44
↓ 4 callersMethodfind
(int i)
261 - Graph Valid Tree.java:11
↓ 4 callersMethodfind
(int i)
803 - Bricks Falling When Hit.java:14
↓ 4 callersMethodfind
(String s)
PDF/399.java:44
↓ 3 callersMethodcount
(char c)
639 - Decode Ways II.java:26
↓ 3 callersMethodfind
(int i)
305 - Number of Islands II.java:15
↓ 3 callersMethodfind
(String s, Map<String, String> p)
721 - Accounts Merge.java:38
↓ 3 callersMethodgetClonedNode
(RandomListNode head)
138 - Copy List with Random Pointer.java:36
↓ 3 callersMethodpop
()
716 - Max Stack.java:17
↓ 3 callersMethodremove
(Node n)
146 - LRU Cache.java:22
↓ 3 callersMethodstartsWith
Returns if there is any word in the trie that starts with the given prefix.
208 - Implement Trie (Prefix Tree).java:41
↓ 3 callersMethodswap
(int[] nums, int lo, int hi)
189 - Rotate Array.java:10
↓ 2 callersMethodadd
(Node n)
146 - LRU Cache.java:13
↓ 2 callersMethodblock
(int i, int j)
36 - Valid Sudoku.java:28
↓ 2 callersMethodcollect
(TreeNode node)
652 - Find Duplicate Subtrees.java:20
↓ 2 callersMethoddepth
(TreeNode root)
110 - Balanced Binary Tree.java:18
↓ 2 callersMethoddfs
(String from, String to, List<List<String>> list, Map<String, List
126 - Word Ladder II.java:44
↓ 2 callersMethoddfs
(TreeNode node, List<Integer> leafValues)
872 - Leaf-Similar Trees.java:19
↓ 2 callersMethoddfs
(int[][] grid, int x, int y, UnionFind uf)
803 - Bricks Falling When Hit.java:62
↓ 2 callersMethodextendPalindrome
(String s, int left, int right)
647 - Palindromic Substrings.java:13
↓ 2 callersMethodfind
(int i)
684 - Redundant Connection.java:11
↓ 2 callersMethodfind
(int n)
323 - Number of Connected Components in an Undirected Graph.java:11
↓ 2 callersMethodgcd
(int x, int y)
365 - Water and Jug Problem.java:8
↓ 2 callersMethodgetMin
(List<Integer> list)
296 - Best Meeting Point.java:21
↓ 2 callersMethodgetToken
(String s)
736 - Parse Lisp Expression.java:81
↓ 2 callersMethodhasNext
()
284 - Peeking Iterator.java:29
↓ 2 callersMethodhead
(Node n)
146 - LRU Cache.java:27
↓ 2 callersMethodheight
(TreeNode root)
222 - Count Complete Tree Nodes.java:28
↓ 2 callersMethodinsert
(Trie t, String s, int times)
642 - Design Search Autocomplete System (with HashMap).java:24
↓ 2 callersMethodinsert
(Trie t, String s, int times)
642 - Design Search Autocomplete System.java:21
↓ 2 callersMethodinsert
(List<Interval> intervals, Interval newInterval)
57 - Insert Interval.java:11
↓ 2 callersMethodinsert
(String s, int times)
642 - Design Search Autocomplete System (without Trie).java:6
↓ 2 callersMethodisPalindrome
(long x)
906 - Super Palindromes.java:50
↓ 2 callersMethodisPalindrome
(String s, int i, int j)
336 - Palindrome Pairs.java:50
↓ 2 callersMethodisPalindromeRange
(String s, int i, int j)
680 - Valid Palindrome II.java:2
↓ 2 callersMethodmatches
(int[] s1map, int[] s2map)
567 - Permutation in String.java:17
↓ 2 callersMethodmove
(int timestamp)
362 - Design Hit Counter.java:33
↓ 2 callersMethodmove
Player {player} makes a move at ({row}, {col}). @param row The row of the board. @param col The column of the board. @param pl
348 - Design Tic-Tac-Toe.java:25
↓ 2 callersMethodpop
Removes the element from in front of queue and returns that element.
232 - Implement Queue using Stacks.java:23
↓ 2 callersMethodpos
(int i, int j, int m)
130 - Surrounded Regions.java:41
↓ 2 callersMethodpresentation
(String s)
288 - Unique Word Abbreviation.java:20
↓ 2 callersMethodpush
(int x)
716 - Max Stack.java:11
↓ 2 callersMethodrepresentation
(String s)
809 - Expressive Words.java:8
↓ 2 callersMethodreverse
(char[] arr, int i, int j)
151 - Reverse Words in a String.java:29
↓ 2 callersMethodswap
(int[] arr, int i, int j)
215 - Kth Largest Element in an Array.java:25
↓ 2 callersMethodswap
(int[] nums, int i, int j)
280 - Wiggle Sort.java:18
↓ 2 callersMethodswap
(int[] nums, int i, int j)
31 - Next Permutation.java:26
↓ 2 callersMethodswap
(char[] str, int i, int j)
186 - Reverse Words in a String II.java:15
↓ 2 callersMethodswap
(int[] nums, int i, int j)
75 - Sort Colors.java:18
↓ 2 callersMethodswap
(char[] a, int i, int j)
556 - Next Greater Element III.java:30
↓ 2 callersMethodswap
(int[][] matrix, int x0, int y0, int x1, int y1)
48 - Rotate Image.java:18
↓ 2 callersMethodunion
(int i, int j)
803 - Bricks Falling When Hit.java:22
↓ 2 callersMethodvalid
(char a, char b)
91 - Decode Ways.java:23
↓ 1 callersMethodabbr
(String s)
527 - Word Abbreviation.java:28
↓ 1 callersMethodadd
(String s)
211 - Add and Search Word - Data structure design.java:18
↓ 1 callersMethodbacktrack
(String cur, int open, int close, int max)
22 - Generate Parentheses.java:9
↓ 1 callersMethodbacktrack
(TreeNode node, int depth)
111 - Minimum Depth of Binary Tree.java:19
↓ 1 callersMethodbacktrack
(List<Integer> current, int[] nums, int lo)
90 - Subsets II.java:10
↓ 1 callersMethodbacktrack
(List<Integer> current, int[] nums, int lo)
78 - Subsets.java:10
↓ 1 callersMethodbacktrack
(Robot robot, Set<String> set, int i, int j, int dir)
489 - Robot Room Cleaner.java:29
↓ 1 callersMethodbacktrack
(List<Integer> current, int[] nums)
47 - Permutations II.java:12
↓ 1 callersMethodbacktrack
(List<Integer> current, int[] nums)
46 - Permutations.java:9
↓ 1 callersMethodbalanced
(int lo, int hi)
109 - Convert Sorted List to Binary Search Tree.java:31
↓ 1 callersMethodbfs
(Tuple root, int k, int[][] dist, int[][] grid, int m, int n)
317 - Shortest Distance from All Buildings.java:44
↓ 1 callersMethodbuild
(int[] nums, int start, int end)
915 - Partition Array into Disjoint Intervals.java:19
↓ 1 callersMethodbuild
(int[] nums, int start, int end)
84 - Largest Rectangle in Histogram.java:59
↓ 1 callersMethodbuildTree
(int[] nums, int start, int end)
SegmentTree.java:19
↓ 1 callersMethodbuildTrie
(String[] words)
212 - Word Search II.java:30
↓ 1 callersMethodcalculateArea
(int[] heights, int start, int end)
84 - Largest Rectangle in Histogram.java:24
↓ 1 callersMethodcalculateMax
(int[] heights, SegmentTree root, int start, int end)
84 - Largest Rectangle in Histogram.java:93
↓ 1 callersMethodcanRoll
(int[][] maze, int row, int col)
490 - The Maze.java:33
↓ 1 callersMethodcheck
(int n)
728 - Self Dividing Numbers.java:12
↓ 1 callersMethodcompare
(Log o1, Log o2)
937 - Reorder Log Files.java:26
↓ 1 callersMethodconstruct
(char[][] board)
51 - N-Queens.java:42
↓ 1 callersMethodcount
()
305 - Number of Islands II.java:32
↓ 1 callersMethodcount
()
323 - Number of Connected Components in an Undirected Graph.java:26
↓ 1 callersMethodcrackSafeFrom
(StringBuilder result, int n, int k, int total, Set<String> visited)
753 - Cracking the Safe.java:14
↓ 1 callersMethoddepth
(TreeNode node)
543 - Diameter of Binary Tree.java:17
↓ 1 callersMethoddfs
(int[][] grid, int i, int j, int row, int col)
694 - Number of Distinct Islands.java:24
↓ 1 callersMethoddfs
(int[] p, List<List<Integer>> special, int[] amount, int i, int n, int total)
638 - Shopping Offers.java:19
↓ 1 callersMethoddfs
(TreeNode node, TreeNode parent)
863 - All Nodes Distance K in Binary Tree.java:55
↓ 1 callersMethoddfs
(String[] words, int n, int k, String prefix, List<String> current)
425 - Word Squares.java:14
next →1–100 of 840, ranked by callers