MCPcopy Create free account

hub / github.com/Codensity30/Strivers-A2Z-DSA-Sheet / functions

Functions668 in github.com/Codensity30/Strivers-A2Z-DSA-Sheet

FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/06. Buy and sell stocks with transaction fee.cpp:59
FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/03. Best time to buy and sell stock upto 2 transaction.cpp:53
FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/05. Buy and sell stocks with cooldown.cpp:52
FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/04. Best time to buy and sell stock uoto k transaction.cpp:53
FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/01. Best time to buy and sell stocks.cpp:28
FunctionmaxProfit
14. Dynamic Programming/6. DP on Stocks/02. Best time to buy and sell stock 2.cpp:54
FunctionmaxScore
08. Sliding Window/1. Medium Problems/08. Maximum Points you can obtaln form the card.cpp:45
FunctionmaxSlidingWindow
07.Stack and Queues/4. Implementation/01. Sliding window maximum.cpp:25
FunctionmaxSubArray
CODE:-
01.Arrays/2.Medium/04.Kadane's_algorithm.cpp:30
FunctionmaxSumAfterPartitioning
14. Dynamic Programming/8. DP on Partition/06. Partition array for maximum sum.cpp:44
FunctionmaximalRectangle
Function to find the largest rectangle area in a binary matrix
07.Stack and Queues/3. Monotonic Stack and Queue/09. Maximal Rectangle in binary matrix.cpp:64
FunctionmaximalSquare
14. Dynamic Programming/9. DP on Squares/01. Maximal Square.cpp:42
FunctionmaximumPoints
14. Dynamic Programming/3. 2D DP/01. Ninja Training.cpp:86
Functionmedian
02.Binary Search/2D Arrays/5.Matrix_median.cpp:30
Functionmerge
01.Arrays/3.Hard/07.Merge_overlapping_subinterval.cpp:23
Functionmerge
01.Arrays/3.Hard/08.Merge_2_sorted_array_without_space.cpp:25
FunctionmergeKArrays
09. Heaps/2. Medium Problems/03. Merge K sorted arrays.cpp:23
FunctionmergeKLists
09. Heaps/2. Medium Problems/04. Merge K sorted Lists.cpp:21
FunctionmiddleNode
CODE:-
04.Linked List/3.Medium Problems of LL/01.Find_mid_of_LL.cpp:29
FunctionminAddToMakeValid
16. Strings (Hard)/Hard/01. Minimum number of insertions to make parenthesis valid.cpp:31
FunctionminBitFlips
QUESTION: A bit flip of a number x is choosing a bit in the binary representation of x and flipping it from either 0 to 1 or 1 to 0. Given two integer
06.Bit Manipulation/2. Interview Problems/01. Minimum bit flips.cpp:18
FunctionminCost
14. Dynamic Programming/8. DP on Partition/02. Minimum cost to cut stick.cpp:44
FunctionminCut
14. Dynamic Programming/8. DP on Partition/05. Palindorme Partionting 2.cpp:50
FunctionminDays
02.Binary Search/In Search Space/04.Minimum_days_to_make_boquets.cpp:54
FunctionminDifference
14. Dynamic Programming/4. DP on Subsequences/03. Minimum Sum Partition.cpp:51
FunctionminDistance
14. Dynamic Programming/5. DP on Strings/06. Minimum steps to make other string.cpp:34
FunctionminEatingSpeed
02.Binary Search/In Search Space/03.Koko_eating_banana.cpp:42
MethodminElement
Function to return the minimum element.
09. Heaps/1. Learning/01. Implement min heap.cpp:69
FunctionminFallingPathSum
14. Dynamic Programming/3. 2D DP/06. Minimum Falling Path Sum.cpp:89
FunctionminInsertions
14. Dynamic Programming/5. DP on Strings/05. Minimum steps to make string palindrome.cpp:35
FunctionminPathSum
14. Dynamic Programming/3. 2D DP/04. Minimum Path Sum.cpp:81
FunctionminVal
12. Binary Search Trees/1. Concept/03. Minimum value in BST.cpp:30
FunctionminWindow
08. Sliding Window/2. Hard Problems/03. Minimum Window Substring.cpp:33
FunctionminimizeCost
14. Dynamic Programming/2. 1D DP/03. Frog K Jumps.cpp:68
FunctionminimumEffortPath
13. Graphs/4. Shortest Path Problems/05. Path with minimum effort.cpp:32
FunctionminimumEnergy
14. Dynamic Programming/2. 1D DP/02. Frog Jump.cpp:63
FunctionminimumSpanningTree
13. Graphs/5. MST Problems/02. Kruskal's Algorithm.cpp:66
FunctionminimumSpanningTree
13. Graphs/5. MST Problems/01. Prim's Algorithm.cpp:35
FunctionminimumTotal
14. Dynamic Programming/3. 2D DP/05. Minimum Path in Triangle.cpp:80
FunctionmissingNumber
CODE:-
01.Arrays/1.Easy/10.Missing_number.cpp:25
FunctionmoveZeroes
01.Arrays/1.Easy/07.Move_0's_to_end.cpp:34
FunctionmyAtoi
QUESTION:- Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi function). The algori
03.Strings/2.Medium/04.Implement_atoi.cpp:56
FunctionmyPow
QUESTION: Implement pow(x, n), which calculates x raised to the power n (i.e., x^n). Example: Input: x = 2.00000, n = 10 Output: 1024.00000 APPROACH
06.Bit Manipulation/3. Advanced Maths/05. Fast Power.cpp:21
FunctionnetworkDelayTime
13. Graphs/4. Shortest Path Problems/07. Network Delay Time.cpp:27
Functionnext
12. Binary Search Trees/2. Practice Problems/09. BST Iterator.cpp:40
Methodnext
07.Stack and Queues/4. Implementation/02. Stock span problem.cpp:33
FunctionnextGreaterElement
07.Stack and Queues/3. Monotonic Stack and Queue/01. Next Greater Element.cpp:38
FunctionnextGreaterElements
07.Stack and Queues/3. Monotonic Stack and Queue/02. Next Greater Element 2.cpp:23
FunctionnextPermutation
01.Arrays/2.Medium/08.Next_permutation.cpp:37
FunctionnumDistinct
14. Dynamic Programming/5. DP on Strings/08. Distinct Subsequences.cpp:42
FunctionnumEnclaves
13. Graphs/2. Traversal Problems/07. Number of Enclaves.cpp:31
FunctionnumOfIslands
13. Graphs/5. MST Problems/06. Number of islands 2.cpp:83
FunctionnumSubarraysWithSum
08. Sliding Window/1. Medium Problems/05. Binary Subarrays with Sum.cpp:28
FunctionnumberOfNodes
11. Binary Trees/1. Traversals/01. Introduction to trees.cpp:17
FunctionnumberOfSubarrays
08. Sliding Window/1. Medium Problems/06. Count the number of nice subarrays.cpp:35
FunctionnumberOfSubstrings
08. Sliding Window/1. Medium Problems/07. Number of Substrings Containing all 3 characters.cpp:48
FunctionoddEven
06.Bit Manipulation/1. Learn Bit Manipulation/03.Check for odd even.cpp:23
FunctionoddEvenList
04.Linked List/3.Medium Problems of LL/07.Odd_even_LL.cpp:33
FunctionorangesRotting
13. Graphs/2. Traversal Problems/02. Rotten Oranges.cpp:35
Functionpartition
05.Recursion/3.Try Out All Combos/01.Palindrome partioning.cpp:56
FunctionperfectSum
05.Recursion/2.Subsequences Pattern/04.Count subsets with sum equal to k.cpp:44
FunctionperfectSum
14. Dynamic Programming/4. DP on Subsequences/04. Count number of subsets with sum K.cpp:94
Methodpop
07.Stack and Queues/1. Learning/07. Implement min stack.cpp:57
Methodpop
07.Stack and Queues/1. Learning/03. Implement stack using queue.cpp:29
Methodpop
07.Stack and Queues/1. Learning/05. Implement stack using linked list.cpp:37
Methodpop
07.Stack and Queues/1. Learning/02. Implement queue using array.cpp:35
FunctionpostToInfix
07.Stack and Queues/2. Infix, Postfix, and Prefix/05. Postfix to infix.cpp:27
FunctionpostToPre
07.Stack and Queues/2. Infix, Postfix, and Prefix/06. Postfix to prefix.cpp:27
FunctionpostTweet
09. Heaps/3. Hard Problems/01. Design Twitter.cpp:39
FunctionpostorderTraversal
11. Binary Trees/1. Traversals/05. Postorder Traversal.cpp:16
FunctionpostorderTraversal
11. Binary Trees/1. Traversals/09. Iterative Postorder.cpp:28
FunctionpreOrder
11. Binary Trees/3. Hard/11. Morris Preorder Traversal.cpp:27
FunctionpreToInfix
07.Stack and Queues/2. Infix, Postfix, and Prefix/03. Prefix to infix.cpp:23
FunctionpreToPost
07.Stack and Queues/2. Infix, Postfix, and Prefix/04. Prefix to postfix.cpp:27
FunctionpreorderTraversal
11. Binary Trees/1. Traversals/07. Iterative Preorder Traversal.cpp:18
FunctionpreorderTraversal
11. Binary Trees/1. Traversals/03. Preorder Traversal.cpp:17
Functionprint2largest
CODE:-
01.Arrays/1.Easy/02.Second_largest_element_in_array.cpp:24
FunctionprintAdjacency
13. Graphs/1. Learning/02. Graph Representation.cpp:19
Functionprint_divisors
QUESTION: Given an integer N, print all the divisors of N in ascending order. Example: Input: 20 Output: 1 2 4 5 10 20 Explanation: 20 is completely
06.Bit Manipulation/3. Advanced Maths/02. All divisors of number.cpp:22
Methodpush
07.Stack and Queues/1. Learning/07. Implement min stack.cpp:47
Methodpush
07.Stack and Queues/1. Learning/05. Implement stack using linked list.cpp:31
Methodpush
07.Stack and Queues/1. Learning/02. Implement queue using array.cpp:29
Methodput
07.Stack and Queues/4. Implementation/04. LRU Cache.cpp:58
FunctionrearrangeArray
CODE:-
01.Arrays/2.Medium/07.Rearange_elements_by_sign.cpp:33
FunctionrecoverTree
12. Binary Search Trees/2. Practice Problems/11. Recover BST.cpp:34
FunctionremoveDuplicates
CODE:-
01.Arrays/1.Easy/04.Remove_duplicates_from_sorted_array.cpp:32
FunctionremoveDuplicates
Given a doubly linked list of n nodes sorted by values, the task is to remove duplicate nodes present in the linked list. Example 1: Input: n = 6 1<-
04.Linked List/4.Medium Problems of DLL/03.Remove_duplicates_from_dll.cpp:36
FunctionremoveKdigits
07.Stack and Queues/3. Monotonic Stack and Queue/07. Remove K elements.cpp:22
MethodremoveMin
Function to remove the minimum element.
09. Heaps/1. Learning/01. Implement min heap.cpp:62
FunctionremoveNthFromEnd
04.Linked List/3.Medium Problems of LL/08.Delete_nth_node_from_back.cpp:34
FunctionremoveOuterParentheses
Question: Given a valid parentheses string `s`, remove the outermost parentheses of every primitive string in the primitive decomposition of `s`. App
03.Strings/1.Easy/01.Remove_outer_parenthesis.cpp:12
FunctionreverseDLL
Given a doubly linked list of n elements. The task is to reverse the doubly linked list. Example 1: Input: LinkedList: 3 <--> 4 <--> 5 Output: 5 4 3
04.Linked List/2.Doubly Linked List/04.Reverse_DLL.cpp:28
FunctionreverseDLL
04.Linked List/2.Doubly Linked List/01.Introduction_to_Double_LL.cpp:29
FunctionreverseKGroup
04.Linked List/5.Hard Promblems of LL/01.Reverse_k_node_in_groups.cpp:19
FunctionreverseList
CODE:-
04.Linked List/3.Medium Problems of LL/02.Reverse_LL.cpp:27
FunctionreversePairs
01.Arrays/3.Hard/11.Reverse_pairs.cpp:77
FunctionreverseStack
05.Recursion/1.Get Strong Hold/03.Reverse_stack_using_recursion.cpp:38
FunctionreverseWords
03.Strings/1.Easy/02.Reverse_words_in_string.cpp:29
FunctionrightRotate
RIGHT ROATATE:-
01.Arrays/1.Easy/06.Rotate_array_left&right_by_k_places.cpp:39
FunctionrightSideView
Approach: - Perform a level order traversal of the binary tree. - For each level, keep track of the last node encountered (the rightmost node from the
11. Binary Trees/2. Medium Problems/11. Left or Right View.cpp:18
← previousnext →501–600 of 668, ranked by callers