- 44
- 917
PropagativeAlgos
เข้าร่วมเมื่อ 9 พ.ค. 2022
Leetcode Problem-Solving Journey: Is Subsequence using Two-pointer Approach in Java
In this video, we solve the Is Subsequence problem (Leetcode #392) using the two-pointer technique. We walk through the problem step-by-step and provide both a detailed code explanation and dry-run walkthrough to make the solution easy to understand. Learn how to determine if one string is a subsequence of another and get ready for coding interviews with this problem-solving approach.
Code Available in the video!
#Leetcode #Java #CodingInterview #ProblemSolving #Subsequence
Code Available in the video!
#Leetcode #Java #CodingInterview #ProblemSolving #Subsequence
มุมมอง: 8
วีดีโอ
Java Stream API Tutorial: Employee Salary Analysis Step-by-Step
มุมมอง 5วันที่ผ่านมา
Learn how to perform advanced Employee Salary Analysis using the Java Stream API! In this tutorial, we cover: 1️⃣ Filtering employees earning more than $50,000. 2️⃣ Sorting employees by salary in descending order. 3️⃣ Finding the highest salary from a list of employees. 4️⃣ Grouping employees by their departments. This hands-on guide is perfect for beginners and intermediate developers looking ...
Leetcode Problem-Solving Journey: Reverse Vowels of a String using Two-Pointer Technique_Java
มุมมอง 7วันที่ผ่านมา
Join us on this Leetcode problem-solving journey as we tackle 'Reverse Vowels of a String' [Problem #345]. Learn how to efficiently reverse vowels in a string using the two-pointer technique. This video includes a step-by-step explanation, Java code implementation, and a detailed dry run to ensure a thorough understanding. Ideal for coding enthusiasts preparing for interviews or brushing up on ...
Java Stream API Full Tutorial for Beginners 🔥 | Step-by-Step Explanation with Real Examples
มุมมอง 6วันที่ผ่านมา
🚀 Master Java Stream API with this beginner-friendly tutorial! In this video, we’ll break down the basics of the Stream API introduced in Java 8 and solve a real-world problem step-by-step. 🌟 What You’ll Learn: 1️⃣ What is the Stream API and why you should use it. 2️⃣ Key methods like filter(), map(), sorted(), and reduce(). 3️⃣ How to write clean, efficient, and modern Java code. 🔥 Highlights:...
![Leetcode Problem-Solving Journey Add Digits with Iterative and O(1) Solution in Java [#258AddDigits]](http://i.ytimg.com/vi/hQLS5BHsUQU/mqdefault.jpg)
Leetcode Problem-Solving Journey Add Digits with Iterative and O(1) Solution in Java [#258AddDigits]
มุมมอง 4วันที่ผ่านมา
Welcome to our Leetcode Problem-Solving Journey! In this video, we tackle the popular 'Add Digits' problem (#258) using two approaches: an iterative solution and a constant-time O(1) formula. Learn step-by-step how to repeatedly add all digits of a number until a single-digit result is achieved. We’ll break down the logic, provide dry-run examples, and compare the approaches to help you master ...
![Leetcode Problem-Solving Journey: Missing Number using Summation Method in Java [#268MissingNumber]](http://i.ytimg.com/vi/LEVkY5IhVYk/mqdefault.jpg)
Leetcode Problem-Solving Journey: Missing Number using Summation Method in Java [#268MissingNumber]
มุมมอง 1021 วันที่ผ่านมา
In this particular video, we have implemented the traditional sum of n natural numbers method. Challenge for you: Can you comment down the solution using XOR gates?
![Leetcode Problem-Solving Journey: Valid Anagram [#242. Valid Anagram]](http://i.ytimg.com/vi/Y9csKUoo1og/mqdefault.jpg)
Leetcode Problem-Solving Journey: Valid Anagram [#242. Valid Anagram]
มุมมอง 928 วันที่ผ่านมา
In this video, we cover 3 approaches to solving the Leetcode problem "Valid Anagram": Sorting, Frequency Count using Array, and the HashMap method. We go through each approach in detail, breaking down how to efficiently compare two strings and check if they are anagrams. A dry run of each approach is also provided to make the solution easier to understand. This is a great video for practicing s...
![Leetcode Problem-Solving Journey: Finding Ransom Note [#383. Ransom Note]](http://i.ytimg.com/vi/-_SHWku4CNM/mqdefault.jpg)
Leetcode Problem-Solving Journey: Finding Ransom Note [#383. Ransom Note]
มุมมอง 228 วันที่ผ่านมา
Solve the "Ransom Note" problem on Leetcode with an efficient approach. Learn how to check if a ransom note can be constructed from a magazine by using each letter from the magazine only once. This solution uses HashMap to track letter counts.
![Leetcode Problem-Solving Journey: Finding Power of Four [#342. Power of Four]](/img/n.gif)
Leetcode Problem-Solving Journey: Finding Power of Four [#342. Power of Four]
มุมมอง 1128 วันที่ผ่านมา
Given an integer n, the task is to determine if it is a power of four. A number is considered a power of four if there exists an integer x such that n 4^x. You can solve this problem using mathematical properties, iterative methods, or logarithmic solutions, focusing on efficiency and optimal performance.
Leetcode Problem-Solving Journey: Power of Three [#326. Power of Three]
มุมมอง 14หลายเดือนก่อน
In this problem, we are given an integer n and need to determine if it is a power of three. A number is considered a power of three if there exists an integer x such that n 3^x. The solution can be approached iteratively, logarithmically, or using mathematical properties for optimized performance.
Leetcode Problem-Solving Journey: Find the extra character in Java [#389. Find the difference]
มุมมอง 61หลายเดือนก่อน
In this problem, you're tasked with finding an additional letter in a shuffled string. The input consists of two strings, s and t. String t is generated by shuffling the characters of string s and appending one additional letter. The goal is to identify and return the extra letter that was added to t.
Leetcode Problem-Solving Journey: Third Maximum Number in Array Using Java
มุมมอง 26หลายเดือนก่อน
In this video, we solve the Leetcode problem "Third Maximum Number" using Java. The task requires us to find the third distinct maximum number in an array, or return the largest number if the third one does not exist. We go through the problem statement step by step and implement the solution efficiently, ensuring no duplicates are considered. Watch as we break down the code and walk through th...
Leetcode Problem-Solving Journey: Add Two Strings in Java
มุมมอง 29หลายเดือนก่อน
Hello everyone! In today's video, we will be solving an interesting Leetcode problem where we need to add two numbers represented as strings. The challenge is to perform this addition without using any built-in libraries (like BigInteger) and without converting the strings to integers directly. In this video, you'll learn: 1️⃣ How to break down the problem step by step. 2️⃣ The logic behind add...
Leetcode Problem-Solving Journey: Reverse String II
มุมมอง 35หลายเดือนก่อน
Unlock the logic behind solving LeetCode's 541: Reverse String II. In this video, we delve into an efficient approach to reverse specific segments of a string based on given constraints. Learn how to handle in-place string manipulations, optimize boundary calculations using the min function, and master this problem with clear dry runs and step-by-step coding explanations. Perfect for beginners ...
Leetcode Problem-Solving Journey: Reverse String
มุมมอง 7หลายเดือนก่อน
In this problem, we are tasked with reversing a given string in-place with constant extra space. The input string is provided as a character array, and the goal is to reverse the string without using additional data structures or extra memory. Approach: The solution uses the "Two Pointer Technique", where two pointers are initialized: one starting at the beginning of the string and the other at...
Leetcode Problem-Solving Journey: Checking if a Number is a Power of Two in Java [231. Power of Two]
มุมมอง 19หลายเดือนก่อน
Leetcode Problem-Solving Journey: Checking if a Number is a Power of Two in Java [231. Power of Two]
Leetcode Problem-Solving Journey: Majority Element in Array Using Boyer-MooreVotingAlgorithm in Java
มุมมอง 13หลายเดือนก่อน
Leetcode Problem-Solving Journey: Majority Element in Array Using Boyer-MooreVotingAlgorithm in Java
Leetcode Problem-Solving Journey: Checking for Palindromes in Java [125.Valid Palindrome]
มุมมอง 42หลายเดือนก่อน
Leetcode Problem-Solving Journey: Checking for Palindromes in Java [125.Valid Palindrome]
Leetcode Problem-Solving Journey: Single Element in Array(No Commentary) [136_SingleNumber ]
มุมมอง 18หลายเดือนก่อน
Leetcode Problem-Solving Journey: Single Element in Array(No Commentary) [136_SingleNumber ]
Leetcode Problem-Solving Journey: TaskSchedulerWithCooldown in Java (No Commentary)
มุมมอง 32หลายเดือนก่อน
Leetcode Problem-Solving Journey: TaskSchedulerWithCooldown in Java (No Commentary)
Leetcode Problem-Solving Journey: ReorganizeStringWithoutAdjacentDuplicates in Java (No Commentary)
มุมมอง 9หลายเดือนก่อน
Leetcode Problem-Solving Journey: ReorganizeStringWithoutAdjacentDuplicates in Java (No Commentary)
Leetcode Problem-Solving Journey: LongestSubstringWithoutRepeatingCharacters in Java (No Commentary)
มุมมอง 17หลายเดือนก่อน
Leetcode Problem-Solving Journey: LongestSubstringWithoutRepeatingCharacters in Java (No Commentary)
Leetcode Problem-Solving Journey: First Non-Repeating Character in Java (No Commentary)
มุมมอง 9หลายเดือนก่อน
Leetcode Problem-Solving Journey: First Non-Repeating Character in Java (No Commentary)
Leetcode Problem-Solving Journey: Summary Ranges in Java (No Commentary)
มุมมอง 19หลายเดือนก่อน
Leetcode Problem-Solving Journey: Summary Ranges in Java (No Commentary)
Leetcode Problem-Solving Journey: Finding Duplicates Within Distance in Java (No Commentary)
มุมมอง 14หลายเดือนก่อน
Leetcode Problem-Solving Journey: Finding Duplicates Within Distance in Java (No Commentary)
Leetcode Problem-Solving Journey: Checking for Duplicates in an Array in Java (No Commentary)
มุมมอง 11หลายเดือนก่อน
Leetcode Problem-Solving Journey: Checking for Duplicates in an Array in Java (No Commentary)
Leetcode Problem-Solving Journey: Checking Isomorphic Strings in Java (No Commentary)
มุมมอง 13หลายเดือนก่อน
Leetcode Problem-Solving Journey: Checking Isomorphic Strings in Java (No Commentary)
Leetcode Problem-Solving Journey: Removing Duplicates from Sorted Array in Java (No Commentary)
มุมมอง 17หลายเดือนก่อน
Leetcode Problem-Solving Journey: Removing Duplicates from Sorted Array in Java (No Commentary)
Leetcode Problem-Solving Journey: Finding Length of Last Word in Java (No Commentary)
มุมมอง 16หลายเดือนก่อน
Leetcode Problem-Solving Journey: Finding Length of Last Word in Java (No Commentary)
Leetcode Problem-Solving Journey: Finding First Occurrence of Substring in Java (No Commentary)
มุมมอง 10หลายเดือนก่อน
Leetcode Problem-Solving Journey: Finding First Occurrence of Substring in Java (No Commentary)
When is the new topic coming ?
Soon!