Functions — github.com/Codensity30/Strivers-A2Z-DSA-Sheet

CodeHub MCPcopy Create free account

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

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

⨍ Functions 668◇ Types & classes 33

Functiondeserialize

11. Binary Trees/3. Hard/14. Serialize and Deserialize.cpp:50

FunctiondetectCycle

04.Linked List/3.Medium Problems of LL/04.Start_of_cycle_in_LL.cpp:42

FunctiondfsOfGraph

13. Graphs/1. Learning/04. DFS.cpp:31

FunctiondiameterOfBinaryTree

11. Binary Trees/2. Medium Problems/03. Diameter of Binary Tree.cpp:32

Functiondijkstra

13. Graphs/4. Shortest Path Problems/03. Dijkstra's Algorithm.cpp:18

FunctiondistanceK

11. Binary Trees/3. Hard/05. All nodes at distance K.cpp:28

FunctiondistinctSubsequences

05.Recursion/2.Subsequences Pattern/03.Count distinct substrings.cpp:46

FunctiondivideTwoInteger

06.Bit Manipulation/1. Learn Bit Manipulation/07.Divide two numbers using bit maipulation.cpp:25

07.Stack and Queues/1. Learning/04. Implement queue using stacks.cpp:26

FunctioneraseOverlapIntervals

10. Greedy Approach/2. Medium/08. Non Overlapping Intervals.cpp:32

FunctioneventualSafeNodes

13. Graphs/3. Topo Sort Problems/05. Find Eventual Safe State.cpp:23

05.Recursion/3.Try Out All Combos/02.Word search in grid.cpp:78

FunctionfiboTab

14. Dynamic Programming/1. Intro to DP/01. Find the nth fibonacci number.cpp:30

FunctionfindCeil

12. Binary Search Trees/2. Practice Problems/01. Ceil in BST.cpp:52

FunctionfindCheapestPrice

13. Graphs/4. Shortest Path Problems/06. Cheapest Flights with K stops.cpp:33

FunctionfindCircleNum

13. Graphs/2. Traversal Problems/01. Count the number of provinces.cpp:30

FunctionfindContentChildren

10. Greedy Approach/1. Easy/01. Assign Cookies.cpp:29

FunctionfindFloor

02.Binary Search/1D Arrays/02.Implement_lower_bound.cpp:31

FunctionfindFloor

12. Binary Search Trees/2. Practice Problems/02. Floor in BST.cpp:14

FunctionfindKRotation

02.Binary Search/1D Arrays/13.Find_how_many_times_array_is_rotated.cpp:29

FunctionfindKthLargest

09. Heaps/2. Medium Problems/01. Kth largest element.cpp:21

FunctionfindKthPositive

02.Binary Search/In Search Space/11.Kth_missing_number.cpp:27

FunctionfindKthSmallest

09. Heaps/2. Medium Problems/02. Kth smallest element.cpp:21

FunctionfindLCS

14. Dynamic Programming/5. DP on Strings/02. Print the LCS.cpp:37

FunctionfindMaxConsecutiveOnes

01.Arrays/1.Easy/11.Max_consecutive_1's.cpp:24

MethodfindMaximumXOR

15. Tries/2. Problems/05. Maximum XOR of two numbers.cpp:74

FunctionfindMedian

09. Heaps/3. Hard Problems/05. Median in a stream.cpp:58

FunctionfindMedianSortedArrays

QUESTION: Given two sorted arrays nums1 and nums2 of sizes m and n respectively, you need to find the median of the two sorted arrays. APPROACH: To f

02.Binary Search/In Search Space/13.Median_of_two_sorted_arrays.cpp:22

FunctionfindMin

02.Binary Search/1D Arrays/11.Find_the_minimum_element_in_sorted_rotated_array.cpp:22

FunctionfindNumberOfLIS

14. Dynamic Programming/7. DP on LIS/05. Number of LIS.cpp:52

FunctionfindOrder

13. Graphs/3. Topo Sort Problems/06. Alien Dictonary.cpp:33

FunctionfindOrder

13. Graphs/3. Topo Sort Problems/04. Course Scheduler 2.cpp:18

FunctionfindPages

02.Binary Search/In Search Space/09.Book_allocation.cpp:52

FunctionfindPairsWithGivenSum

Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in the doubly linked list whose sum is equal to a given val

04.Linked List/4.Medium Problems of DLL/02.Pair_sum_in_dll.cpp:32

FunctionfindPath

05.Recursion/3.Try Out All Combos/03.Rat in maze.cpp:64

FunctionfindPeakElement

02.Binary Search/1D Arrays/08.Find_peak_element.cpp:35

FunctionfindPeakGrid

02.Binary Search/2D Arrays/4.Peak_element_in_matrix.cpp:44

FunctionfindPlatform

10. Greedy Approach/2. Medium/04. Minimum Platforms.cpp:33

FunctionfindPrimeFactors

QUESTION: Given a positive number N, compute its prime factorization using the concept of Sieve. Example: Input: N = 12246 Output: 2 3 13 157 Explana

06.Bit Manipulation/3. Advanced Maths/04. Prime factorization using Sieve.cpp:22

FunctionfindSmallestMaxDist

02.Binary Search/In Search Space/12.Gas_station.cpp:45

FunctionfindTarget

12. Binary Search Trees/2. Practice Problems/10. Two Sum in BST.cpp:57

FunctionfindTargetSumWays

14. Dynamic Programming/4. DP on Subsequences/08. Target Sum.cpp:94

FunctionfindTheCity

13. Graphs/4. Shortest Path Problems/10. Find city with smallest number of neighbours.cpp:35

FunctionfindTwoElement

01.Arrays/3.Hard/09.Repeating_and_missing_numbers.cpp:26

FunctionfindUnion

01.Arrays/1.Easy/09.Union_of_2_sorted_arrays.cpp:42

FunctionfindXOR

06.Bit Manipulation/2. Interview Problems/03. XOR of numbers from L to R.cpp:42

Functionflatten

04.Linked List/5.Hard Promblems of LL/04.Flatten_LL.cpp:37

Functionflatten

11. Binary Trees/3. Hard/13. Flatten Binary Tree.cpp:27

FunctionfloodFill

13. Graphs/2. Traversal Problems/03. Flood-Fill Algorithm.cpp:22

FunctionfloorSqrt

02.Binary Search/In Search Space/01.Square_root_of_number.cpp:30

14. Dynamic Programming/2. 1D DP/01. Climbing Stairs.cpp:22

14. Dynamic Programming/2. 1D DP/02. Frog Jump.cpp:21

09. Heaps/3. Hard Problems/01. Design Twitter.cpp:67

Space Optimization

14. Dynamic Programming/2. 1D DP/05. House Robber 2.cpp:62

Space Optimization

14. Dynamic Programming/2. 1D DP/04. House Robber.cpp:58

Space Optimization

14. Dynamic Programming/3. 2D DP/05. Minimum Path in Triangle.cpp:62

Space Optmization

14. Dynamic Programming/3. 2D DP/06. Minimum Falling Path Sum.cpp:67

Space Optimization

14. Dynamic Programming/3. 2D DP/02. Unique Paths.cpp:57

Space Optimization

14. Dynamic Programming/3. 2D DP/04. Minimum Path Sum.cpp:62

Space Optimization

14. Dynamic Programming/3. 2D DP/03. Unique Paths 2.cpp:73

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/08. Target Sum.cpp:73

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/04. Count number of subsets with sum K.cpp:73

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/02. Partition array in two equal sum subsets.cpp:69

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/07. Coin Change.cpp:75

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/09. Coin Change 2.cpp:73

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/10. Unbounded Knapsack.cpp:77

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/01. Subset sum equal to k.cpp:73

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/05. Partition with given difference.cpp:82

Space Optimization

14. Dynamic Programming/4. DP on Subsequences/06. 01 Knapsack.cpp:75

Space Optimization

14. Dynamic Programming/5. DP on Strings/04. Longest Palindromic Subsequence.cpp:49

Space Optimization

14. Dynamic Programming/5. DP on Strings/01. Longest Common Subsequence.cpp:60

FunctionfourSum

01.Arrays/3.Hard/04.4_sum.cpp:32

FunctionfractionalKnapsack

10. Greedy Approach/1. Easy/02. Fractional Knapsack.cpp:41

FunctionfrequencySort

03.Strings/2.Medium/01.Sort_characters_by_frequency.cpp:14

14. Dynamic Programming/2. 1D DP/05. House Robber 2.cpp:48

14. Dynamic Programming/2. 1D DP/04. House Robber.cpp:45

14. Dynamic Programming/2. 1D DP/01. Climbing Stairs.cpp:31

14. Dynamic Programming/2. 1D DP/03. Frog K Jumps.cpp:53

14. Dynamic Programming/2. 1D DP/02. Frog Jump.cpp:38

14. Dynamic Programming/3. 2D DP/05. Minimum Path in Triangle.cpp:45

14. Dynamic Programming/3. 2D DP/06. Minimum Falling Path Sum.cpp:46

14. Dynamic Programming/3. 2D DP/02. Unique Paths.cpp:41

14. Dynamic Programming/3. 2D DP/04. Minimum Path Sum.cpp:44

14. Dynamic Programming/3. 2D DP/03. Unique Paths 2.cpp:51

14. Dynamic Programming/3. 2D DP/01. Ninja Training.cpp:58

14. Dynamic Programming/4. DP on Subsequences/08. Target Sum.cpp:53

14. Dynamic Programming/4. DP on Subsequences/04. Count number of subsets with sum K.cpp:53

14. Dynamic Programming/4. DP on Subsequences/02. Partition array in two equal sum subsets.cpp:47

14. Dynamic Programming/4. DP on Subsequences/07. Coin Change.cpp:52

14. Dynamic Programming/4. DP on Subsequences/09. Coin Change 2.cpp:54

14. Dynamic Programming/4. DP on Subsequences/10. Unbounded Knapsack.cpp:58

14. Dynamic Programming/4. DP on Subsequences/11. Rod Cutting Problem.cpp:48

14. Dynamic Programming/4. DP on Subsequences/01. Subset sum equal to k.cpp:51

14. Dynamic Programming/4. DP on Subsequences/05. Partition with given difference.cpp:62

14. Dynamic Programming/4. DP on Subsequences/06. 01 Knapsack.cpp:56

14. Dynamic Programming/5. DP on Strings/08. Distinct Subsequences.cpp:31

14. Dynamic Programming/5. DP on Strings/04. Longest Palindromic Subsequence.cpp:37

14. Dynamic Programming/5. DP on Strings/01. Longest Common Subsequence.cpp:48

FunctiongenerateParenthesis

05.Recursion/2.Subsequences Pattern/01.Genereate all valid parenthesis.cpp:41

QUESTION: Given two numbers a and b, swap their values without using a temporary variable and return them. Example: Input: a = 13, b = 9 Output: 9 13

06.Bit Manipulation/1. Learn Bit Manipulation/06.Swap two numbers without temporary variable.cpp:18

← previous next →301–400 of 668, ranked by callers