Nov 20, 2025 · 3 min read · We all know what happens when Merry Brandybuck and Peregrin Took come together - DISASTER ! Now imagine your array of numbers as the Fellowship. Your job in Two Sum is basically to identify which number plays Merry and which plays Pippin — the perfec...
Join discussionJul 27, 2025 · 2 min read · Problem Given the root of a binary search tree and an integer k, return true if there exist two elements in the BST such that their sum is equal to k, or false otherwise. (link) Example 1: Input: root = [5,3,6,2,4,null,7], k = 9 Output: true Examp...
Join discussionSep 20, 2023 · 12 min read · You have the below dataset: Orange: #10 Apple: #30 Pawpaw: #40 Lemon: #50 Guava: #60 Pineapple: #70 This dataset is a hypothetical dataset of an e-commerce business. You want to implement the feature that a user will be able to search for p...
Join discussion
May 19, 2023 · 2 min read · Problem Link to the LeetCode Problem: https://leetcode.com/problems/two-sum/. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly ...
Join discussionApr 14, 2023 · 4 min read · I can't solve the partner problem for you, we can at least code the approximation, can't we? The Two Sum question is one that has been known to trip up many a programmer, and yet it is deceptively simple. The Premise The question asks you to find two...
Join discussion