AlgoMaster.io - Master DSA Patterns

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Move Zeroes	Easy
	Majority Element	Easy
	Remove Duplicates from Sorted Array	Easy
	Best Time to Buy and Sell Stock	Easy
	Rotate Array	Medium
	Product of Array Except Self	Medium
	Best Time to Buy and Sell Stock II	Medium
	Number of Zero-Filled Subarrays	Medium
	Increasing Triplet Subsequence	Medium
	First Missing Positive	Hard

Strings

0 / 6

Is Subsequence

Easy

Valid Palindrome

Easy

Longest Common Prefix

Easy

Zigzag Conversion

Medium

Reverse Words in a String

Medium

Guess the Word

Hard

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Is Subsequence	Easy
	Valid Palindrome	Easy
	Longest Common Prefix	Easy
	Zigzag Conversion	Medium
	Reverse Words in a String	Medium
	Guess the Word	Hard

Bit Manipulation

0 / 7

Easy

Easy

Easy

Easy

Bitwise AND of Numbers Range

Medium

Single Number III

Medium

Sum of Two Integers

Medium

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Single Number	Easy
	Number of 1 Bits	Easy
	Counting Bits	Easy
	Reverse Bits	Easy
	Bitwise AND of Numbers Range	Medium
	Single Number III	Medium
	Sum of Two Integers	Medium

Hash Tables

0 / 13

Design HashMap

Easy

Maximum Number of Balloons

Easy

Number of Good Pairs

Easy

Isomorphic Strings

Easy

Ransom Note

Easy

Contains Duplicate II

Easy

Group Anagrams

Medium

Encode and Decode TinyURL

Medium

Reorganize String

Medium

Longest Consecutive Sequence

Medium

Split Array into Consecutive Subsequences

Medium

Number of Matching Subsequences

Medium

Number of Good Ways to Split a String

Medium

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Design HashMap	Easy
	Maximum Number of Balloons	Easy
	Number of Good Pairs	Easy
	Isomorphic Strings	Easy
	Ransom Note	Easy
	Contains Duplicate II	Easy
	Group Anagrams	Medium
	Encode and Decode TinyURL	Medium
	Reorganize String	Medium
	Longest Consecutive Sequence	Medium
	Split Array into Consecutive Subsequences	Medium
	Number of Matching Subsequences	Medium
	Number of Good Ways to Split a String	Medium

Two Pointers

0 / 5

Merge Sorted Array

Easy

Two Sum II - Input Array Is Sorted

Medium

Container With Most Water

Medium

3Sum

Medium

Trapping Rain Water

Hard

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Merge Sorted Array	Easy
	Two Sum II - Input Array Is Sorted	Medium
	Container With Most Water	Medium
	3Sum	Medium
	Trapping Rain Water	Hard

Prefix Sum

0 / 5

Range Sum Query - Immutable

Easy

Subarray Sum Equals K

Medium

Subarray Sums Divisible by K

Medium

Continuous Subarray Sum

Medium

Contiguous Array

Medium

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Range Sum Query - Immutable	Easy
	Subarray Sum Equals K	Medium
	Subarray Sums Divisible by K	Medium
	Continuous Subarray Sum	Medium
	Contiguous Array	Medium

Sliding Window - Fixed Size

0 / 5

Maximum Average Subarray I

Easy

Find All Anagrams in a String

Medium

Permutation in String

Medium

Maximum Sum of Distinct Subarrays With Length K

Medium

Substring with Concatenation of All Words

Hard

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Maximum Average Subarray I	Easy
	Find All Anagrams in a String	Medium
	Permutation in String	Medium
	Maximum Sum of Distinct Subarrays With Length K	Medium
	Substring with Concatenation of All Words	Hard

Sliding Window - Dynamic Size

0 / 5

Longest Substring Without Repeating Characters

Medium

Longest Repeating Character Replacement

Medium

Minimum Size Subarray Sum

Medium

Max Consecutive Ones III

Medium

Minimum Window Substring

Hard

Status	Problem	Difficulty	Frequency	Leetcode	Solution	Actions
	Longest Substring Without Repeating Characters	Medium
	Longest Repeating Character Replacement	Medium
	Minimum Size Subarray Sum	Medium
	Max Consecutive Ones III	Medium
	Minimum Window Substring	Hard