Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/devweekends/DW-Fellowship-DSA-Roadmap
/ functions
Functions
315 in github.com/devweekends/DW-Fellowship-DSA-Roadmap
⨍
Functions
315
◇
Types & classes
140
Method
mergeKLists
Level 1/Week 03/LinkedList/23. Merge k Sorted Lists/code.cpp:21
Method
mergeKLists
Level 1/Week 10/Recursion/23. Merge k Sorted Lists/code.cpp:29
Method
mergeKListsHelper
Level 1/Week 10/Recursion/23. Merge k Sorted Lists/code.cpp:45
Method
mergeTriplets
Level 1/Week 09/Greedy/1899. Merge Triplets to Form Target Triplet/code.cpp:23
Method
mergeTwoLists
Level 1/Week 03/LinkedList/21. Merge Two Sorted Lists/code.cpp:14
Method
mergeTwoLists
Helper function to merge two sorted lists
Level 1/Week 10/Recursion/23. Merge k Sorted Lists/code.cpp:68
Method
mergeTwoLists
Level 1/Week 10/Recursion/21. Merge Two Sorted Lists/code.cpp:29
Method
mergeTwoLists
Helper function to merge two sorted lists
Level 1/Week 10/Recursion/148. Sort List/code.cpp:63
Method
minCostClimbingStairs
Main function - using the most optimal approach
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:78
Method
minCostClimbingStairsMemo
Approach 2: Memoization (Top-Down DP) Time: O(n), Space: O(n) - memoization table + recursion stack
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:33
Method
minCostClimbingStairsOptimized
Approach 4: Space Optimization Time: O(n), Space: O(1) - only two variables
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:65
Method
minCostClimbingStairsRecursion
Approach 1: Recursion (Brute Force) Time: O(2^n), Space: O(n) - recursion stack
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:17
Method
minCostClimbingStairsTabulation
Approach 3: Tabulation (Bottom-Up DP) Time: O(n), Space: O(n) - DP array
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:53
Method
minCostMemoHelper
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:40
Method
minCostRecursionHelper
Level 1/Week 11/Dynamic Programming/746. Min Cost Climbing Stairs/code.cpp:23
Method
minDepth
Level 1/Week 04/Trees/111. Minimum Depth of Binary Tree/code.cpp:32
Method
minEatingSpeed
Level 0/9 Modified Binary Search/08. 0907-koko-eating-bananas/0907-koko-eating-bananas.cpp:20
Method
minEatingSpeed
Level 1/Week 05/Modified Binary Search/875. Koko Eating Bananas/code.cpp:60
Method
minMeetingRooms
Level 1/Week 07/K way merge [Heaps]/253. Meeting Rooms II/code.cpp:22
Method
minWindow
Level 1/Week 02/Sliding windows/76. Minimum Window Substring/code.cpp:24
Method
mostBooked
Level 1/Week 07/K way merge [Heaps]/Meeting Rooms III/code.cpp:25
Method
numIslands
Level 1/Week 12/Graph/200. Number of Islands/code.cpp:20
Function
odd
------------------------------------------ 🔹 Approach 1: Modulo Operator (%) - If a number divided by 2 leaves remainder 1, it's odd. - Straightforw
Common/Math/Odd/odd_number.cpp:12
Function
odd_bitwise
------------------------------------------ 🔹 Approach 2: Bitwise AND Operator (&) - Odd numbers have 1 as the last binary digit. - So, if (n & 1) == 1
Common/Math/Odd/odd_number.cpp:24
Function
odd_division
------------------------------------------ 🔹 Approach 3: Integer Division - Divide the number by 2 and multiply it back. - If the result is not equal
Common/Math/Odd/odd_number.cpp:36
Function
odd_recursive
------------------------------------------ 🔹 Approach 4: Recursive Method - Base case: 0 → false (even), 1 → true (odd) - Reduce n by 1 each time to r
Common/Math/Odd/odd_number.cpp:48
Method
orangesRotting
Level 1/Week 12/Graph/994. Rotting Oranges/code.cpp:22
Method
pacificAtlantic
Level 1/Week 12/Graph/417. Pacific Atlantic Water Flow/code.cpp:21
Method
pairSum
Level 1/Week 03/LinkedList/2130. Maximum Twin Sum of a Linked List/code.cpp:18
Method
partition
Level 0/10 Backtracking/06. 0131-palindrome-partitioning/code.cpp:42
Method
partition
Level 1/Week 10/Backtracking/131. Palindrome Partitioning/code.cpp:23
Method
partitionLabels
Level 1/Week 09/Greedy/763. Partition Labels/code.cpp:26
Method
permute
Level 0/10 Backtracking/04. 046-permutations/code.cpp:33
Method
permute
Level 1/Week 10/Backtracking/46. Permutations/code.cpp:21
Function
power
Level 1/Week 04/Recursion/Calculate Power (a^b)/code.cpp:17
Method
predictPartyVictory
Level 1/Week 06/Queue/649. Dota2 Senate/code.cpp:19
Function
print1ToN
Level 1/Week 04/Recursion/Print Numbers from 1 to N/code.cpp:20
Function
printNTo1
Level 1/Week 04/Recursion/Print Numbers from N to 1/code.cpp:21
Method
productExceptSelf
Level 1/Week 01/Arrays & Hashing/238. Product of Array Except Self/code.cpp:22
Method
removeDuplicates
Level 1/Week 02/2 pointers/26. Remove Duplicates from Sorted Array/code.cpp:24
Method
removeNthFromEnd
Level 1/Week 03/LinkedList/19. Remove Nth Node From End of List/code.cpp:28
Method
reorderList
Level 1/Week 03/LinkedList/143. Reorder List/code.cpp:34
Method
reverse
Level 1/Week 04/Recursion/Check if a Number is a Palindrome/code.cpp:88
Method
reverseBetween
Level 1/Week 10/Recursion/92. Reverse Linked List II/code.cpp:29
Method
reverseFirstK
Helper function to reverse the first k nodes
Level 1/Week 10/Recursion/25. Reverse Nodes in k-Group/code.cpp:58
Method
reverseHelper
Level 1/Week 10/Recursion/92. Reverse Linked List II/code.cpp:40
Method
reverseKGroup
Level 1/Week 03/LinkedList/25. Reverse Nodes in k-Group/code.cpp:13
Method
reverseKGroup
Level 1/Week 10/Recursion/25. Reverse Nodes in k-Group/code.cpp:29
Method
reverseList
Level 1/Week 03/LinkedList/206. Reverse Linked List/code.cpp:15
Method
reverseList
Level 1/Week 10/Recursion/206. Reverse Linked List/code.cpp:29
Method
reverseList
Helper function to reverse a linked list
Level 1/Week 10/Recursion/445. Add Two Numbers II/code.cpp:42
Method
reverseRange
Helper function to reverse a range of nodes
Level 1/Week 10/Recursion/92. Reverse Linked List II/code.cpp:52
Method
rightSideView
Level 0/8 Trees/05. 0199-binary-tree-right-side-view/code.cpp:34
Method
rob
Main function - using the most optimal approach
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:129
Method
rob
Main function - using the most optimal approach
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:84
Method
robLinearMemo
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:54
Method
robLinearOptimized
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:111
Method
robLinearRecursion
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:30
Method
robLinearTabulation
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:80
Method
robMemo
Approach 2: Memoization (Top-Down DP) Time: O(n), Space: O(n) - memoization table + recursion stack
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:42
Method
robMemo
Approach 2: Memoization (Top-Down DP) Time: O(n), Space: O(n) - memoization table + recursion stack
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:33
Method
robMemoHelper
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:39
Method
robOptimized
Approach 4: Space Optimization Time: O(n), Space: O(1) - only variables
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:98
Method
robOptimized
Approach 4: Space Optimization Time: O(n), Space: O(1) - only two variables
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:68
Method
robRecursion
Approach 1: Recursion (Brute Force) Time: O(2^n), Space: O(n) - recursion stack
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:17
Method
robRecursion
Approach 1: Recursion (Brute Force) Time: O(2^n), Space: O(n) - recursion stack
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:17
Method
robRecursionHelper
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:22
Method
robTabulation
Approach 3: Tabulation (Bottom-Up DP) Time: O(n), Space: O(n) - DP array
Level 1/Week 11/Dynamic Programming/213. House Robber II/code.cpp:67
Method
robTabulation
Approach 3: Tabulation (Bottom-Up DP) Time: O(n), Space: O(n) - DP array
Level 1/Week 11/Dynamic Programming/198. House Robber/code.cpp:52
Method
search
Level 0/9 Modified Binary Search/04. 0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.cpp:3
Method
search
Level 0/9 Modified Binary Search/05. 0081-search-in-rotated-sorted-array-ii/0081-search-in-rotated-sorted-array-ii.cpp:3
Method
search
Level 0/9 Modified Binary Search/01. 0792-binary-search/0792-binary-search.cpp:3
Method
search
Level 1/Week 05/Modified Binary Search/33. Search in Rotated Sorted Array/code.cpp:43
Method
search
Level 1/Week 05/Modified Binary Search/704. Binary Search/code.cpp:26
Method
search
Level 1/Week 05/Modified Binary Search/81. Search in Rotated Sorted Array II/code.cpp:47
Method
search
Level 1/Week 04/Trees/105. Construct Binary Tree from Preorder and Inorder Traversal/code.cpp:38
Method
searchMatrix
Level 0/9 Modified Binary Search/07. 0074-search-a-2d-matrix/0074-search-a-2d-matrix.cpp:3
Method
searchMatrix
Level 1/Week 05/Modified Binary Search/74. Search a 2D Matrix/code.cpp:74
Method
searchRange
Level 0/9 Modified Binary Search/02. 0034-find-first-and-last-position-of-element-in-sorted-array/0034-find-first-and-last-position-of-element-in-sorted-array.cpp:3
Method
serialize
Encodes a tree to a single string.
Level 0/8 Trees/11. 0297-serialize-and-deserialize-binary-tree/code.cpp:53
Method
serializeHelper
Helper function to serialize tree using preorder traversal
Level 0/8 Trees/11. 0297-serialize-and-deserialize-binary-tree/code.cpp:14
Method
shortestSubarray
Level 1/Week 06/Queue/862. Shortest Subarray with Sum at Least K/code.cpp:21
Method
solve
Level 1/Week 12/Graph/130. Surrounded Regions/code.cpp:20
Method
solveNQueens
Level 0/10 Backtracking/08. 0051-n-queens/code.cpp:55
Method
solveNQueens
Level 1/Week 10/Backtracking/51. N-Queens/code.cpp:24
Method
sortList
Level 1/Week 10/Recursion/148. Sort List/code.cpp:29
Method
subsets
Level 0/10 Backtracking/01. 078-subsets/code.cpp:23
Method
subsets
Level 1/Week 10/Backtracking/78. Subsets/code.cpp:17
Method
subsetsWithDup
Level 0/10 Backtracking/05. 090-subsets-ii/code.cpp:28
Method
subsetsWithDup
Level 1/Week 10/Backtracking/90. Subsets II/code.cpp:22
Function
sum
Level 1/Week 04/Recursion/Sum of First N Natural Numbers/code.cpp:21
Method
swapPairs
Level 1/Week 10/Recursion/24. Swap Nodes in Pairs/code.cpp:28
Method
thirdMax
Level 1/Week 07/K way merge [Heaps]/414. Third Maximum Number/code.cpp:21
Method
threeSum
Level 1/Week 02/2 pointers/15. 3Sum/code.cpp:31
Method
timeRequiredToBuy
Level 1/Week 06/Queue/2073. Time Needed to Buy Tickets/code.cpp:20
Method
topKFrequent
Level 1/Week 01/Arrays & Hashing/347. Top K Frequent Elements/code.cpp:34
Method
trap
Level 1/Week 02/2 pointers/42. Trapping Rain Water/code.cpp:32
Method
twoSum
Level 1/Week 01/Arrays & Hashing/1. Two Sum/code.cpp:18
Method
unionSets
Union by rank
Level 1/Week 12/Graph/684. Redundant Connection/code.cpp:58
Method
uniquePaths
Main function - using the most optimal approach
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:80
← previous
next →
201–300 of 315, ranked by callers