{"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":"2023-01-03T04:02:49.371301+00:00","slug":"delete-columns-to-make-sorted","title":"944. Delete Columns to Make Sorted","excerpt":"You are given an array of n strings strs, all of the same length. For example, strs = [\"abc\", \"bce\", \"cae\"]. You want to delete the columns that are not sorted lexicographically. Return the number of columns that you will delete.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"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-06-11T15:57:20.49744+00:00","slug":"minimum-operations-to-reduce-x-to-zero","title":"1658. Minimum Operations to Reduce X to Zero","excerpt":"You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x. Note that this modifies the array for future operations. Return the minimum number of operations to reduce x to exactly 0 if it is possible, otherwise, return -1.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"java","slug":"java"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-06-08T04:53:39.241773+00:00","slug":"remove-palindromic-subsequences","title":"1332. Remove Palindromic Subsequences","excerpt":"You are given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s. Return the minimum number of steps to make the given string empty.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"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-05-22T16:14:29.747995+00:00","slug":"palindromic-substrings","title":"647. Palindromic Substrings","excerpt":"Given a string s, return the number of palindromic substrings in it.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"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-05-19T05:50:20.452355+00:00","slug":"longest-increasing-path-in-a-matrix","title":"329. Longest Increasing Path in a Matrix","excerpt":"Given an m x n integers matrix, return the length of the longest increasing path in matrix.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"name":"Explanation","slug":"explanation"},{"name":"Python","slug":"python"},{"name":"DFS","slug":"dfs"}]}},{"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-13T06:08:39.985119+00:00","slug":"populating-next-right-pointers-in-each-node-ii","title":"117. Populating Next Right Pointers in Each Node II","excerpt":"Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"Python","slug":"python"},{"name":"BFS","slug":"bfs"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"explanation"},"__N_SSG":true}