Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/MAZHARMIK/Interview_DS_Algo
/ functions
Functions
3,557 in github.com/MAZHARMIK/Interview_DS_Algo
⨍
Functions
3,557
◇
Types & classes
1,501
Method
LCS
DP/Longest Common Subsequence.cpp:16
Method
LCS
DP/Minimum Insertion Steps to Make a String Palindrome.cpp:74
Method
LCS
DP/Delete_Operation_for_Two_Strings.cpp:76
Method
LCS
Approach-1 (Using Concept of LCS)
DP/Longest Palindromic Subsequence.cpp:82
Method
LCS
DP/LIS & Variants/Longest Increasing Subsequence.cpp:66
Method
LFUCache
Design/LFU Cache.cpp:16
Method
LIS
DP/LIS & Variants/Find the Maximum Length of Valid Subsequence I.cpp:17
Method
LL
Bit_Magic/Maximum Number That Sum of the Prices Is Less Than or Equal to K.cpp:126
Method
LPS
copy paste of KMP LPS which I taught
strings/Minimum Time to Revert Word to Initial State II.cpp:22
Method
LPS
DP/Longest Palindromic Subsequence.cpp:19
Method
LRUCache
Design/LRU Cache.cpp:14
Function
List<Boolean> checkArithmeticSubarrays
Arrays/Arithmetic Subarrays.cpp:117
Function
List<Boolean> checkIfPrerequisite
Graph/Topological Sorting/Course Schedule IV.cpp:233
Function
List<Boolean> getResults
Segment Tree/Block Placement Queries.cpp:227
Function
List<Integer> BFS
BFS helper function to find the farthest node and its distance from the source
Graph/BFS_DFS/Find Minimum Diameter After Merging Two Trees.cpp:137
Function
List<Integer> KMP_codestorywithMIK
strings/Find Beautiful Indices in the Given Array I.cpp:130
Function
List<Integer> KMP_codestorywithMIK
strings/Find Beautiful Indices in the Given Array II.cpp:132
Function
List<Integer> beautifulIndices
strings/Find Beautiful Indices in the Given Array I.cpp:182
Function
List<Integer> beautifulIndices
strings/Find Beautiful Indices in the Given Array II.cpp:184
Function
List<Integer> eventualSafeNodes
Graph/Find Eventual Safe States.cpp:170
Function
List<Integer> findAllPeople
Graph/BFS_DFS/Find All People With Secret.cpp:313
Function
List<Integer> findArray
Bit_Magic/Find The Original Array of Prefix Xor.cpp:65
Function
List<Integer> findDuplicates
Arrays/Find All Duplicates in an Array.cpp:39
Function
List<Integer> findKDistantIndices
Arrays/Leetcode Easy/Find All K-Distant Indices in an Array.cpp:72
Function
List<Integer> getRow
Arrays/Pascal's Triangle II.cpp:99
Function
List<Integer> inorderTraversal
Tree/Morris Traversal(Binary Tree Inorder Traversal).cpp:45
Function
List<Integer> largestDivisibleSubset
DP/LIS & Variants/Largest Divisible Subset.cpp:94
Function
List<Integer> largestValues
Tree/Find Largest Value in Each Tree Row.cpp:82
Function
List<Integer> luckyNumbers
Arrays/2-D Array/Leetcode Easy/Lucky Numbers in a Matrix.cpp:144
Function
List<Integer> majorityElement
Arrays/Majority Element II.cpp:61
Function
List<Integer> partitionLabels
Arrays/Two Pointer/Partition Labels.cpp:117
Function
List<Integer> sequentialDigits
Arrays/Sequential Digits.cpp:77
Function
List<Integer> solve
Tree/Number of Good Leaf Nodes Pairs.cpp:199
Function
List<Integer> topoSort
Graph/Topological Sorting/Sort Items by Groups Respecting Dependencies.cpp:185
Function
List<Integer> topoSort
Graph/Topological Sorting/Build a Matrix With Conditions.cpp:259
Function
List<List<Integer>> findCriticalAndPseudoCriticalEdges
Graph/Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.cpp:314
Function
List<List<Integer>> findLeaves
Tree/Find Leaves Of Binary Tree.cpp:72
Function
List<List<Integer>> getAncestors
Graph/All Ancestors of a Node in a Directed Acyclic Graph.cpp:268
Function
List<List<Integer>> matrixExponentiation
Matrix exponentiation
Mathematical/Total Characters in String After Transformations II.cpp:108
Function
List<List<Integer>> matrixMultiplication
Matrix multiplication
Mathematical/Total Characters in String After Transformations II.cpp:88
Function
List<List<Integer>> pathSum
Tree/Path Sum II.cpp:49
Function
List<List<Integer>> subsets
Recursion/Subsets.cpp:55
Function
List<List<String>> groupAnagrams
Arrays/Group Anagrams.cpp:128
Function
List<List<String>> partition
Backtracking/Palindrome Partitioning.cpp:187
Function
List<List<String>> solveNQueens
Backtracking/N-Queens.cpp:176
Function
List<String> AllPossibleStrings
Recursion/Power Set.cpp:134
Function
List<String> fullJustify
strings/Text Justification.cpp:81
Function
List<String> generateParenthesis
Backtracking/Generate Parentheses.cpp:138
Function
List<String> getTokens
strings/Compare Version Numbers.cpp:116
Function
List<String> removeAnagrams
strings/Easy Tagged/Find Resultant Array After Removing Anagrams.cpp:84
Function
List<String> removeSubfolders
strings/Remove Sub-Folders from the Filesystem.cpp:119
Function
List<String> solve
Backtracking/Word Break II.cpp:155
Function
List<String> stringMatching
strings/Easy Tagged/String Matching in an Array.cpp:209
Function
List<String> wordBreak
Backtracking/Word Break II.cpp:136
Method
LockingTree
Design/Operations on Tree.cpp:16
Method
LongestCommonPrefixMatrix
DP/DP on Strings/Find the String with LCP.cpp:14
Method
MAH
Stack/Maximal Rectangle.cpp:54
Method
MFS
DP/Minimum Falling Path Sum.cpp:15
Method
MPS
DP/Minimum Path Sum.cpp:15
Method
MST
Graph/Min Cost to Connect All Points.cpp:89
Function
Map<Integer, List<Integer>> buildAdjList
Function to build the adjacency list for a tree
Graph/BFS_DFS/Find Minimum Diameter After Merging Two Trees.cpp:101
Method
MapSum
Design/Map Sum Pairs.cpp:11
Method
MaxStack
direct access of max element Why ordered map ? Access of maximum element can be done in constant time (rbegin(mp)->first) */
Design/Max Stack.cpp:34
Function
MedianFinder
Design/Find Median from Data Stream.cpp:105
Method
MedianFinder
Design/Find Median from Data Stream.cpp:19
Method
MovieRentingSystem
Design/Design Movie Rental System.cpp:33
Function
MyCalendar
Arrays/Intervals_Based_Qn/My Calendar I.cpp:133
Method
MyCalendar
Arrays/Intervals_Based_Qn/My Calendar I.cpp:20
Method
MyCalendarThree
Line Sweep Technique/My Calendar III.cpp:17
Method
MyCalendarTwo
Arrays/Intervals_Based_Qn/My Calendar II.cpp:26
Method
MyCalendarTwo
Line Sweep Technique/My Calendar II.cpp:16
Method
MyCircularDeque
Design/Design Circular Queue.cpp:21
Function
MyHashMap
Design/Design HashMap.cpp:128
Method
MyHashMap
Design/Design HashMap.cpp:16
Method
MyHashSet
Design/Design HashSet.cpp:12
Method
MyQueue
Stack/Implement Queue using Stacks.cpp:20
Method
MyStack
Design/Implement Stack using Queues.cpp:13
Method
NSL
Stack/Maximal Rectangle.cpp:33
Method
NSL
NSL = Next smaller to left
Stack/Largest_Rectangle_in_Histogram.cpp:34
Method
NSR
Stack/Maximal Rectangle.cpp:13
Method
NSR
NSR = Next smaller to right
Stack/Largest_Rectangle_in_Histogram.cpp:11
Function
NestedIterator
Design/Flatten Nested List Iterator.cpp:132
Method
NestedIterator
Design/Flatten Nested List Iterator.cpp:18
Method
Node
Graph/Dijkstra'a Based Problems/Design Graph With Shortest Path Calculator.cpp:133
Method
Node
Trie/Delete Duplicate Folders in System.cpp:122
Method
Node
Tree/Diagonal Tree Traversal (Recursive: using map).cpp:13
Method
Node
Design/All O`one Data Structure.cpp:20
Function
NumArray
Segment Tree/Range Sum Query - Mutable.cpp:148
Method
NumArray
Mathematical/Square Root Decomposition/Range Sum Query - Mutable.cpp:21
Method
NumArray
Segment Tree/Range Sum Query - Mutable.cpp:19
Function
NumberContainers
Design/Design a Number Container System.cpp:136
Method
NumberContainers
Design/Design a Number Container System.cpp:19
Method
OnedArrayCount
Arrays/2-D Array/Count Submatrices With All Ones.cpp:16
Method
P
Heap/Lexicographically Minimum String After Removing Stars.cpp:61
Function
Pair
strings/Sort the Jumbled Numbers.cpp:195
Function
Pair
Graph/BFS_DFS/Minimize the Maximum Edge Weight of Graph.cpp:251
Method
Pair
strings/Sort the Jumbled Numbers.cpp:139
Method
Pair
Graph/Dijkstra'a Based Problems/Minimum Cost Path with Edge Reversals.cpp:72
Method
Pair
Graph/Dijkstra'a Based Problems/Minimum Cost to Convert String I.cpp:90
Method
Pair
Graph/Dijkstra'a Based Problems/Minimum Cost to Convert String II.cpp:160
← previous
next →
501–600 of 3,557, ranked by callers