MCPcopy Create free account

hub / github.com/Cee/Leetcode / functions

Functions840 in github.com/Cee/Leetcode

⨍ Functions 840◇ Types & classes 540
↓ 1 callersMethodsearchPrefix
(String prefix)
745 - Prefix and Suffix Search.java:47
↓ 1 callersMethodsearchSuffix
(String suffix)
745 - Prefix and Suffix Search.java:59
↓ 1 callersMethodsplitThePixels
(List<String> pixels)
Coursera/Split the pixels.java:26
↓ 1 callersMethodsubsetSum
(int[] nums, int s)
494 - Target Sum.java:10
↓ 1 callersMethodsum
(int idx)
315 - Count of Smaller Numbers After Self.java:18
↓ 1 callersMethodswap
(char[] arr, int i, int j)
344 - Reverse String.java:12
↓ 1 callersMethodswap
(int[] arr, int start, int end)
190 - Reverse Bits.java:16
↓ 1 callersMethodswap
(int[] nums, int i, int j)
41 - First Missing Positive.java:18
↓ 1 callersMethodswap
(char[] chars, int i, int j)
345 - Reverse Vowels of a String.java:26
↓ 1 callersMethodswap
(int[] nums, int i, int j)
384 - Shuffle an Array.java:25
↓ 1 callersMethodswap
(char[] arr, int i, int j)
917 - Reverse Only Letters.java:19
↓ 1 callersMethodswap
(char[] arr, int i, int j)
557 - Reverse Words in a String III.java:24
↓ 1 callersMethodtoLowerCase
(String str)
709 - To Lower Case.java:2
↓ 1 callersMethodtop
()
716 - Max Stack.java:22
↓ 1 callersMethodtraverse
(Node n)
589 - N-ary Tree Preorder Traversal.java:23
↓ 1 callersMethodtraverse
(Node n)
590 - N-ary Tree Postorder Traversal.java:23
↓ 1 callersMethodtraverse
(TreeNode node)
897 - Increasing Order Search Tree.java:18
↓ 1 callersMethodtraverse
(TreeNode node, int level)
637 - Average of Levels in Binary Tree.java:24
↓ 1 callersMethodtraverse
(TreeNode root)
250 - Count Univalue Subtrees.java:19
↓ 1 callersMethodtraverse
(String s, Trie t, List<TrieNode> list)
642 - Design Search Autocomplete System.java:43
↓ 1 callersMethodtraverse
(TreeNode node, int sum, int cur, List<Integer> l)
113 - Path Sum II.java:21
↓ 1 callersMethodtraverse
(TreeNode node)
99 - Recover Binary Search Tree.java:25
↓ 1 callersMethodtraverse
(TreeNode node, int curr)
129 - Sum Root to Leaf Numbers.java:19
↓ 1 callersMethodunion
(int i, int j)
305 - Number of Islands II.java:24
↓ 1 callersMethodunion
(int i, int j)
684 - Redundant Connection.java:19
↓ 1 callersMethodunion
(int a, int b)
323 - Number of Connected Components in an Undirected Graph.java:19
↓ 1 callersMethodunion
(int i, int j)
261 - Graph Valid Tree.java:19
↓ 1 callersMethodupdate
(int idx, int val)
315 - Count of Smaller Numbers After Self.java:10
↓ 1 callersMethodvalid
(String s)
720 - Longest Word in Dictionary.java:28
↓ 1 callersMethodvalidColor
(int[][] graph, int[] colors, int color, int node)
785 - Is Graph Bipartite?.java:44
↓ 1 callersMethodvalidate
(char[][] board, int x, int y, int n)
51 - N-Queens.java:30
MethodAutocompleteSystem
(String[] sentences, int[] times)
642 - Design Search Autocomplete System (with HashMap).java:69
MethodAutocompleteSystem
(String[] sentences, int[] times)
642 - Design Search Autocomplete System.java:59
MethodAutocompleteSystem
(String[] sentences, int[] times)
642 - Design Search Autocomplete System (without Trie).java:42
MethodBSTIterator
(TreeNode root)
173 - Binary Search Tree Iterator.java:15
MethodCBTInserter
(TreeNode root)
919 - Complete Binary Tree Inserter.java:14
MethodColor
(String s)
Coursera/Split the pixels.java:6
MethodEvent
(int id, int height, int x, int type)
218 - The Skyline Problem.java:7
MethodExamRoom
(int N)
855 - Exam Room.java:5
MethodFenwickTree
(int n)
315 - Count of Smaller Numbers After Self.java:5
MethodFront
Get the front item from the queue.
622 - Design Circular Queue.java:33
MethodGroup
(char ch, int cnt)
809 - Expressive Words.java:5
MethodHitCounter
Initialize your data structure here.
362 - Design Hit Counter.java:10
MethodInterval
()
616 - Add Bold Tag in String.java:35
MethodKthLargest
(int k, int[] nums)
703 - Kth Largest Element in a Stream.java:5
MethodLRUCache
(int capacity)
146 - LRU Cache.java:44
MethodLog
(String id, String log)
937 - Reorder Log Files.java:5
MethodLogger
Initialize your data structure here.
359 - Logger Rate Limiter.java:6
MethodMagicDictionary
Initialize your data structure here.
676 - Implement Magic Dictionary.java:41
MethodMaxStack
initialize your data structure here.
716 - Max Stack.java:6
MethodMedianFinder
()
295 - Find Median from Data Stream.java:6
MethodMinStack
initialize your data structure here.
155 - Min Stack.java:6
MethodMovingAverage
Initialize your data structure here.
346 - Moving Average from Data Stream.java:9
MethodMyCalendar
()
729 - My Calendar I.java:4
MethodMyCalendarTwo
()
731 - My Calendar II.java:4
MethodMyCircularQueue
Initialize your data structure here. Set the size of the queue to be k.
622 - Design Circular Queue.java:8
MethodMyHashMap
Initialize your data structure here.
706 - Design HashMap.java:6
MethodMyQueue
Initialize your data structure here.
232 - Implement Queue using Stacks.java:6
MethodNestedIterator
(List<NestedInteger> nestedList)
341 - Flatten Nested List Iterator.java:21
MethodNode
()
146 - LRU Cache.java:8
MethodNode
(String p, double r)
399 - Evaluate Division.java:6
MethodNode
(String p, double r)
PDF/399.java:6
MethodNumArray
(int[] nums)
SegmentTree.java:35
MethodNumArray
(int[] nums)
307 - Range Sum Query - Mutable.java:6
MethodNumArray
(int[] nums)
303 - Range Sum Query - Immutable.java:5
MethodNumMatrix
(int[][] matrix)
304 - Range Sum Query 2D - Immutable.java:4
MethodNumMatrix
(int[][] matrix)
308 - Range Sum Query 2D - Mutable.java:5
MethodPair
(TreeNode n, int c)
314 - Binary Tree Vertical Order Traversal.java:13
MethodPeekingIterator
(Iterator<Integer> iterator)
284 - Peeking Iterator.java:7
MethodPhoneDirectory
Initialize your data structure here @param maxNumbers - The maximum numbers that can be stored in the phone directory.
379 - Design Phone Directory.java:5
MethodPos
(int x, int y)
934 - Shortest Bridge.java:4
MethodPredictTheWinner
(int[] nums)
486 - Predict the Winner.java:2
MethodRLEIterator
(int[] A)
900 - RLE Iterator.java:8
MethodRandomizedCollection
Initialize your data structure here.
381 - Insert Delete GetRandom O(1) - Duplicates allowed.java:7
MethodRandomizedSet
Initialize your data structure here.
380 - Insert Delete GetRandom O(1).java:9
MethodRear
Get the last item from the queue.
622 - Design Circular Queue.java:38
MethodRecentCounter
()
933 - Number of Recent Calls.java:4
MethodReplace
(int i, String s, String t)
833 - Find And Replace in String.java:6
MethodResult
(TreeNode n, int d)
865 - Smallest Subtree with all the Deepest Nodes.java:36
MethodSegementTree
(int sum, int start, int end)
SegmentTree.java:10
MethodSegmentTree
(int start, int end)
915 - Partition Array into Disjoint Intervals.java:9
MethodSegmentTree
(int start, int end)
84 - Largest Rectangle in Histogram.java:50
MethodSolution
(int[] w)
528 - Random Pick with Weight.java:9
MethodSolution
@param head The linked list's head. Note that the head is guaranteed to be not null, so it contains at least one node.
382 - Linked List Random Node.java:15
MethodSolution
(int[] nums)
384 - Shuffle an Array.java:6
MethodSolution
(int[] nums)
398 - Random Pick Index.java:9
MethodSummaryRanges
Initialize your data structure here.
352 - Data Stream as Disjoint Intervals.java:14
MethodTicTacToe
Initialize your data structure here.
348 - Design Tic-Tac-Toe.java:9
MethodTopVotedCandidate
(int[] persons, int[] times)
911 - Online Election.java:12
MethodTrie
Initialize your data structure here.
208 - Implement Trie (Prefix Tree).java:14
MethodTrie
()
676 - Implement Magic Dictionary.java:14
MethodTrie
()
720 - Longest Word in Dictionary.java:13
MethodTrie
()
336 - Palindrome Pairs.java:15
MethodTrie
()
527 - Word Abbreviation.java:13
MethodTrie
()
745 - Prefix and Suffix Search.java:16
MethodTrie
()
211 - Add and Search Word - Data structure design.java:14
MethodTrieNode
()
208 - Implement Trie (Prefix Tree).java:6
MethodTrieNode
()
676 - Implement Magic Dictionary.java:6
MethodTrieNode
()
720 - Longest Word in Dictionary.java:5
MethodTrieNode
(String sentence, int times)
642 - Design Search Autocomplete System (with HashMap).java:8
← previousnext →201–300 of 840, ranked by callers