Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
Algorithms
This is where I save my algorithm challenges.
Choosing pivot in Quicksort
🔍 How to Choose a Pivot in Quick Sort
Jump Game II
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Longest Palindromic Substring
Given a string s, return the longest palindromic substring in s.