{"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-03-07T06:59:31.772064+00:00","slug":"merge-two-sorted-lists","title":"21. Merge Two Sorted Lists","excerpt":"You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"}]}},{"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-01T09:27:17.692723+00:00","slug":"counting-bits","title":"338. Counting Bits","excerpt":"Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]}},{"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-01T09:24:09.547053+00:00","slug":"summary-ranges","title":"228. Summary Ranges","excerpt":"You are given a sorted unique integer array nums. Return the smallest sorted list of ranges that cover all the numbers in the array exactly.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"sort","slug":"sort"},{"name":"Array","slug":"array"}]}},{"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:14:44.955297+00:00","slug":"compare-version-numbers","title":"165. Compare Version Numbers","excerpt":"Given two version numbers, version1 and version2, compare them.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Array","slug":"array"}]}},{"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-21T05:29:35.564906+00:00","slug":"majority-element","title":"169. Majority Element","excerpt":"Given an array nums of size n, return the majority element.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"Array","slug":"array"}]}},{"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-20T02:31:41.020146+00:00","slug":"remove-covered-intervals","title":"1288. Remove Covered Intervals","excerpt":"Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list. Return the number of remaining intervals.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"sort","slug":"sort"},{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"array"},"__N_SSG":true}