Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Cee/Leetcode
/ functions
Functions
840 in github.com/Cee/Leetcode
⨍
Functions
840
◇
Types & classes
540
Method
TrieNode
()
421 - Maximum XOR of Two Numbers in an Array.java:16
Method
TrieNode
(String sentence, int times)
642 - Design Search Autocomplete System.java:6
Method
TrieNode
()
336 - Palindrome Pairs.java:6
Method
TrieNode
()
527 - Word Abbreviation.java:5
Method
TrieNode
()
745 - Prefix and Suffix Search.java:7
Method
TrieNode
()
211 - Add and Search Word - Data structure design.java:6
Method
Tuple
(int x, int y, int val)
373 - Find K Pairs with Smallest Sums.java:4
Method
Tuple
(int y, int x, int dist)
317 - Shortest Distance from All Buildings.java:6
Method
Tuple
(int x, int y, int val)
378 - Kth Smallest Element in a Sorted Matrix.java:4
Method
TwoSum
Initialize your data structure here.
170 - Two Sum III - Data structure design.java:6
Method
UnionFind
(int n)
305 - Number of Islands II.java:5
Method
UnionFind
(int n)
684 - Redundant Connection.java:4
Method
UnionFind
(int n)
323 - Number of Connected Components in an Undirected Graph.java:4
Method
UnionFind
(int n)
261 - Graph Valid Tree.java:4
Method
UnionFind
(int n)
803 - Bricks Falling When Hit.java:5
Method
ValidWordAbbr
(String[] dictionary)
288 - Unique Word Abbreviation.java:4
Method
Vector2D
(List<List<Integer>> vec2d)
251 - Flatten 2D Vector.java:6
Method
WordDictionary
Initialize your data structure here.
211 - Add and Search Word - Data structure design.java:62
Method
WordFilter
(String[] words)
745 - Prefix and Suffix Search.java:76
Method
ZigzagIterator
(List<Integer> v1, List<Integer> v2)
281 - Zigzag Iterator.java:4
Method
accountsMerge
(List<List<String>> accounts)
721 - Accounts Merge.java:2
Method
add
Add the number to an internal data structure..
170 - Two Sum III - Data structure design.java:12
Method
addBinary
(String a, String b)
67 - Add Binary.java:2
Method
addBoldTag
(String s, String[] dict)
616 - Add Bold Tag in String.java:2
Method
addNum
(int val)
352 - Data Stream as Disjoint Intervals.java:18
Method
addNum
(int num)
295 - Find Median from Data Stream.java:11
Method
addOperators
(String num, int target)
282 - Expression Add Operators.java:3
Method
addStrings
(String num1, String num2)
415 - Add Strings.java:2
Method
addTwoNumbers
(ListNode l1, ListNode l2)
445 - Add Two Numbers II.java:10
Method
addTwoNumbers
(ListNode l1, ListNode l2)
2 - Add Two Numbers.java:10
Method
addWord
Adds a word into the data structure.
211 - Add and Search Word - Data structure design.java:67
Method
alienOrder
(String[] words)
269 - Alien Dictionary.java:2
Method
allPathsSourceTarget
(int[][] graph)
797 - All Paths From Source to Target.java:2
Method
anagramMappings
(int[] A, int[] B)
760 - Find Anagram Mappings.java:2
Method
areSentencesSimilar
(String[] words1, String[] words2, String[][] pairs)
734 - Sentence Similarity.java:2
Method
areSentencesSimilarTwo
(String[] words1, String[] words2, String[][] pairs)
737 - Sentence Similarity II.java:2
Method
arrayPairSum
(int[] nums)
561 - Array Partition I.java:2
Method
averageOfLevels
(TreeNode root)
637 - Average of Levels in Binary Tree.java:13
Method
backspaceCompare
(String S, String T)
844 - Backspace String Compare.java:2
Method
beautifulArray
(int N)
932 - Beautiful Array.java:3
Method
binaryTreePaths
(TreeNode root)
257 - Binary Tree Paths.java:12
Method
book
(int start, int end)
731 - My Calendar II.java:8
Method
book
(int start, int end)
729 - My Calendar I.java:8
Method
buildDict
Build a dictionary through a list of words
676 - Implement Magic Dictionary.java:46
Method
buildTree
(int[] preorder, int[] inorder)
105 - Construct Binary Tree from Preorder and Inorder Traversal.java:32
Method
calPoints
(String[] ops)
682 - Baseball Game.java:2
Method
calcEquation
(String[][] equations, double[] values, String[][] queries)
399 - Evaluate Division.java:14
Method
calcEquation
(String[][] equations, double[] values, String[][] queries)
PDF/399.java:14
Method
calculate
(String s)
227 - Basic Calculator II.java:2
Method
calculate
(String s)
224 - Basic Calculator.java:2
Method
canAttendMeetings
(Interval[] intervals)
252 - Meeting Rooms.java:11
Method
canCompleteCircuit
(int[] gas, int[] cost)
134 - Gas Station.java:2
Method
canConstruct
(String ransomNote, String magazine)
383 - Ransom Note.java:2
Method
canCross
(int[] stones)
403 - Frog Jump.java:2
Method
canFinish
(int numCourses, int[][] prerequisites)
207 - Course Schedule.java:2
Method
canJump
(int[] nums)
55 - Jump Game.java:2
Method
canMeasureWater
(int x, int y, int z)
365 - Water and Jug Problem.java:2
Method
canPartition
(int[] nums)
416 - Partition Equal Subset Sum.java:2
Method
canPartitionKSubsets
(int[] nums, int k)
698 - Partition to K Equal Sum Subsets.java:2
Method
canPermutePalindrome
(String s)
266 - Palindrome Permutation.java:2
Method
canVisitAllRooms
(List<List<Integer>> rooms)
841 - Keys and Rooms.java:2
Method
candy
(int[] ratings)
135 - Candy.java:2
Method
catMouseGame
(int[][] graph)
913 - Cat and Mouse.java:15
Method
change
(int amount, int[] coins)
518 - Coin Change 2.java:2
Method
check
Check if a number is available or not.
379 - Design Phone Directory.java:22
Method
checkInclusion
(String s1, String s2)
567 - Permutation in String.java:2
Method
checkSubarraySum
(int[] nums, int k)
523 - Continuous Subarray Sum.java:2
Method
checkValidString
(String s)
678 - Valid Parenthesis String.java:2
Method
circularArrayLoop
(int[] nums)
457 - Circular Array Loop.java:2
Method
cleanRoom
(Robot robot)
489 - Robot Room Cleaner.java:21
Method
climbStairs
(int n)
70 - Climbing Stairs.java:2
Method
cloneGraph
(UndirectedGraphNode node)
133 - Clone Graph.java:10
Method
closestValue
(TreeNode root, double target)
270 - Closest Binary Search Tree Value.java:11
Method
coinChange
(int[] coins, int amount)
322 - Coin Change.java:2
Method
combinationSum
(int[] candidates, int target)
39 - Combination Sum.java:3
Method
compare
(Character l, Character r)
791 - Custom Sort String.java:49
Method
compare
(Map.Entry<K, V> a, Map.Entry<K, V> b)
642 - Design Search Autocomplete System (with HashMap).java:57
Method
compare
(Map.Entry<K, V> a, Map.Entry<K, V> b)
642 - Design Search Autocomplete System (without Trie).java:32
Method
compareVersion
(String version1, String version2)
165 - Compare Version Numbers.java:2
Method
compress
(char[] chars)
443 - String Compression.java:2
Method
connect
(TreeLinkNode root)
117 - Populating Next Right Pointers in Each Node II.java:10
Method
constructMaximumBinaryTree
(int[] nums)
654 - Maximum Binary Tree.java:11
Method
containsNearbyDuplicate
(int[] nums, int k)
219 - Contains Duplicate II.java:2
Method
convertToTitle
(int n)
168 - Excel Sheet Column Title.java:2
Method
copyRandomList
(RandomListNode head)
138 - Copy List with Random Pointer.java:14
Method
countAndSay
(int n)
38 - Count and Say.java:2
Method
countBattleships
(char[][] board)
419 - Battleships in a Board.java:2
Method
countComponents
(int n, int[][] edges)
323 - Number of Connected Components in an Undirected Graph.java:35
Method
countNodes
(TreeNode root)
222 - Count Complete Tree Nodes.java:11
Method
countPrimes
(int n)
204 - Count Primes.java:2
Method
countSmaller
(int[] nums)
315 - Count of Smaller Numbers After Self.java:33
Method
countSubstrings
(String s)
647 - Palindromic Substrings.java:3
Method
countUnivalSubtrees
(TreeNode root)
250 - Count Univalue Subtrees.java:12
Method
crackSafe
(int n, int k)
753 - Cracking the Safe.java:2
Method
customSortString
(String S, String T)
791 - Custom Sort String.java:2
Method
dailyTemperatures
(int[] T)
739 - Daily Temperatures.java:2
Method
deQueue
Delete an element from the circular queue. Return true if the operation is successful.
622 - Design Circular Queue.java:25
Method
decode
(String s)
271 - Encode and Decode Strings.java:13
Method
decode
(String shortUrl)
535 - Encode and Decode TinyURL.java:15
Method
decodeString
(String s)
394 - Decode String.java:2
← previous
next →
301–400 of 840, ranked by callers