mndxpnsn,github

graph-theory-i

All solutions to the problems in the "Graph Theory I" study plan on LeetCode.

guapo-game

Implementation of Guapo Game for iOS

hanoi

Solution to the "Tower of Hanoi" problem.

hanoi-tower

Solution to the "Tower of Hanoi" problem on HackerRank.

house-robber

Dynamic programming solution to the "House Robber" problem on LeetCode.

house-robber-ii

Dynamic programming solution to the "House Robber II" problem on LeetCode.

integer-break

Dynamic programming solution to the "Integer Break" problem on LeetCode.

is-subsequence

Solution to the "Is Subsequence" problem on LeetCode.

jump-game

Solution to the "Jump Game" problem on LeetCode.

jump-game-ii

Dynamic programming solution to the "Jump Game II" problem on LeetCode.

knapsack

Dynamic programming solution to the knapsack problem.

lcs

Longest common subsequence using dynamic programming.

lcs-ints

Longest common subsequence of a pair of vectors of ints using dynamic programming.

lcs-size

Size of longest common subsequence of a pair of strings.

letter-combo

Dynamic programming solution to the number of m-letter combinations where each letter is in alphabetical order.

long-incr-subseq

Longest strictly increasing subsequence using dynamic programming.

longest-common-subsequence

Dynamic programming solution for the "Longest Common Subsequence" problem on LeetCode.

longest-increasing-subsequence

Dynamic programming solution to the "Longest Increasing Subsequence" problem on LeetCode.

longest-palindromic-subsequence

Dynamic programming solution to the "Longest Palindromic Subsequence" problem on LeetCode.

longest-palindromic-substring

Solution to the "Longest Palindromic Substring" problem on LeetCode.

lps

Longest palindrome substring. This is a solution to a problem on HackerRank.

lps-dp

Longest palindromic subsequence using dynamic programming.

matrix-block-sum

Solution to the "Matrix Block Sum" problem on LeetCode.

matrix-chain-mult

Determining the optimum number of operations of a product of matrices using dynamic programming.

matrix-inverse

Computing the inverse of a matrix using cofactor expansion.

max-line-points

Solution to the "Max Points on a Line" problem on Leetcode.

max-positive-product

Divide and conquer solution to the "Maximum Length of Subarray With Positive Product" problem on LeetCode.

max-sub

Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm.

max-subarray

Solution to the "Maximum Subarray" problem on LeetCode.

max-subarray-prod

Divide and conquer solution to the "Maximum Product Subarray" problem on LeetCode.

mndxpnsn Goto Github PK

mndxpnsn's Projects

Recommend Projects

Recommend Topics

Recommend Org