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

MethoddeleteFront

Deletes an item from the front of Deque. Return true if the operation is successful.

Java/design-circular-deque.java:72

MethoddeleteLast

Deletes an item from the rear of Deque. Return true if the operation is successful.

Java/design-circular-deque.java:98

MethoddetectCapitalUse

(self, word: str)

Python/detect-capital.py:23

MethoddetectCapitalUse

C++/Detect-Capital.cpp:9

MethoddetectCapitalUse

Java/detect-capital-use.java:2

MethoddetectCycle

C++/Linked-List-Cycle-II.cpp:5

MethoddetectCycle

(ListNode head)

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

C++/Unique-Paths-III.cpp:13

C++/Binary-Tree-Cameras.cpp:16

Let's run a simple dfs. If we come to the same cell with two robots, let's subtract that value.

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

helper function

C++/Course-Schedule.cpp:17

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

C++/Time-Needed-To-Inform-All-Employees.cpp:9

C++/Path-Sum-II.cpp:6

MethoddiagonalSum

Java/matrix-diagonal-sum.java:10

MethoddivisorGame

Python/divisor-game.py:7

FunctionduplicateZeros

JavaScript/Duplicate-Zeroes.js:24

Methodeditdistance

(i,j,s1=s1,s2=s2)

Python/edit-distance.py:9

Insert an element into the circular queue. Return true if the operation is successful.

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

(self, tokens: List[str])

Python/150.EvaluateReversePolishNotation.py:7

MethodfindComplement

C++/Number-Complement.cpp:9

MethodfindComplement

Java/number-complement.java:2

MethodfindMedianSortedArrays

(int[] nums1, int[] nums2)

Java/median-of-two-sorted-arrays.java:2

(self, nums: List[int])

Python/find-minimum-in-rotated-sorted-array.py:7

MethodfindOrder

C++/Course-Schedule-II.cpp:6

MethodfindPairs

C++/k-diff-pairs-in-an-array.cpp:5

MethodfindPoisonedDuration

C++/teemo-attacking.cpp:10

MethodfindRedundantConnection

(int[][] edges)

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

MethodfindShortestSubArray

C++/Degree-of-an-Array.cpp:11

MethodfindShortestSubArray

Java/Degree-of-an-Array.java:8

MethodfindTheDifference

C++/Find-The-Difference.cpp:12

MethodfindUnassignedLocation

C++/Sudoku-Solver.cpp:53

Methodfind_parent

C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp:15

MethodfirstBadVersion

Java/May-LeetCoding-Challenge/Day-1-First-Bad-Version.java:26

MethodfirstUniqChar

Java/first-unique-character-in-a-string.java:8

MethodfirstUniqChar

Java/May-LeetCoding-Challenge/Day-5-First-Unique-Character.java:13

MethodgardenNoAdj

(self, N, paths)

Python/1042_FlowerPlantingwithNoAdjacent.py:18

MethodgenerateTheString

Java/generate-a-string-with-characters-that-have-odd-counts.java:2

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

Get the front item from the deque.

Java/design-circular-deque.java:124

MethodgetIntersectionNode

(ListNode headA, ListNode headB)

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

Get the last item from the deque.

Java/design-circular-deque.java:132

Python/pascals-triangle-ii.py:7

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

(ListNode head)

Java/linked-list-cycle.java:13

MethodhasPathSum

(TreeNode root, int sum)

Java/path-sum.java:17

Python/word-break-1.py:12

Methodincrement

(int k, int val)

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

MethodinitParent

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

MethodinitParent

C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp:8

MethodinorderTraversal

(self, root: TreeNode)

Python/binary-tree-inorder-traversal.py:13

MethodinorderTraversal

(self, root: TreeNode)

Python/Iterative-Inorder-tree-traversal.py:8

MethodinorderTraversal

(TreeNode root)

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

MethodinsertFront

Adds an item at the front of Deque. Return true if the operation is successful.

Java/design-circular-deque.java:23

MethodinsertLast

Adds an item at the rear of Deque. Return true if the operation is successful.

Java/design-circular-deque.java:47

MethodintegerBreak

C++/Integer-Break.cpp:12

MethodisAnagram

(String s, String t)

Java/valid-anagram.java:73

MethodisAnagramUsingBruteForce

(String s, String t)

Java/valid-anagram.java:17

MethodisAnagramUsingSorting

(String s, String t)

Java/valid-anagram.java:51

MethodisArmstrongNumber

Java/Armstrong-Number.java:37

MethodisBalanced

(TreeNode root)

Java/Balanced-Binary-Tree.java:17

MethodisBipartite

C++/Is-Graph-Bipartite.cpp:6

MethodisBoxSafe

to check whether num is valid in that 3*3 matrix grid

C++/Sudoku-Solver.cpp:33

MethodisColumnSafe

to check whether num is valid in that column

C++/Sudoku-Solver.cpp:22

Checks whether the circular deque is full or not.

Java/design-circular-deque.java:145

Java/Happy-Number.java:2

(self, s: str, p: str)

Python/wildcard-matching.py:39

MethodisPalindrome

Java/palindrome-number.java:2

MethodisPowerOfThree

Java/Power-of-Three.java:2

MethodisRowSafe

to check whether num is valid in that row

C++/Sudoku-Solver.cpp:11

C++/Sudoku-Solver.cpp:47

MethodisSameTree

(self, p: TreeNode, q: TreeNode)

Python/100.SameTree.py:15

MethodisSameTree

(TreeNode p, TreeNode q)

Java/Same-Tree.java:19

MethodisSymmetric

(self, root: TreeNode)

Python/101.SymmetricTree.py:7

MethodisSymmetric

(TreeNode root)

Java/symmetric-tree.java:13

Java/Ugly-Number.java:2

Python/20_ValidParentheses.py:23

C++/Unique-Paths-III.cpp:9

FunctionisValidBST

( root, lower = Number.MIN_SAFE_INTEGER, upper = Number.MAX_SAFE_INTEGER )

JavaScript/98.Validate-Binary-Search-Tree.js:32

MethodisValidSudoku

(char[][] board)

Java/valid-sudoku.java:30

C++/k-closest-points-to-origin.cpp:11

MethodladderLength

(String beginWord, String endWord, List<String> wordList)

Java/word-ladder.java:19

MethodlargestRectangleArea

C++/Largest-Rectangle-in-Histogram.cpp:7

MethodleastBricks

C++/brick-wall.cpp:4

MethodleastInterval

(self, tasks: List[str], n: int)

Python/621-Task-Scheduler.py:21

MethodlongestMountain

C++/Longest-Mountain-in-Array.cpp:37

FunctionlongestPalindrome

JavaScript/5.Longest-Palindromic-Substring.js:33

MethodlongestPalindrome

Python/5_LongestPalindromicSubstring.py:23

MethodlongestValidParentheses

Python/longest-valid-parentheses.py:8

MethodmarkIsland

C++/Shortest-Bridge.cpp:15

:type height: List[int] :rtype: int

Python/container_with_most_water.py:2

(self, root: TreeNode)

Python/maximum-depth-of-binary-tree.py:13

Java/max-nesting-depth-parentheses.java:2

MethodmaxPathSum

C++/Binary-Tree-Maximum-Path-Sum.cpp:41

FunctionmaxProduct

JavaScript/152.Maximum-Product-Subarray.js:20

MethodmaxProfit

C++/Best-Time-to-Buy-and-Sell-Stock-II.cpp:8

MethodmaxSubArray

C++/maximum-subarray.cpp:9

(self, intervals: List[List[int]])

Python/56_MergeIntervals.py:21

MethodmergeKLists

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

MethodmiddleNode

(ListNode head)

Java/middle-of-the-linked-list.java:12

← previous next →101–200 of 283, ranked by callers