100 Days Challenge Leetcode

Find the Longest Substring Without Repeating Characters: Solution and Algorithm

leetcode question solution

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. For example, given the string “abcabcbb”, the longest substring […]

Find the Longest Substring Without Repeating Characters: Solution and Algorithm Read More »

Leet Code 55. Tackling Jump I , II , III , IV Game | Cpp ,Java ,Python – Day 3

leetcode question solution

Leet Code 55.:In this post, we’ll look at two jump game difficulties offered on Leet Code 55. 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

Leet Code 55. Tackling Jump I , II , III , IV Game | Cpp ,Java ,Python – Day 3 Read More »

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

leetcode question solution

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

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

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

leetcode question 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

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

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

leetcode question solution

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

Leet Code : Trapping Rain Water Solution Java | CPP | JS Read More »

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

leetcode question 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

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

LeetCode 15 : Three (3) Sum

leetcode question solution

LeetCode 15. Pattern: Hey there, coding enthusiasts! Welcome back to another exciting coding session. Today’s problem is a treat—literally! We’re going to solve the “three sum” or “LeetCode .15” Approaches Two-Pointer Approach: 1. Sorting the Array 2. Initialization 3. Handling Edge Case 4. Main Loop Over Array 5. Duplicate Check 6. Two-Pointer Approach 7. Finding

LeetCode 15 : Three (3) Sum Read More »

Leet Code : Longest Palindromic Substring Java | CPP | Java Script | Python Solution

leetcode question solution

Given a string s, return the longest palindromic substring in s. A string is called a palindrome string if the reverse of that string is the same as the original string. Example 1: Input: s = “babad” Output: “bab” Explanation: “aba” is also a valid answer. Example 2: Input: s = “cbbd” Output: “bb” Solution : JavaScript : CPP

Leet Code : Longest Palindromic Substring Java | CPP | Java Script | Python Solution Read More »

Leet Code: Longest Substring Without Repeating Characters Java | JavaScript | CPP | Python Solution

leetcode question solution

Find the length of the longest substring without repeated characters given a string s. Example 1: Input: s = “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. Example 2: Input: s = “bbbbb” Output: 1 Explanation: The answer is “b”, with the length of 1. Example 3: Input: s =

Leet Code: Longest Substring Without Repeating Characters Java | JavaScript | CPP | Python Solution Read More »