#algorithms
Read more stories on Hashnode
Articles with this tag
Link to Problem and LeetCode's Solution. Intuition We have to find number of extra brackets that would be required. if (() -> at last 1 bracket would...
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping...
find a max sum of subarray of size k{3 here}. Example : 1) arr[] : {3,2,4,5,2,1,1,1,1,3,3} , sum = 5, k = 2: output : [4,5] = 9 class Sliding{ int...
(hard) ยท Although it's a leetcode hard question, if you have learned the basic pseudocode of MergeSort, then it is very easy for you. Problem Statement:...
