Search for a command to run...
Series
Data Structure & Algorithms : the most important and fundamental of any programmer. We will explore famous questions on datastructure & algorithms from various popular websites.
Question Link : https://leetcode.com/problems/simplify-path/ After reading the question , the first intution is for using stack as appropriate data structure There are two possiblities either you do interate character by character or split the str...
Question Link : https://leetcode.com/problems/binary-tree-right-side-view/ It is pretty simple explanation if you visualize the tree .If we do level order traversal and keep each level node values in a list (keeping from left to right) the last val...
Let's discuss problem no 235 at leetcode i.e 235. Lowest Common Ancestor of a Binary Search Tree. Problem Link: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ Here we are supposed to find the lowest common ancestor in ...
Let's discuss today the problem 378. Kth Smallest Element in a Sorted Matrix at leetcode. Problem link https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/ The example in question has following Input: matrix = [ [1,5,9] [10,11,13] ...
To solve the question you can visit the following link https://leetcode.com/problems/remove-stones-to-minimize-the-total/ Explanation The question is asking us to do one operation at a time, the operation is simply to reduce the number of piles to ...
Problem Statement The problem asks us to find three numbers in an array whose sum is closest to a given target value. Example Input: nums = [-1, 2, 1, -4], **target = 1 **Expected Output**:2` Approach We can solve the problem using the Two Pointer T...
