#patterns
Read more stories on Hashnode
Articles with this tag
K-way Merge is a common algorithmic pattern that merges multiple sorted lists or arrays into a single sorted list. This pattern is particularly useful...
Top 'K' Elements is a common problem where the goal is to find the top 'K' elements from a given dataset based on some criteria, such as frequency,...
Backtracking is a general algorithmic technique that involves exploring all possible solutions by incrementally building candidates and abandoning a...
Merge Intervals involves combining overlapping intervals into a single interval. This problem is often encountered in scheduling applications, where...
The sliding window technique is a method used to solve problems involving arrays or lists by maintaining a subset of data within a certain "window"...
The two-pointer approach is a common technique for solving sorted array and linked list problems. It involves using two pointers that traverse the...