Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Codensity30/Strivers-A2Z-DSA-Sheet
/ functions
Functions
668 in github.com/Codensity30/Strivers-A2Z-DSA-Sheet
⨍
Functions
668
◇
Types & classes
33
Function
rob
14. Dynamic Programming/2. 1D DP/05. House Robber 2.cpp:75
Function
rob
14. Dynamic Programming/2. 1D DP/04. House Robber.cpp:71
Function
romanToInt
03.Strings/2.Medium/03.Roman_to_Integer.cpp:29
Function
rotate
01.Arrays/2.Medium/12.Rotate_matrix.cpp:29
Function
rotateArray
CODE:-
01.Arrays/1.Easy/05.Rotate_array_left_by_1place.cpp:21
Function
rotateRight
04.Linked List/5.Hard Promblems of LL/02.Rotate_LL_k_times.cpp:29
Function
rotateString
03.Strings/1.Easy/06.Check_for_rotated_string.cpp:22
Function
rowWithMax1s
CODE:-
02.Binary Search/2D Arrays/1.Row_with_maximum_number_of_1's.cpp:34
Function
search
02.Binary Search/1D Arrays/09.Search_in_rotated_sorted_array.cpp:39
Function
search
CODE:-
02.Binary Search/1D Arrays/01.Find_x_in_sorted_array.cpp:29
Function
search
02.Binary Search/1D Arrays/10.Search_in_rotated_sorted_array_with_duplicates.cpp:37
Method
search
15. Tries/1. Theory/01. Implement Trie (Prefix Tree).cpp:51
Function
searchBST
12. Binary Search Trees/1. Concept/02. Search in BST.cpp:22
Function
searchInsert
02.Binary Search/1D Arrays/04.Search_insert_position.cpp:24
Function
searchKey
QUESTION:- Given a linked list of n nodes and a key , the task is to check if the key is present in the linked list or not. Example: Input: n = 4 1-
04.Linked List/1. Single Linked List/05.Search_element_in_linked_list.cpp:24
Function
searchMatrix
02.Binary Search/2D Arrays/3.Search_in_rowwise_sorted_matrix.cpp:42
Function
searchMatrix
CODE:-
02.Binary Search/2D Arrays/2.Search_in_sorted_matrix.cpp:29
Function
searchRange
02.Binary Search/1D Arrays/06.First_and_last_position.cpp:23
Function
segregate
04.Linked List/3.Medium Problems of LL/11.Sort_0_1_2_in_LL.cpp:22
Function
serialize
11. Binary Trees/3. Hard/14. Serialize and Deserialize.cpp:34
Function
setBit
15. Tries/2. Problems/04. Bitwise basic operations.cpp:30
Function
setBit
06.Bit Manipulation/1. Learn Bit Manipulation/05.Set the righmost unset bit.cpp:37
Function
setZeroes
CODE:
01.Arrays/2.Medium/11.Set_matrix_0's.cpp:26
Function
shipWithinDays
02.Binary Search/In Search Space/06.Capacity_to_ship_packages.cpp:44
Function
shortestCommonSupersequence
14. Dynamic Programming/5. DP on Strings/07. Shortest Common Supersequence.cpp:23
Function
shortestPalindrome
16. Strings (Hard)/Hard/05. Shortest Palindrome.cpp:42
Function
shortestPath
13. Graphs/4. Shortest Path Problems/01. Shortest path in Undirected Graph having unit distance.cpp:19
Function
shortestPath
13. Graphs/4. Shortest Path Problems/02. Shortest path in DAG.cpp:30
Function
shortestPathBinaryMatrix
13. Graphs/4. Shortest Path Problems/04. Shortest Path in binary matrix.cpp:32
Function
shortest_distance
13. Graphs/4. Shortest Path Problems/09. Floyd Warshall Algorithm.cpp:28
Function
singleNonDuplicate
02.Binary Search/1D Arrays/12.Find_single_element_in_sorted_array.cpp:23
Function
singleNumber
CODE:-
01.Arrays/1.Easy/13.Find_element_present_only_once.cpp:25
Function
smallestDivisor
02.Binary Search/In Search Space/05.Find_smallest_integer.cpp:26
Function
solve
05.Recursion/3.Try Out All Combos/07.Sudoku solver.cpp:63
Function
solve
13. Graphs/2. Traversal Problems/06. Surrounded Regions.cpp:29
Function
solveNQueens
05.Recursion/3.Try Out All Combos/05.N queens.cpp:30
Function
sortColors
CODE:-
01.Arrays/2.Medium/02.Sort_0_1_2.cpp:31
Function
sortList
04.Linked List/3.Medium Problems of LL/10.Sort_LL.cpp:57
Function
sortSt
05.Recursion/1.Get Strong Hold/04.Sort_stack_using_recursion.cpp:43
Function
spiralOrder
01.Arrays/2.Medium/13.Spiral_traversal.cpp:40
Function
splitArray
02.Binary Search/In Search Space/10.Split_array_largest.cpp:42
Method
startsWith
15. Tries/1. Theory/01. Implement Trie (Prefix Tree).cpp:61
Function
strStr
16. Strings (Hard)/Hard/03. KMP or Z string matching algo.cpp:41
Function
subArrayRanges
07.Stack and Queues/3. Monotonic Stack and Queue/06. Sum of range of all subarray.cpp:77
Function
subarraySum
01.Arrays/2.Medium/05.Number_of_subarray_sum_equal_k.cpp:23
Function
subarraysWithKDistinct
08. Sliding Window/2. Hard Problems/02. Count the number of substrings with exactly K unique characters.cpp:57
Function
subarraysWithSumK
01.Arrays/3.Hard/06.Subarrays_with_xor_k.cpp:25
Function
subsetSums
05.Recursion/2.Subsequences Pattern/05.Subset 1.cpp:44
Function
subsets
05.Recursion/2.Subsequences Pattern/02.Power set.cpp:47
Function
subsetsWithDup
05.Recursion/2.Subsequences Pattern/06.Subset 2.cpp:51
Function
substrCount
03.Strings/2.Medium/05.Count_the_number_of_substrings_with_k_unique_characters.cpp:55
Function
sumSubarrayMins
07.Stack and Queues/3. Monotonic Stack and Queue/05. Sum of subarray minimum.cpp:44
Function
swimInWater
13. Graphs/5. MST Problems/08. Swim in rising water.cpp:29
Function
threeSum
01.Arrays/3.Hard/03.3_sum.cpp:27
Function
timeToBurnTree
11. Binary Trees/3. Hard/06. Min time to burn binary tree.cpp:59
Function
topKFrequent
09. Heaps/3. Hard Problems/06. Top K frequent elements.cpp:23
Function
topologicalSort
13. Graphs/3. Topo Sort Problems/01. Topological Sorting.cpp:25
Function
totalFruits
08. Sliding Window/1. Medium Problems/03. Fruit into Baskets.cpp:27
Function
trap
QUESTION: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raini
07.Stack and Queues/3. Monotonic Stack and Queue/04. Trapping Rainwater.cpp:22
Function
twoSum
CODE:-
01.Arrays/2.Medium/01.2_sum_problem.cpp:31
Function
unfollow
09. Heaps/3. Hard Problems/01. Design Twitter.cpp:71
Function
uniquePaths
14. Dynamic Programming/3. 2D DP/02. Unique Paths.cpp:76
Function
uniquePathsWithObstacles
14. Dynamic Programming/3. 2D DP/03. Unique Paths 2.cpp:96
Function
updateMatrix
13. Graphs/2. Traversal Problems/05. 01 Matrix.cpp:19
Function
verticalTraversal
11. Binary Trees/2. Medium Problems/08. Vertical Order Traversal.cpp:23
Function
widthOfBinaryTree
11. Binary Trees/3. Hard/03. Max width of binary tree.cpp:30
Function
wordBreak
05.Recursion/3.Try Out All Combos/06.Word Break.cpp:36
Function
zigzagLevelOrder
11. Binary Trees/2. Medium Problems/06. Zig-Zag Traversal.cpp:23
← previous
601–668 of 668, ranked by callers