This is the master index for my series of Leetcode solution explanations. If you like these solutions or found them useful, please like this post.

### Hard Problem Solutions:

# |
TITLE |
RELATED TOPICS |
---|---|---|

32 | Longest Valid Parentheses | Stack |

329 | Longest Increasing Path in a Matrix | Recursion, DFS, Memoization |

354 | Russian Doll Envelopes | LIS, Binary Search, DP |

895 | Maximum Frequency Stack | Frequency Map, Stack |

936 | Stamping The Sequence | Character Mask |

987 | Vertical Order Traversal of a Binary Tree | Tree, DFS, Recursion, Bit Manipulation |

1074 | Number of Submatrices That Sum to Target | Matrix, Map |

1713 | Minimum Operations to Make a Subsequence | LCS, LIS, Binary Search |

1735 | Count Ways to Make Array With Product | Math |

1739 | Building Boxes | Math |

### Medium Problem Solutions:

### Easy Problem Solutions:

# |
TITLE |
RELATED TOPICS |
---|---|---|

13 | Roman to Integer | Math |

141 | Linked List Cycle | Linked List, Floyd's |

160 | Intersection of Two Linked Lists | Linked List |

242 | Valid Anagram | Frequency Map |

243 | Palindrome Linked List | Linked List, Floyd's |

268 | Missing Number | Math |

509 | Fibonacci Number | Math |

594 | Longest Harmonious Subsequence | Frequency Map |

595 | Distribute Candies | Set |

637 | Average of Levels in Binary Tree | Binary Tree, BFS |

645 | Set Mismatch (ver. 1) | Array, Math |

645 | Set Mismatch (ver. 2) | Array, Math |

706 | Design HashMap (ver. 1) | Map, Array |

706 | Design HashMap (ver. 2) | Hashing Function, Linked List |

821 | Shortest Distance to a Character | DP |

953 | Verifying an Alien Dictionary | Map |

1332 | Remove Palindromic Subsequences | String |

1337 | The K Weakest Rows in a Matrix (ver. 1) | Matrix |

1337 | The K Weakest Rows in a Matrix (ver. 2) | Matrix, Binary Search, Heap, Bit Manipulation |

1342 | Number of Steps to Reduce a Number to Zero | Math |

1704 | Determine if String Halves Are Alike | String |

## Discussion (2)

Pretty cool Sean. I'll definitely keep eyes on this series.

Actually, I'll make it better. I'll study one of them a day.

Thanks!

You're welcome, Rafael!

I've been doing the daily leetcode challenge problem pretty much every day for the past 8 months, and I will definitely agree that a little bit each day really helps!