Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/devparthgarg/Data-Structures-and-Algorithms
/ functions
Functions
1,161 in github.com/devparthgarg/Data-Structures-and-Algorithms
⨍
Functions
1,161
◇
Types & classes
111
Function
main
09. Hashing/15 More than N-K Occurrences/15a More Than N k Occurences.cpp:31
Function
main
09. Hashing/15 More than N-K Occurrences/15b More Than N k Occurences.cpp:28
Function
main
09. Hashing/14 Count Distinct Elements in a Window of size K/14b Count Distinct Elements in Window of size K.cpp:17
Function
main
09. Hashing/14 Count Distinct Elements in a Window of size K/14a Count Distinct Elements in Window of size K.cpp:29
Function
main
09. Hashing/14 Count Distinct Elements in a Window of size K/14c Count Distinct Elements in Window of size K.cpp:30
Function
main
09. Hashing/11 Longest Subarray with Equal 0s and 1s/11a Longest SubArray with equal 0s and 1s.cpp:32
Function
main
09. Hashing/11 Longest Subarray with Equal 0s and 1s/11b Longest SubArray with equal 0s and 1s.cpp:42
Function
main
09. Hashing/07 Pair Sum/07b Pair with given Sum.cpp:21
Function
main
09. Hashing/07 Pair Sum/07a Pair with given Sum.cpp:19
Function
main
09. Hashing/02 Unordered Map/02 Unordered Map.cpp:4
Function
main
09. Hashing/06 Union of Arrays/06 Union of Arrays.cpp:16
Function
main
09. Hashing/01 Unordered Set/01 Unordered Set.cpp:4
Function
main
09. Hashing/05 Intersection of Arrays/05a Intersection of Arrays.cpp:42
Function
main
09. Hashing/05 Intersection of Arrays/05c Intersection of Arrays.cpp:21
Function
main
09. Hashing/05 Intersection of Arrays/05b Intersection of Arrays.cpp:21
Function
main
22. Trie/01 Introduction.cpp:4
Function
main
22. Trie/02 Trie Representation.cpp:59
Function
main
22. Trie/03 Trie Delete.cpp:65
Function
main
21. Dynamic Programming/04 Coin Change/04b Coin Change.cpp:32
Function
main
21. Dynamic Programming/04 Coin Change/04c Coin Change.cpp:40
Function
main
21. Dynamic Programming/04 Coin Change/04a Coin Change.cpp:25
Function
main
21. Dynamic Programming/02 Nth Fibonacci/02a Nth Fibonacci.cpp:15
Function
main
21. Dynamic Programming/02 Nth Fibonacci/02c Nth Fibonacci.cpp:21
Function
main
21. Dynamic Programming/02 Nth Fibonacci/02b Nth Fibonacci.cpp:22
Function
main
21. Dynamic Programming/03 Longest Common Subsequence/03c Longest Common Subsequence.cpp:28
Function
main
21. Dynamic Programming/03 Longest Common Subsequence/03b Longest Common Subsequence.cpp:31
Function
main
21. Dynamic Programming/03 Longest Common Subsequence/03a Longest Common Subsequence.cpp:32
Function
main
21. Dynamic Programming/05 Edit Distance/05a Edit Distance.cpp:34
Function
main
21. Dynamic Programming/05 Edit Distance/05c Edit Distance.cpp:51
Function
main
21. Dynamic Programming/05 Edit Distance/05b Edit Distance.cpp:41
Function
main
21. Dynamic Programming/06 Maximum Sum with no 2 Consecutive/06a Maximum Sum with no 2 Consecutive.cpp:21
Function
main
21. Dynamic Programming/06 Maximum Sum with no 2 Consecutive/06b Maximum Sum with no 2 Consecutive.cpp:26
Function
main
21. Dynamic Programming/06 Maximum Sum with no 2 Consecutive/06c Maximum Sum with no 2 Consecutive.cpp:22
Function
main
21. Dynamic Programming/01 Introduction/01 Introduction.cpp:3
Function
main
11. Linked List/11 Doubly Linked List Class/11 Doubly Linked List Class.cpp:31
Function
main
11. Linked List/20 Insert At Tail Circular LL/20 Insert At Tail Circular LL.cpp:63
Function
main
11. Linked List/28 Recursive Reverse of LL/28 Recursive Reverse of LL.cpp:42
Function
main
11. Linked List/26 Find Nth Node From End Of LL/26a Find Nth Node From End Of LL.cpp:64
Function
main
11. Linked List/26 Find Nth Node From End Of LL/26b Find Nth Node From End Of LL.cpp:53
Function
main
11. Linked List/23 Circular Doubly Linked List/23 Circular Doubly Linked List.cpp:52
Function
main
11. Linked List/07 Delete At Tail/07 Delete At Tail.cpp:56
Function
main
11. Linked List/05 Insert At Tail/05 Insert At Tail.cpp:52
Function
main
11. Linked List/12 Insert At Head Doubly LL/12 Insert At Head Doubly LL.cpp:46
Function
main
11. Linked List/16 Delete At Tail Double LL/16 Delete At Tail Doubly LL.cpp:57
Function
main
11. Linked List/38 Clone a LL with Random Pointer/38a Clone a LL with Random Pointer.cpp:55
Function
main
11. Linked List/29 Remove Duplicates from Sorted LL/29 Remove Duplicates from Sorted LL.cpp:55
Function
main
11. Linked List/40 Merge Two Sorted LL/40 Merge Two Sorted LL.cpp:63
Function
main
11. Linked List/13 Insert At Tail Doubly LL/13 Insert At Tail Doubly LL.cpp:53
Function
main
11. Linked List/02 Iterative Traversal/02 Iterative Traversal.cpp:29
Function
main
11. Linked List/08 Insert At Given Position/08 Insert At Given Position.cpp:65
Function
main
11. Linked List/31 Detect Loop/31a Detect Loop.cpp:37
Function
main
11. Linked List/31 Detect Loop/31b Detect Loop.cpp:54
Function
main
11. Linked List/10 Recursive Search/10 Recursive Search.cpp:51
Function
main
11. Linked List/01 Linked List Class/01 Linked List Class.cpp:17
Function
main
11. Linked List/18 Traversing Circular LL/18 Traversing Ciruclar LL.cpp:40
Function
main
11. Linked List/19 Insert At Head Circular LL/19a Insert At Head Circular LL.cpp:63
Function
main
11. Linked List/19 Insert At Head Circular LL/19b Insert At Head Circular LL.cpp:61
Function
main
11. Linked List/21 Delete at Head Circular LL/21 Delete At Head Circular LL.cpp:65
Function
main
11. Linked List/17 Circular Linked List Class/17 Circular Linked List Class.cpp:17
Function
main
11. Linked List/32 Detect Loop Using Floyd Cycle Detection/32 Detect Loop Using Floyd Cycle Detection.cpp:38
Function
main
11. Linked List/22 Delete Kth Node in Circular LL/22 Delete Kth Node in Circular LL.cpp:93
Function
main
11. Linked List/36 Intersection Point of Two Linked Lists/36a Intersection Point of Two Linked Lists.cpp:54
Function
main
11. Linked List/36 Intersection Point of Two Linked Lists/36b Intersection Point of Two Linked Lists.cpp:63
Function
main
11. Linked List/06 Delete At Head/06 Delete At Head.cpp:43
Function
main
11. Linked List/34 Delete Node With Only Pointer Given/34 Delete Node With Only Pointer Given.cpp:43
Function
main
11. Linked List/33 Detect and Remove Loop/33 Detect and Remove Loop.cpp:63
Function
main
11. Linked List/30 Reverse LL in group size of K/30a Reverse LL in group size of K.cpp:60
Function
main
11. Linked List/30 Reverse LL in group size of K/30b Reverse LL in group size of K.cpp:60
Function
main
11. Linked List/35 Seagregate Even Odd Nodes of LL/35 Segregate Even Odd Nodes of LL.cpp:82
Function
main
11. Linked List/09 Iterative Search/09 Iterative Search.cpp:46
Function
main
11. Linked List/25 Middle Of Linked List/25b Middle Of Linked List.cpp:48
Function
main
11. Linked List/25 Middle Of Linked List/25a Middle Of Linked List.cpp:51
Function
main
11. Linked List/14 Reverse Doubly LL/14 Reverse Doubly LL.cpp:52
Function
main
11. Linked List/03 Recursive Traversal/04 Insert at Head.cpp:37
Function
main
11. Linked List/03 Recursive Traversal/03 Recursive Traversal.cpp:30
Function
main
11. Linked List/15 Delete At Head Doubly LL/15 Delete At Head Doubly LL.cpp:52
Function
main
11. Linked List/24 Sorted Insert in LL/24 Sorted Insert in LL.cpp:57
Function
main
11. Linked List/41 Palindrome Linked List/41 Palindrome Linked List.cpp:82
Function
main
11. Linked List/37 Pairwise Node Swap of LL/37 Pairwise Node Swap of LL.cpp:41
Function
main
11. Linked List/27 Iterative Reverse of LL/27a Iterative Reverse of LL.cpp:53
Function
main
11. Linked List/27 Iterative Reverse of LL/27b Iterative Reverse of LL.cpp:45
Function
main
07. Sorting/20 Minimum Difference in Array/20a Minimum Difference in Array.cpp:20
Function
main
07. Sorting/20 Minimum Difference in Array/20b Minimum Difference in Array.cpp:20
Function
main
07. Sorting/13 Lomuto Partition/13b Lomuto Partitioning.cpp:36
Function
main
07. Sorting/13 Lomuto Partition/13a Lomuto Partitioning.cpp:33
Function
main
07. Sorting/11 Partition Algorithms Introduction/11a Partitioning Introduction.cpp:4
Function
main
07. Sorting/11 Partition Algorithms Introduction/11b Partitioning Algorithms.cpp:4
Function
main
07. Sorting/09 Union of Two Sorted Arrays/09a Union of Two Sorted Arrays.cpp:29
Function
main
07. Sorting/09 Union of Two Sorted Arrays/09b Union of Two Sorted Arrays.cpp:57
Function
main
07. Sorting/12 Naive Partition/12 Naive Partitioning.cpp:56
Function
main
07. Sorting/07 Merge Sort/07b Merge Function of Merge Sort.cpp:55
Function
main
07. Sorting/07 Merge Sort/07a Merge Sort Introduction.cpp:3
Function
main
07. Sorting/07 Merge Sort/07c Merge Sort.cpp:71
Function
main
07. Sorting/15 Quick Sort/15a Quick Sort Introduction.cpp:4
Function
main
07. Sorting/15 Quick Sort/15b Quick Sort using Lomuto Partition.cpp:46
Function
main
07. Sorting/15 Quick Sort/15c Quick Sort using Hoare Partition.cpp:54
Function
main
07. Sorting/08 Intersection of Two Sorted Arrays/08b Intersection of two Sorted Arrays.cpp:33
Function
main
07. Sorting/08 Intersection of Two Sorted Arrays/08a Intersection of two Sorted Arrays.cpp:24
Function
main
07. Sorting/05 Insertion Sort/05 Insertion Sort.cpp:37
Function
main
07. Sorting/03 Bubble Sort/03a Bubble Sort.cpp:35
← previous
next →
701–800 of 1,161, ranked by callers