{"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-22T02:50:09.859207+00:00","slug":"kth-largest-element-in-an-array","title":"215. Kth Largest Element in an Array","excerpt":"Given an integer array nums and an integer k, return the kth largest element in the array.\nNote that it is the kth largest element in the sorted order, not the kth distinct element.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"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-21T03:59:59.999144+00:00","slug":"furthest-building-you-can-reach","title":"1642. Furthest Building You Can Reach","excerpt":"You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. You start your journey from building 0 and move to the next building by possibly using bricks or ladders. Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"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-20T06:13:02.175831+00:00","slug":"short-encoding-of-words","title":"820. Short Encoding of Words","excerpt":"Given an array of words, return the length of the shortest reference string s possible of any valid encoding of words.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"Trie","slug":"trie"}]}},{"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-19T03:52:01.047588+00:00","slug":"search-suggestions-system","title":"1268. Search Suggestions System","excerpt":"You are given an array of strings products and a string searchWord. Design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products. Return a list of lists of the suggested products after each character of searchWord is typed.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"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-18T03:46:09.351057+00:00","slug":"prefix-and-suffix-search","title":"745. Prefix and Suffix Search","excerpt":"Design a special dictionary with some words that searchs the words in it by a prefix and a suffix.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"Python","slug":"python"},{"name":"Trie","slug":"trie"},{"name":"LeetCode","slug":"leetcode"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"leetcode"},"__N_SSG":true}