---
title: "Abhishek Kumar Sharma (@abhishekcrj27) | Hashnode"
description: "I do DSA in java and a MERN-stack developer. I am lazy so I create RESTful APIs. Read the latest articles by Abhishek Kumar Sharma on Hashnode."
url: "https://hashnode.com/@abhishekcrj27"
---

@abhishekcrj27

# Abhishek Kumar Sharma

@abhishekcrj27 · West Bengal, India · Joined May 2022

I do DSA in java and a MERN-stack developer. I am lazy so I create RESTful APIs.

### [Leetcode 921. Minimum Add to Make Parentheses Valid](https://abhishek.me/leetcode-921-minimum-add-to-make-parentheses-valid?utm_source=hashnode&utm_medium=feed)

Intuition 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.me](https://abhishek.me/leetcode-921-minimum-add-to-make-parentheses-valid?utm_source=hashnode&utm_medium=feed)

[Oct 10, 2024](https://hashnode.com/posts/leetcode-921-minimum-add-to-make-parentheses-valid/6707931f6239850ae5be1b26)

### [Leetcode @198. House Robber](https://abhishek.me/leetcode-198-house-robber?utm_source=hashnode&utm_medium=feed)

100days of code

2 min read · [abhishek.me](https://abhishek.me/leetcode-198-house-robber?utm_source=hashnode&utm_medium=feed)

[Jan 21, 2024](https://hashnode.com/posts/leetcode-198-house-robber/65ad4c1c22212955e5846f65)

### [LeetCode @70.Climbing Stairs](https://abhishek.me/leetcode-70climbing-stairs?utm_source=hashnode&utm_medium=feed)

You 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 the

2 min read · [abhishek.me](https://abhishek.me/leetcode-70climbing-stairs?utm_source=hashnode&utm_medium=feed)

[Jan 18, 2024](https://hashnode.com/posts/leetcode-70climbing-stairs/65a97ae023328c8014b6a2fe)

### [Digital Signatures](https://abhishek.me/digital-signatures?utm_source=hashnode&utm_medium=feed)

What 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.me](https://abhishek.me/digital-signatures?utm_source=hashnode&utm_medium=feed)

[May 13, 2023](https://hashnode.com/posts/digital-signatures/645f58b0611b99c3b6be7036)

### [Sliding Window :](https://abhishek.me/sliding-window?utm_source=hashnode&utm_medium=feed)

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.me](https://abhishek.me/sliding-window?utm_source=hashnode&utm_medium=feed)

[Mar 22, 2023](https://hashnode.com/posts/sliding-window/641b03c18e270d517501620f)
