𝗗𝗼𝗻’𝘁 𝗝𝘂𝘀𝘁 𝗟𝗲𝗲𝘁𝗖𝗼𝗱𝗲, 𝗙𝗼𝗹𝗹𝗼𝘄 𝘁𝗵𝗲 𝗖𝗼𝗱𝗶𝗻𝗴 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀

日月星辰于 2024-03-10 发布在Programming

Follow the below-mentioned 𝟮𝟬+ 𝗰𝗼𝗱𝗶𝗻𝗴 𝗽𝗮𝘁𝘁𝗲𝗿𝗻𝘀 to learn the underline algorithms
Here are the patterns:

Sliding Window
Islands (Matrix Traversal)
Two Pointers
Fast & Slow Pointers
Merge Intervals
Cyclic Sort
In-place Reversal of a LinkedList
Tree Breadth-First Search
Tree Depth First Search
Two Heaps
Subsets
Modified Binary Search
Bitwise XOR
Top ‘K’ Elements
K-way Merge
Topological Sort
0/1 Knapsack
Fibonacci Numbers
Palindromic Subsequence
Longest Common Substring
Topological Sort
Backtracking
Multi-threaded

More practice

更新于2024-03-11
1.Sliding Window

Usage: This algorithmic technique is used when we need to handle the input data in a specific window size.

DS Involved: Array, String, HashTable
Sample Problems:

Longest Substring with 'K' Distinct Characters

Fruits into Baskets
更新于2024-03-11
2.islands (Matrix Traversal)

Usage: This pattern describes all the efficient ways of traversing a matrix (or 2D array).

DS Involved: Matrix, Queue
Sample Problems:

Number of islands

Flood Fill

Cycle in a Matrix
更新于2024-03-11
3.Two Pointers

Usage: This technique uses two pointers to iterate input data. Generally, both pointers move in the opposite direction at a constant interval.
DS Involved: Array, String, LinkedList
Sample Problems:

Squaring a Sorted Array

Dutch National Flag Problem

Minimum Window Sort
更新于2024-03-11
4. Fast & Slow Pointers

Usage: Also known as Hare & Tortoise algorithm. This technique uses two pointers that traverse the input data at different speeds.
DS Involved: Array, String, LinkedList

Sample Problems:

Middle of the Linked

ListHappy Number

Cycle in a Circular Array
更新于2024-03-11
5. Merge Intervals

Usage: This technique is used to deal with overlapping intervals.

Ds Involved: Array, Heap
Sample Problems.

Conflicting Appointments

Minimum Meeting Rooms
更新于2024-03-11
6. Cyclic sort

Usage: Use this technique to solve array!problems where the input data lies within a fixed range.
DS Involved: Array!
Sample Problems.

Find all Missing Numbers

Find all Duplicate Numbers

Find the First K Missing Positive Numbers
更新于2024-03-11
7.In-place Reversal of a LinkedList

Usage: This technique describes an efficient way to reverse the links between a set of nodes of a LinkedList. Often, the constraint is that we need to do this in-place, i.e., using the existing node objects and without using extra memory!
DS Involved: LinkedList
Sample Problems.

Reverse every K-element Sub-list

Rotate a LinkedList
更新于2024-03-11
8.Breadth-First search

Usage: This technique is used to solve problems involving traversing trees or graphs in a breadth-first search manner.
DS Involved: Tree, Graph, Matrix, Queue
Sample Problems.

Binary Tree Level Order Traversal

Minimum Depth of a Binary TreeConnect Level Order Siblings
更新于2024-03-11
9. Depth First Search

Usage: This technique is used to solve problems involving traversing trees or graphs in a depth-first search manner.
DSInvolved: Tree, Graph, Matrix
Sample Problems.

Path With Given sequence

Count Paths for a sum
更新于2024-03-11
10.Two Heaps

Usage: In many problems, we are given a set of elements that can be divided into two parts. We are interested in knowing the smallest element in one part and the biggest element in the other part. As the name suggests, this technique uses a Min-Heap to find the smallest element and aMax-Heap to find the biggest element.
DS Involved: Heap, Array
Sample Problems:

Find the Median of a Number stream

Next Interval
更新于2024-03-11
11.Subsets

Usage: Use this technique when the problem asks to deal with permutations or combinations of a set of elements.
Ds Involved: Queue, Array, String
Sample Problems:

String Permutations by changing case

Unique Generalized Abbreviations
更新于2024-03-11
12. Modified Binary search

Usage: Use this technique to search a sorted set of elements efficiently.
DS Involved: Array
Sample Problems:

Ceiling of a Number

Bitonic Array Maximum
更新于2024-03-11
13. Bitwise XOR

Usage: This technique uses the XOR operator to manipulate bits to solve problems.
DS Involved: Array, Bits
Sample Problems:

Two Single Numbers

Flip and invert an image
更新于2024-03-11
14. Top 'K' Elements

Usage: This technique is used to find top/smallest/frequently occurring 'K' elements in a set.
DS Involved: Array, Heap, Queue
Sample Problems

K' Closest Points to the Origin

Maximum Distinct Elements
更新于2024-03-11
15.K-way Merge

Usage: This technique helps us solve problemsthat involve a list of sorted arrays.
Ds Involved: Array, Queue, Heap
Sample Problems

Kth Smallest Number in M Sorted Lists

Kth Smallest Number in a Sorted Matrix
更新于2024-03-11
16.0/1 Knapsack

Usage: This technique is used to solve optimization problems. Use this technique to select elements that give maximum profit from a given set with a limitation on capacity and that each element can only be picked once.
DS Involved: Array, HashTable
Sample Problems:

Equal Subset Sum Partition

Minimum Subset Sum Difference
更新于2024-03-11
17.Unbounded Knapsack

Usage: Use this technique to select elementsthat give maximum profit from a given set with alimitation on capacity and that each elementcan be picked multiple times.
DS Involved: Array, HashTable
Sample Problems.

Rod Cutting.

Coin Change
更新于2024-03-11
18.Fibonacci Numbers

Usage: Use this technique to solve problemsthat follow the Fibonacci numbers sequence.i.e., every subsequent number is calculatedfrom the last few numbers.
DS Involved: Array, HashTable
Sample Problems.

Staircase.

House Thief
更新于2024-03-11
19.Palindromic subsequence

Usage: This technique is used to solveoptimization problems related to palindromicsequences or strings.
DS Involved: Array, HashTable
Sample Problems.

Longest Palindromic Subsequence

Minimum Deletions in a String to make it aPalindrome
更新于2024-03-11
20.Longest Common Substring

Usage: Use this technique to find the optimalpart of a string/sequence or set ofstrings/sequences
DS Involved: Array, HashTable
Sample Problems.

Maximum Sum Increasing Subsequence

Edit Distance
更新于2024-03-11
21. Topological Sort

Usage: Use this technique to find a linearordering of elements that have dependencieson each other.
DS Involved: Array, HashTable, Queue, Graph
Sample Problems.

Tasks Scheduling

Alien Dictionany
更新于2024-03-11
22. Backtracking

Usage: Use this technique to build a solutionincrementally and follow the approach that ifthe current solution can't lead to a validsolution, abandon it and backtrack (or go back)to try another solution.
DS Involved: Array, HashTable, LinkedList
Sample Problems.

Combination sum

Sudoku Solver
更新于2024-03-11
23.Multi-threaded

Usage: Make your algorithm multi-threaded toperform multiple concurrent tasks or toperform pre-fetching or post-processingfunctions to speed things up
Sample Problems:

Same Tree

Invert Binary TreeBinary Search Tree lterator

日月星辰's Blog

🗂️ 归档

📑 分类

🏷️ 标签

👉 About

𝗗𝗼𝗻’𝘁 𝗝𝘂𝘀𝘁 𝗟𝗲𝗲𝘁𝗖𝗼𝗱𝗲, 𝗙𝗼𝗹𝗹𝗼𝘄 𝘁𝗵𝗲 𝗖𝗼𝗱𝗶𝗻𝗴 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀

1.Sliding Window

2.islands (Matrix Traversal)

3.Two Pointers

4. Fast & Slow Pointers

5. Merge Intervals

6. Cyclic sort

7.In-place Reversal of a LinkedList

8.Breadth-First search

9. Depth First Search

10.Two Heaps

11.Subsets

12. Modified Binary search

13. Bitwise XOR

14. Top 'K' Elements

15.K-way Merge

16.0/1 Knapsack

17.Unbounded Knapsack

18.Fibonacci Numbers

19.Palindromic subsequence

20.Longest Common Substring

21. Topological Sort

22. Backtracking

23.Multi-threaded