Functions — github.com/Ayu-99/Data-Structures

CodeHub MCPcopy Create free account

hub / github.com/Ayu-99/Data-Structures / functions

Functions807 in github.com/Ayu-99/Data-Structures

⨍ Functions 807◇ Types & classes 444

Stacks and Queues/Stack Implementation using Arrays.cpp:56

(String[] args)

Check If Two Strings Are Isomorphic.java:31

(String[] args)

Generate Binary Numbers.java:4

(String[] args)

Check If One String Is Rotation of Another.java:26

(String[] args)

Check If One String Is Rotation of Another.java:102

(String[] args)

Find Two Unique Numbers.java:22

(String[] args)

Find Two Unique Numbers.java:51

(String[] args)

Algorithms/Majority element.java:19

(String[] args)

Algorithms/Majority element.java:46

(String[] args)

Binary Search/Java/BinarySearch.java:21

MethodmajorityElement

Majority Element.java:6

MethodmajorityElement

Leetcode Challenge/February/cpp/Majority Element.cpp:3

MethodmajorityElement

(self, nums: List[int])

Leetcode Challenge/February/Python/Majority Element.py:2

MethodmajorityElement

Leetcode Challenge/February/java/Majority Element.java:2

Methodmakesquare

Leetcode Challenge/June/Matchsticks to Square.cpp:46

Leetcode Challenge/April/Python/Recover Binary Search Tree.py:20

Leetcode Challenge/April/C++/Recover Binary Search Tree.cpp:15

MethodmatrixReshape

(self, mat: List[List[int]], r: int, c: int)

Leetcode July Challenge/Python/Reshape the Matrix.py:5

MethodmatrixReshape

Leetcode July Challenge/C++/Reshape the Matrix.cpp:5

MethodmaxAncestorDiff

Leetcode Challenge/december2k22/Maximum Difference Between Node and Ancestor.cpp:15

(self, height: List[int])

Leetcode Challenge/April/Python/Container With Most Water.py:2

Leetcode Challenge/April/C++/Container With Most Water.cpp:3

Leetcode Challenge/April/Java/Container With Most Water.java:2

Leetcode Challenge/June/Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp:17

MethodmaxAreaOfIsland

Leetcode Challenge/June/Max Area of Island.cpp:33

Leetcode Challenge/February/cpp/Maximum Depth of Binary Tree.cpp:15

(TreeNode root)

Leetcode Challenge/February/java/Maximum Depth of Binary Tree.java:17

Leetcode Challenge/June/Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp:5

MethodmaxDistToClosest

Leetcode Challenge/January/Maximize Distance to Closest Person.cpp:3

MethodmaxDistToClosest

Leetcode Challenge/January/Java/Maximize Distance to Closest Person.java:2

MethodmaxDistance

Greedy/Python/Maximum Distance in Arrays.py:2

MethodmaxDistance

Greedy/C++/Maximum Distance in Arrays.cpp:3

MethodmaxDistance

(List<List<Integer>> arrays)

Greedy/Java/Maximum Distance in Arrays.java:2

MethodmaxDistance

(int[] position, int m)

Binary Search/Magnetic Force Between Two Balls.java:2

MethodmaxDotProduct

(self, nums1: List[int], nums2: List[int])

Dynamic Programming/Max Dot Product of Two Subsequences.py:24

MethodmaxPathSum

Leetcode Challenge/december2k22/Binary Tree Maximum Path Sum.cpp:24

MethodmaxPerformance

Leetcode Challenge/June/Maximum Performance of a Team.cpp:3

Leetcode Challenge/December/Consecutive Characters.cpp:3

MethodmaxProbability

Graphs/Path with Maximum Probability.cpp:3

MethodmaxProduct

Leetcode Challenge/december2k22/Maximum Product of Splitted Binary Tree.cpp:15

MethodmaxProfitAssignment

(int[] difficulty, int[] profit, int[] worker)

Binary Search/Most Profit Assigning Work.java:26

MethodmaxResult

Leetcode Challenge/June/Jump Game VI.cpp:4

MethodmaxSubArray

(self, nums: List[int])

Algorithms/Kadane's Algorithm(1D).py:15

MethodmaxSumSubmatrix

(self, matrix: List[List[int]], k: int)

Leetcode July Challenge/Python/Max Sum of Rectangle No Larger Than K.py:3

MethodmaxSumSubmatrix

Leetcode July Challenge/C++/Max Sum of Rectangle No Larger Than K.cpp:5

(self, n: str, x: int)

Leetcode contest/243/Maximum Value after Insertion.py:2

MethodmaximalSquare

T.C - O(m*n) S.C - O(n)

Leetcode Challenge/December/Maximal Square.cpp:25

MethodmaximizeSum

(self, a, n, k)

Greedy/Maximize sum after K negations.py:5

MethodmaximumOddBinaryNumber

Leetcode Challenge/March2k24/Maximum Odd Binary Number.cpp:3

MethodmaximumUniqueSubarray

Leetcode Challenge/June2k22/cpp/Maximum Erasure Value.cpp:3

MethodmaximumUnits

Leetcode Challenge/June/Maximum Units on a Truck.cpp:9

MethodmaximumWealth

Leetcode Challenge/January/Richest Customer Wealth.cpp:3

MethodmaximumWealth

(int[][] accounts)

Leetcode Challenge/January/Java/Richest Customer Wealth.java:2

Leetcode Challenge/June/Count of Smaller Numbers After Self.cpp:4

Leetcode Challenge/June2k22/cpp/Merge Sorted Array.cpp:3

FunctionmergeKLists

Leetcode Challenge/February/cpp/Merge k Sorted Lists.cpp:20

MethodmergeKLists

Linked List/Merge K sorted Linked List.cpp:29

MethodmergeKLists

(ListNode[] lists)

Leetcode Challenge/February/java/Merge k Sorted Lists.java:2

FunctionmergeLists

Merge two Sorted Linked List.cpp:1

MethodmergeSort

Leetcode Challenge/June/Count of Smaller Numbers After Self.cpp:40

FunctionmergeTwoLLs

Merge two sorted LL.cpp:35

MethodmergeTwoLists

(self, l1: ListNode, l2: ListNode)

Leetcode Challenge/March/Python/Merge Two Sorted Lists.py:7

MethodmergeTwoLists

Leetcode Challenge/March/C++/Merge Two Sorted Lists.cpp:13

MethodmergeTwoLists

(ListNode head1, ListNode head2)

Leetcode Challenge/March/Java/Merge Two Sorted Lists.java:12

MethodmergeVectors

Leetcode Challenge/January/All Elements in Two Binary Search Trees.cpp:26

Methodmergelist

Leetcode Challenge/February/cpp/SortList.cpp:39

Functionmidpoint_linkedlist

Midpoint of LL.cpp:31

MethodminCameraCover

Leetcode Challenge/June2k22/cpp/Binary Tree Cameras.cpp:14

MethodminCostClimbingStairs

Leetcode Challenge/June/Min Cost Climbing Stairs.cpp:4

MethodminCostToMoveChips

Leetcode Challenge/December/Minimum Cost to Move Chips to The Same Position.cpp:3

FunctionminCount

Minimum Count.cpp:60

(int[] bloomDay, int m, int k)

Binary Search/Minimum Number of Days to Make m Bouquets.java:22

MethodminDistance

Leetcode Challenge/June2k22/cpp/Delete Operation for Two Strings.cpp:4

MethodminDistance

Dynamic Programming/Edit Distance.cpp:30

MethodminDistanceHelper

Dynamic Programming/Edit Distance.cpp:3

MethodminDominoRotations

Leetcode Challenge/March/C++/Minimum Domino Rotations For Equal Row.cpp:3

MethodminDominoRotations

(int[] A, int[] B)

Leetcode Challenge/March/Java/Minimum Domino Rotations For Equal Row.java:2

MethodminEatingSpeed

Leetcode Challenge/January/Koko Eating Bananas.cpp:3

MethodminEatingSpeed

(int[] piles, int h)

Leetcode Challenge/January/Java/Koko Eating Bananas.java:2

MethodminFallingPathSum

Leetcode Challenge/december2k22/Minimum Falling Path Sum.cpp:29

Leetcode Challenge/January/Jump Game IV.cpp:3

Leetcode Challenge/January/Java/Jump Game IV.java:2

MethodminOperations

Leetcode Challenge/June2k22/cpp/Minimum Operations to Reduce X to Zero.cpp:3

MethodminOperations

(self, nums: List[int])

Binary Search/Minimum Number of Operations to Make Array Continuous.py:2

MethodminRefuelStops

Leetcode Challenge/June/Minimum Number of Refueling Stops.cpp:3

MethodminRemoveToMakeValid

Leetcode Challenge/March/C++/Minimum Remove to Make Valid Parentheses.cpp:40

MethodminSetSize

(self, arr: List[int])

Leetcode July Challenge/Python/Reduce Array Size to The Half.py:3

MethodminSetSize

Leetcode July Challenge/C++/Reduce Array Size to The Half.cpp:6

(self, nums: List[int])

Sliding window/Fixed-size sliding window/Minimum Swaps to Group All 1's Together II.py:2

MethodminimumAbsDifference

Leetcode Challenge/December/Minimum Absolute Difference.cpp:3

MethodminimumAverageDifference

Leetcode Challenge/december2k22/Minimum Average Difference.cpp:3

MethodminimumDeviation

Leetcode Challenge/February/cpp/Minimize Deviation in Array.cpp:3

MethodminimumDeviation

Leetcode Challenge/February/java/Minimize Deviation in Array.java:2

MethodminimumRecolors

(self, nums: str, k: int)

Sliding window/Fixed-size sliding window/Minimum Recolors to Get K Consecutive Black Blocks.py:2

FunctionminimumSum

Dynamic Programming/Minimum Sum Subarray.cpp:21

MethodminimumTotal

Leetcode Challenge/June2k22/cpp/Triangle.cpp:3

FunctionmirrorBinaryTree

Code : Mirror Send Feedback Mirror the given binary tree. That is, right child of every nodes should become left and left should become right. Alt tex

Mirror a BinaryTree.cpp:30

MethodmissingNumber

Bit manipulation/Missing Number.java:2

MethodmostFrequentPrime

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

Matrix/Most Frequent Prime.py:4

Leetcode Challenge/January/String to Integer (atoi).cpp:3

← previous next →501–600 of 807, ranked by callers