{"pageProps":{"posts":{"edges":[{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-05-11T03:46:52.857506+00:00","slug":"count-sorted-vowel-strings","title":"1641. Count Sorted Vowel Strings","excerpt":"Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"name":"memoization","slug":"memoization"},{"name":"Python","slug":"python"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-03-03T04:22:33.467366+00:00","slug":"arithmetic-slices","title":"413. Arithmetic Slices","excerpt":"Given an integer array nums, return the number of arithmetic subarrays of nums.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"Python","slug":"python"},{"name":"memoization","slug":"memoization"},{"name":"Recursion","slug":"recursion"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-02-27T04:20:15.668727+00:00","slug":"shortest-path-visiting-all-nodes","title":"847. Shortest Path Visiting All Nodes","excerpt":"You have an undirected, connected graph of n nodes labeled from 0 to n - 1. You are given an array graph where graph[i] is a list of all the nodes connected with node i by an edge. Return the length of the shortest path that visits every node. You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"memoization","slug":"memoization"},{"name":"Python","slug":"python"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-02-19T18:05:57.126456+00:00","slug":"interleaving-string","title":"97. Interleaving String","excerpt":"Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"name":"java","slug":"java"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"},{"name":"memoization","slug":"memoization"},{"name":"Recursion","slug":"recursion"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-02-19T14:09:18.694417+00:00","slug":"minimum-cost-for-tickets","title":"983. Minimum Cost For Tickets","excerpt":"You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365. Return the minimum number of dollars you need to travel every day in the given list of days.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"name":"java","slug":"java"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"},{"name":"memoization","slug":"memoization"},{"name":"Recursion","slug":"recursion"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-02-18T17:17:53.446949+00:00","slug":"number-of-dice-rolls-with-target-sum","title":"1155. Number of Dice Rolls With Target Sum","excerpt":"You have n dice and each die has k faces numbered from 1 to k. Given three integers n, k, and target, return the number of possible ways (out of the kn total ways) to roll the dice so the sum of the face-up numbers equals target. Since the answer may be too large, return it modulo 109 + 7.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"name":"java","slug":"java"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"},{"name":"memoization","slug":"memoization"},{"name":"Recursion","slug":"recursion"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"memoization"},"__N_SSG":true}