You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping:"1" -> 'A'"2" -> 'B'"25"

The algorithm discussed in this thread expand around center approach is a powerful technique that can solve a variety of problems related to pali

Construct Binary Tree from Preorder and Inorder Traversal You are given two integer arrays preorder and inorder.preorder is the preorder tra

A normal linked list:{ this.key this.val this.next } What Is a Doubly Linked List?A doubly linked list is a type of data structure made up of nodes. Each node c

As a writer, I want to track and improve my writing habits so I can achieve my goals effectively and enjoy the process. As a writer, I want to see my basic writ

Linked List:  A sequential data structure where each element (node) points to the next, forming a chain.Array: A collection of elements, usually of the sa

REST is the most common communication standard between computers over internet.What is it? Why is this so popular?Api stands for application programming interfa

In this note, we will develop an intuition on some of the common latency numbers. Which are very crucial for system design.It's not critical to know the exact n

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to&nb

First let's understand why this problem is important to understand?and that we know the technique to solve it.Scenario:You're a codebreaker for the Allied force

Before we solve this problem let's understand why this algorithm i.e longest common subsequence is important?To address Longest Common Subsequence i will use LC

Given an integer array nums, return the length of the longest strictly increasing subsequenceExample 1:Input: nums = [10,9,2,5,3,7,101,18] O

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of mone

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

Sum of Two Integers without Using + or - operatorsBlind 75. BinaryGiven two integers a and b, return the sum of the two integers without usi

Container with Most WaterBlind 75. Array QuestionYou are given an integer array height of length n. There are n vertical lines drawn su

3Sum#Leetcode #blind75 #arrayHintGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k,

#8 Search in Rotated Sorted ArrayBlind 75. ArraySearch in Rotated Sorted ArraySolvedThere is an integer array nums sorted in ascending order (with distinct valu

#6 Maximum Product SubarrayBlind 75. Array.Given an integer array nums, find a subarray that has the largest product, and return the product.The test

#5 Maximum Subarray Blind 75. ArrayImagine you have a lemonade stand and you keep track of your daily profits over a month. Some days you make money, and some d

#4 Product of Array Except SelfBlind 75. Array.Given an integer array nums, return an array answer such that answer[i] is equal to

#3 Contains Duplicate. Blind 75. ArrayGiven an integer array nums, return true if any value appears at least twice in the array, and re

Best Time To Buy and Sell Stock.Blind 75. array questions.You are given an array prices where prices[i] is the price of a given stock on the ith day. You want t