{"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-06-14T03:52:48.638452+00:00","slug":"delete-operation-for-two-strings","title":"583. Delete Operation for Two Strings","excerpt":"Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same. In one step, you can delete exactly one character in either string.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"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-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-04T06:20:28.184863+00:00","slug":"n-queens","title":"51. N-Queens","excerpt":"The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"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-03T04:29:13.756642+00:00","slug":"range-sum-query-2d-immutable","title":"304. Range Sum Query 2D - Immutable","excerpt":"Given a 2D matrix matrix, handle multiple queries.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"java","slug":"java"},{"name":"Dynamic Programming","slug":"dp"}]}},{"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-25T04:24:22.485908+00:00","slug":"russian-doll-envelopes","title":"354. Russian Doll Envelopes","excerpt":"You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope. One envelope can fit into another if and only if both the width and height of one envelope are greater than the other envelope's width and height. Return the maximum number of envelopes you can Russian doll (i.e., put one inside the other).","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Dynamic Programming","slug":"dp"},{"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-05-24T04:22:19.976343+00:00","slug":"longest-valid-parentheses","title":"32. Longest Valid Parentheses","excerpt":"Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"java","slug":"java"},{"name":"Stack","slug":"stack"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"java"},"__N_SSG":true}