Leetcode 921. Minimum Add to Make Parentheses ValidIntuition We have to find number of extra brackets that would be required. if (() -> at last 1 bracket would be added => +1 if ((())A -> at we need (A) =3 min read·abhishek.meOct 10, 2024
LeetCode @70.Climbing StairsYou are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the2 min read·abhishek.meJan 18, 2024
Digital SignaturesWhat are digital Signatures in bitcoin and crypto? Digital signatures are a means for the owner of a coin on the ledger to establish their intent to use that coin in a transaction. Digital signatures work by generating a unique hash of the message an...2 min read·abhishek.meMay 13, 2023
Sliding Window :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 findMax(int arr[], int k, int size){ int i = 0; int j = 0; int sum = 0; ...1 min read·abhishek.meMar 22, 2023