{"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-30T04:05:20.683214+00:00","slug":"divide-two-integers","title":"29. Divide Two Integers","excerpt":"Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"C++","slug":"cpp"},{"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-05-28T03:59:03.902298+00:00","slug":"missing-number","title":"268. Missing Number","excerpt":"Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"name":"Mathematical","slug":"mathematical"},{"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-05-26T03:58:35.259871+00:00","slug":"number-of-1-bits","title":"191. Number of 1 Bits","excerpt":"Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Python","slug":"python"},{"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: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-01-27T09:20:21.336013+00:00","slug":"maximum-xor-of-two-numbers-in-an-array","title":"421. Maximum XOR of Two Numbers in an Array","excerpt":"Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"java","slug":"java"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]}}],"pageInfo":{"hasNextPage":false,"hasPreviousPage":false,"pageSize":5}},"slug":"bit-manipulation"},"__N_SSG":true}