Scribd
Upload
6 views2 pages

LeetCode Problem Solutions Overview

The document lists various algorithmic problems categorized into different techniques such as Two Pointers, Sliding Window, Fast & Slow, Binary Search, Prefix Sum, DFS/BFS, Backtracking, Union-Find, Monotonic, and Dynamic Programming. Each category includes specific problem titles along with their corresponding identifiers. This structured approach aids in understanding and solving algorithmic challenges efficiently.

Uploaded by

a1anjshy
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
6 views2 pages

LeetCode Problem Solutions Overview

The document lists various algorithmic problems categorized into different techniques such as Two Pointers, Sliding Window, Fast & Slow, Binary Search, Prefix Sum, DFS/BFS, Backtracking, Union-Find, Monotonic, and Dynamic Programming. Each category includes specific problem titles along with their corresponding identifiers. This structured approach aids in understanding and solving algorithmic challenges efficiently.

Uploaded by

a1anjshy
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

Pattern Problem

Two PointeTwo Sum II (#167)


Two PointeRemove Duplicates from Sorted Array (#26)
Two PointeMove Zeroes (#283)
Two Pointe3Sum (#15)
Two PointeContainer With Most Water (#11)
Sliding Wi Longest Substring Without Repeating Characters (#3)
Sliding Wi Maximum Sum Subarray of Size K (#643)
Sliding Wi Minimum Window Substring (#76)
Sliding Wi Minimum Size Subarray Sum (#209)
Sliding Wi Permutation in String (#567)
Sliding Wi Subarrays with K Different Integers (#992)
Sliding Wi Longest Repeating Character Replacement (#424)
Sliding Wi Maximum Consecutive Ones III (#1004)
Sliding Wi Find All Anagrams in a String (#438)
Sliding Wi Sliding Window Maximum (#239)
Fast & SlowLinked List Cycle (#141)
Fast & SlowLinked List Cycle II (#142)
Fast & SlowFind the Duplicate Number (#287)
Fast & SlowMiddle of the Linked List (#876)
Fast & SlowPalindrome Linked List (#234)
Binary Sea Binary Search (#704)
Binary Sea Search in Rotated Sorted Array (#33)
Binary Sea Find Minimum in Rotated Sorted Array (#153)
Binary Sea Find First and Last Position of Element (#34)
Binary Sea Median of Two Sorted Arrays (#4)
Prefix SumRange Sum Query - Immutable (#303)
Prefix SumSubarray Sum Equals K (#560)
Prefix SumContiguous Array (#525)
Prefix SumFind Pivot Index (#724)
Prefix SumMaximum Size Subarray Sum Equals k (#325)
DFS / BFS Number of Islands (#200)
DFS / BFS Max Area of Island (#695)
DFS / BFS Clone Graph (#133)
DFS / BFS Word Ladder (#127)
DFS / BFS Course Schedule (#207)
Backtracki Subsets (#78)
Backtracki Permutations (#46)
Backtracki Combination Sum (#39)
Backtracki Word Search (#79)
Backtracki N-Queens (#51)
Union-FindGraph Valid Tree (#261)
Union-FindNumber of Connected Components in an Undirected Graph (#323)
Union-FindAccounts Merge (#721)
Union-FindRedundant Connection (#684)
Union-FindFriend Circles (#547)
MonotonicNext Greater Element I (#496)
MonotonicNext Greater Element II (#503)
MonotonicDaily Temperatures (#739)
MonotonicLargest Rectangle in Histogram (#84)
MonotonicSliding Window Maximum (#239)
Dynamic P Climbing Stairs (#70)
Dynamic P House Robber (#198)
Dynamic P Unique Paths (#62)
Dynamic P Longest Increasing Subsequence (#300)
Dynamic P Longest Common Subsequence (#1143)
Dynamic P Coin Change (#322)
Dynamic P Word Break (#139)
Dynamic P Palindrome Partitioning (#131)
Dynamic P Burst Balloons (#312)
Dynamic P Edit Distance (#72)

You might also like