Functions — github.com/codedecks-in/LeetCode-Solutions

CodeHub MCPcopy Create free account

hub / github.com/codedecks-in/LeetCode-Solutions / functions

Functions283 in github.com/codedecks-in/LeetCode-Solutions

⨍ Functions 283◇ Types & classes 171

↓ 39 callersMethodlength

Java/Armstrong-Number.java:26

↓ 34 callersMethodpush

Java/Design-a-Stack-With-Increment-Operation.java:8

↓ 31 callersMethodadd

Java/LRU-Cache.java:58

↓ 30 callersMethodpop

Java/Design-a-Stack-With-Increment-Operation.java:15

↓ 14 callersMethodfind

Java/Redundant-Connection/redundant-connection.java:21

↓ 10 callersMethodget

Java/LRU-Cache.java:23

↓ 9 callersMethodinsert

Java/complete-binary-tree-inserter.java:34

↓ 7 callersMethodisEmpty

Checks whether the circular deque is empty or not.

Java/design-circular-deque.java:140

↓ 7 callersMethodremove

Java/LRU-Cache.java:68

↓ 6 callersMethodput

(int key, int value)

Java/LRU-Cache.java:35

↓ 5 callersMethodset

C++/Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix.cpp:24

↓ 4 callersMethoddestroy

(self, grid, i, j, n, m, rotten)

Python/994_Rotting_Oranges.py:41

↓ 4 callersMethodfind

Java/graph_connectivity_with_threshold.java:22

↓ 4 callersMethodget

C++/LRU-Cache.cpp:58

↓ 4 callersFunctionpow

JavaScript/50.Powxn.js:47

↓ 4 callersMethodremove

Python/LRUCache.py:45

↓ 3 callersMethodSquareSum

Java/Happy-Number.java:20

↓ 3 callersMethodisEmpty

Checks whether the circular queue is empty or not.

Python/622-Design-Circular-Queue.py:69

↓ 3 callersMethodisValid

(ArrayList<Integer> arr)

Java/valid-sudoku.java:20

↓ 3 callersMethodput

C++/LRU-Cache.cpp:70

↓ 2 callersMethodGetNum

Java/roman-to-integer.java:2

↓ 2 callersMethodadd

Python/LRUCache.py:50

↓ 2 callersMethodgetLinkedListLength

(ListNode head)

Java/intersection-of-two-linked-lists.java:44

↓ 2 callersMethodgetValue

Java/Arithmetic-Subarrays.java:20

↓ 2 callersMethodheight

(TreeNode root)

Java/Balanced-Binary-Tree.java:34

↓ 2 callersMethodmoveList

(int difference, ListNode head)

Java/intersection-of-two-linked-lists.java:56

↓ 2 callersMethodpostorderTraversal

(TreeNode root)

Java/binary-tree-postorder-traversal.java:16

↓ 2 callersMethodswap

(int[] nums, int i, int j)

Java/Perm_Recus.java:27

↓ 1 callersMethod_numIslands

@param grid @param m @param n

Java/NumberOfIslands.java:62

↓ 1 callersMethodbuildTree

Java/Range-Sum-Query-Mutable.java:28

↓ 1 callersMethodbuildTree

(int l, int r, int nums[])

Java/convert-sorted-list-to-binary-search-tree.java:22

↓ 1 callersMethodcheck

(self, number, nums1, nums2)

Python/496_nextgreaterelement.py:2

↓ 1 callersMethodcheckMirror

(TreeNode lt, TreeNode rt)

Java/symmetric-tree.java:19

↓ 1 callersMethodfindPaths

(int[][] graph,int fromNode,List<Integer> path,List<List<Integer>> ans)

Java/All_Paths_From_Source_to_Target.java:2

↓ 1 callersMethodget

(self, key: int)

Python/LRUCache.py:19

↓ 1 callersMethodgroupAnagrams

:type strs: List[str] :rtype: List[List[str]]

Python/group_anagram.py:12

↓ 1 callersMethodhelper

(self, s, p, idx_s, idx_p,cache)

Python/wildcard-matching.py:10

↓ 1 callersMethodhelper

(int start, int[] nums, List<List<Integer>> result)

Java/Perm_Recus.java:7

↓ 1 callersMethodinorder

(TreeNode root, List<Integer> list)

Java/binary-tree-inorder-traversal.java:22

↓ 1 callersMethodisCycleExists

(ListNode head)

Java/linked-list-cycle-ii.java:34

↓ 1 callersMethodisDuplicate

Java/buddy-strings.java:10

↓ 1 callersMethodisFull

Checks whether the circular queue is full or not.

Python/622-Design-Circular-Queue.py:76

↓ 1 callersMethodnumberOfBits

Method to find out the total number of bits in a number.

Java/number-complement.java:12

↓ 1 callersMethodpostorder

(TreeNode root)

Java/binary-tree-postorder-traversal.java:21

↓ 1 callersMethodpreorder

(self, p, q, result)

Python/100.SameTree.py:20

↓ 1 callersMethodpreorder

(TreeNode root, List<Integer> ls)

Java/binary-tree-preorder-traversal.java:21

↓ 1 callersMethodreverse

Java/reverse-integer.java:9

↓ 1 callersFunctionsmallestDifference

(arr1 : list, arr2 : list)

Python/SmallestDifference.py:41

↓ 1 callersFunctionsum_of_three

(arr, target=0)

Python/ThreeNumbersSum.py:32

↓ 1 callersFunctiontraversal

JavaScript/111-minimum-depth-of-binary-tree.js:33

↓ 1 callersMethodtraverse

(TreeNode root, int n)

Java/sum-root-to-leaf-numbers.java:28

↓ 1 callersMethodunion

Java/graph_connectivity_with_threshold.java:29

↓ 1 callersMethodunion

Java/Redundant-Connection/redundant-connection.java:28

MethodCBTInserter

(TreeNode root)

Java/complete-binary-tree-inserter.java:14

MethodCustomStack

Java/Design-a-Stack-With-Increment-Operation.java:4

Java/Redundant-Connection/redundant-connection.java:13

Java/graph_connectivity_with_threshold.java:14

Get the front item from the queue.

Python/622-Design-Circular-Queue.py:57

FunctionLRUCache

JavaScript/146.LRU-Cache.js:46

C++/LRU-Cache.cpp:56

Java/LRU-Cache.java:16

MethodMyCircularDeque

Initialize your data structure here. Set the size of the deque to be k.

Java/design-circular-deque.java:16

C++/LRU-Cache.cpp:11

Java/Range-Sum-Query-Mutable.java:18

(int x, int y, int height)

Java/path-with-minimum-effort.java:14

Get the last item from the queue.

Python/622-Design-Circular-Queue.py:63

MethodRecentCounter

C++/Number-of-Recent-Calls.cpp:5

Initialize your data structure here. Set the size of the queue to be k.

Python/622-Design-Circular-Queue.py:24

Python/LRUCache.py:2

(self, capacity: int)

Python/LRUCache.py:10

C++/Critical-Connections-in-a-Network.cpp:30

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

Java/Add-Two-Numbers.java:16

MethodallPathsSourceTarget

(int[][] graph)

Java/All_Paths_From_Source_to_Target.java:23

MethodareConnected

(int n, int threshold, int[][] queries)

Java/graph_connectivity_with_threshold.java:38

MethodasteroidCollision

C++/asteroid-collision.cpp:3

Methodbalanced_string_split

Python/split-a-string-in-balanced-strings.py:7

Fucntion to append node at the end of lisked list

C++/merge-k-sorted-lists.cpp:14

MethodbuddyStrings

(String A, String B)

Java/buddy-strings.java:21

MethodcalPoints

C++/Baseball-Game.cpp:3

MethodcalculateMinimumHP

C++/dungeon-game.cpp:10

MethodcanConstruct

(String ransomNote, String magazine)

Java/ransom-note.java:9

MethodcanConstruct

(String ransomNote, String magazine)

Java/May-LeetCoding-Challenge/Day-3-Ransom-Note.java:14

MethodcanFinish

C++/Course-Schedule.cpp:33

MethodcanMakeArithmeticProgression

Java/can-make-arithmetic-progression-from-sequence.java:13

MethodcanPartition

C++/Partition-Equal-Subset-Sum.cpp:46

MethodcheckArithmeticSubarrays

(int[] nums, int[] l, int[] r)

Java/Arithmetic-Subarrays.java:26

MethodcheckWithinBounds

C++/Shortest-Bridge.cpp:10

MethodcherryPickup

C++/Cherry-Pickup-II.cpp:31

MethodclimbStairs

Java/climbing-stairs.java:2

MethodcombinationSum

C++/combination-sum.cpp:20

MethodcontainsDuplicate

(self, nums: List[int])

Python/contains-duplicate.py:7

C++/Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix.cpp:8

MethodconvertToTitle

C++/Excel-Sheet-Column-Title.cpp:10

MethodcountGoodTriplets

(self, arr: List[int], a: int, b: int, c: int)

Python/count-good-triplets.py:9

MethodcountPalindromicSubsequences

C++/Count-Different-Palindromic-Subsequences.cpp:29

MethodcountPrimes

C++/Count-Primes.cpp:4

MethodcriticalConnections

C++/Critical-Connections-in-a-Network.cpp:61

Delete an element from the circular queue. Return true if the operation is successful.

Python/622-Design-Circular-Queue.py:46

MethoddecodeString

C++/decode-string.cpp:3

MethoddefangIPaddr

C++/Defanging an IP Address.cpp:10

next →1–100 of 283, ranked by callers