{"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-04-14T05:00:10.321388+00:00","slug":"search-in-a-binary-search-tree","title":"700. Search in a Binary Search Tree","excerpt":"You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null.","featuredImage":{"url":"https://media.graphassets.com/hMPYrFStXjUlOZVXjMgl"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"C++","slug":"cpp"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-04-07T04:04:21.634231+00:00","slug":"last-stone-weight","title":"1046. Last Stone Weight","excerpt":"You are given an array of integers stones where stones[i] is the weight of the ith stone. Return the smallest possible weight of the left stone. If there are no stones left, return 0.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"C++","slug":"cpp"}]}},{"node":{"author":{"bio":"A humble student of knowledge","id":"ckwhcd81c1m010a96oworz5lu","name":"Md Jawad Noor Asif","photo":{"url":"https://media.graphassets.com/nky5NwkETTKtpNnikulF"}},"createdAt":"2022-04-03T03:25:46.228743+00:00","slug":"reverse-string","title":"344. Reverse String","excerpt":"Write a function that reverses a string. The input string is given as an array of characters s. You must do this by modifying the input array in-place with O(1) extra memory.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"C++","slug":"cpp"}]}},{"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-30T04:25:53.490399+00:00","slug":"search-a-2d-matrix","title":"74. Search a 2D Matrix","excerpt":"Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"C++","slug":"cpp"}]}},{"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-08T09:27:51.066423+00:00","slug":"linked-list-cycle","title":"141. Linked List Cycle","excerpt":"Given head, the head of a linked list, determine if the linked list has a cycle in it.","featuredImage":{"url":"https://media.graphassets.com/osdqSQYqRsuoPm7N7jhn"},"categories":[{"name":"LeetCode","slug":"leetcode"},{"name":"Explanation","slug":"explanation"},{"name":"linked-list","slug":"linked-list"},{"name":"C++","slug":"cpp"}]}}],"pageInfo":{"hasNextPage":true,"hasPreviousPage":false,"pageSize":6}},"slug":"cpp"},"__N_SSG":true}