leet Code 392. Is Subsequence (easy)

leet Code 392. Is Subsequence (easy)

Is Subsequence Leetcode 392 : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Is Subsequence” problem. Step 1: Problem Overview : The “Is Subsequence” problem, as presented in LeetCode 392, aims to determine if one given string, denoted as ‘s,‘ is a subsequence … Read more

Leet Code 1658. Minimum Operations to Reduce X to Zero (Medium)

Prefix Sum + Hashmap Longest Sub Array Approach

Minimum Operations to Reduce X to Zero (Medium) : Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Minimum Operations to Reduce X to Zero (Medium)” problem. Problem explanation: We were given an array, and we were tasked with reducing the elements present … Read more

Leet Code 835. Image Overlap (Medium)

image overlap leetcode

Image Overlap Leetcode:Initially, this problem provides an engaging opportunity for solving as one would eventually discover its enjoyment factor. Moreover, it holds practical significance in real-world scenarios as well. For instance, by determining the maximal overlapping region between two images and subsequently clipping them accordingly, one can enhance their focus and reduce their size effectively. … Read more

Leet Code 662. maximum width of binary tree (Medium)

maximum width of binary tree

maximum width of binary tree :Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Maximum Width of Binary Tree” problem.   Binary Tree Level Order Traversal Method 1: Level Order Traversal using Queue Algorithm: Note : Level oder Travesal is equivalent to BFS search … Read more

Leet Code 287 Find the Duplicate Number (Medium)

find duplicate no

Find the Duplicate Number : Finding a sneaky duplicate number in an array can be a real brain-teaser, especially when you’re told not to mess with the array or use too much memory. But fear not! We’ve got a clever trick up our sleeves to crack this code conundrum. Understanding the Puzzle:Imagine this: You’re handed … Read more

Leetcode 135 Candy (Hard) Solution

Leet Code 135 candy

Leetcode 135 Candy (Hard) Solution:Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “Candy” problem. Imagine you have a bunch of kids lined up, each with a rating assigned to them. Your task is to distribute candies to these kids following two simple … Read more

Leet Code 2612 Minimum Reverse Operations (Hard)

Leet code 2612 Minimum Reverse Opration

Minimum Reverse Operations : Once upon a time, there was a magical array called “A.” This array had lots of zeros, but it had one special number: the number 1. The number 1 could move around in this array, but it had some rules to follow. Rule 1: The 1 could do a special trick … Read more

Leet code 206 Reverse Linked List (EAZY)

Leet code 206 Reverse Linked List

Reverse Linked List :You can solve this problem in C++, Java, Python, or JavaScript using the following algorithm to reverse a singly linked list: Leet Code : Reverse Nodes in k-Group Java, Python ,C++ JavaScript Solution Imagine you have a chain of beads, and you want to reverse their order. That’s what this code does … Read more

Leet Code 420 Strong Password Checker (HARD)

C++ Solution Code Explanation : Certainly! This C++ code is like a helper for making a strong password from a given text. A strong password is one that’s hard to guess, and it should follow some rules: This code helps you find out how many changes you need to make to a given text to … Read more

Leetcode 1359 Count All Valid Pickup and Delivery Options (HARD)

Leetcode 1359 Count All Valid Pickup and Delivery Options (HARD)

Counting Valid Pickup and Delivery Sequences: A Dynamic Programming Approach 1. Introduction What is the Problem? You are given n orders, each comprising both pickup and delivery services. The task is to count all the valid sequences of these orders, ensuring that the delivery for each order always occurs after its corresponding pickup. To manage … Read more

Find the Longest Substring Without Repeating Characters: Solution and Algorithm

The problem of finding the longest substring without repeating characters is a common problem in computer science and can be found in various coding interviews and competitions. The task is to find the longest substring in a given string that does not contain any repeating characters. Approach 1: Approach 2: Approach 3: For example, given … Read more

Achieving Success as an Android Developer: A Roadmap

Here is a roadmap for becoming an Android developer: 1. Learn the basics of programming: If you are new to programming, it is important to start by learning the basics. This includes concepts such as variables, loops, and data types. You can learn these concepts through online courses or by working through a textbook. 2. … Read more

Amortised Time complexity , and there method to find

What is amortised time complexity and method to calculate? Amortized time complexity is a measure of the efficiency of an algorithm that takes into account the average time taken by the algorithm over a sequence of operations, rather than just the worst-case or best-case time complexity. One method for calculating the amortized time complexity of … Read more

Binary Trees – Data structure – Nilesh blog.tech

What are Binary Trees? A binary tree is a tree data structure in which each node has at most two children. The children are referred to as the left child and the right child.Binary trees are commonly used to implement binary search trees and binary heaps. They have several useful properties, such as the ability … Read more

How to Get a Job at Google: Tips and Strategies for Applying and Interviewing

How to Get a Job at Google If you’re looking for a job at Google, there are a few things you’ll need to do. What is the interview question in the SDE role at Google?.First, head over to their website and register for an account. now move toward each step to How to Get a … Read more

Amazon SDE Interview Experience | Amazon SDE interview question

Experience 1: There are just too many postings out there that describe the normal Amazon SDE beginner drill. But I’ll still tell you about my entire experience.7 Debugging Questions in the First Round I got 7 out of 7 correct. Two Coding Questions in the Second Round I completely solved one, and I’m quite confident … Read more

Tackling Jump I , II , III , IV Game Problems on LeetCode | Cpp ,Java ,Python – Day 3

In this post, we’ll look at two jump game difficulties offered on LeetCode. These are well-known coding tasks that might be difficult to complete in a single attempt.We’ll go over numerous approaches to solving both issues step by step using complexity analysis. So, let’s begin with the first. Day 3 Coding Challenge Problem 1 of … Read more

How to get 5✨ on Leet Code with my Own experience

I am currently a 4th year undergraduate at one of the new SIT. You can connect with me on LinkedIn – https://in.linkedin.com/in/nilesh-raut-8584a81abI started my DSA journey on second Year. and i have 3 ✨ on Leetcode 1st Phase() 2nd Phase() 3rd Phase() Tips UpdateAs some of you were asking for my coding and LinkedIn handles so … Read more

Day 2 : FaceBook Asked interview Quetion :- Add Binary Sum – Java ,Python ,Cpp

If, you are preperaing for FACEBOOK Interview or will prepare. Then according to LeetCode premium it is no.4 most asked Question by Facebook as per now. Nilesh Most important QUOTE… So Ladies n Gentlemen without any further due let’s start,What question saying is, Given two binary strings a and b, return their sum as a binary string. Explanation of Approach: Explanation … Read more

Leet Code : Intersection of Two Linked ListsLeet Code – Java | Python | C++ | Dart | Easy Solution

Find the location where two linked lists intersect. Find the node where the two linked lists cross when there are two of them and the tail of the second list points to a node in the first list. Take into account the linked lists below, where the fourth node of the first list is connected … Read more

How to Prepare for a Google Software Engineer Interview – Nileshblog.Tech

Most engineers dream of working with Google at some point in their life. But preparing for the Google software engineer interview takes dedicated and consistent effort. Do you also want to know what it takes to join Google as a Software Engineer? Do you want to work for your dream company? Read on to know … Read more

Tips To Get Hired at FAANG Companies


how to get job in faang,how to get job in faang 2023,How ,did you get a job at FAANG?
,Which FAANG company is easiest to get into?,How can I join FAANG from India?,How do you get noticed by FAANG?,how to get job in maang,how to get job in maang 2023,How ,did you get a job at maang?
,Which maang company is easiest to get into?,How can I join maang from India?,How do you get noticed by maang?

Leet Code : Trapping Rain Water Solution Java | CPP | JS

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. CPP solution … Read more

Leet Code : Validate Binary Search Tree Java | CPP | Python solution

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: Input: root = [2,1,3] Output: true Solution : Java DFS : Python : CPP : Inorder solution :

Leet Code : Maximum Score from Performing Multiplication Operations Cpp | Java | Python solution

Two integer arrays, nums and multipliers, of sizes n and m, respectively, are provided to you, where n >= m. The arrays are all one-dimensional. You start with a score of zero. You need to carry out precisely m operations. On the ith (1-indexed) action, you will: Choose one integer x from the beginning or … Read more

Leet Code : Three (3) Sum Java | CPP | Python Solution

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + … Read more