Abhishek Sensei
Abhishek Sensei
  • 136
  • 81 459

āļ§āļĩāļ”āļĩāđ‚āļ­

Leetcode 1790. Check if One String Swap Can Make Strings Equal | DSA | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 6616 āļŠāļąāđˆāļ§āđ‚āļĄāļ‡āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 1790. Check if One String Swap Can Make Strings Equal | DSA | C | Hindi | Abhishek Sensei
Leetcode 1800. Maximum Ascending Subarray Sum | DSA | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 3419 āļŠāļąāđˆāļ§āđ‚āļĄāļ‡āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 1800. Maximum Ascending Subarray Sum | DSA | C | Hindi | Abhishek Sensei
Leetcode 3105. Longest Strictly Increasing or Strictly Decreasing Subarray | C++ | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 1721 āļŠāļąāđˆāļ§āđ‚āļĄāļ‡āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 3105. Longest Strictly Increasing or Strictly Decreasing Subarray | C | Hindi | Abhishek Sensei
Leetcode 3151. Special Array I | DSA | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 47āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructuresandalgorithmsinpython #cpp Leetcode 3151. Special Array I | DSA | C | Hindi | Abhishek Sensei
Only video you need to learn - PPR, SSR, CSR, SSG & ISR in Next.js | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 4614 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#programming #coding #nextjs #webdevelopment Only video you need to learn - PPR, SSR, CSR, SSG & ISR in Next.js | Hindi | Abhishek Sensei The Ultimate Guide to Next.js Rendering Strategies! Whether you’re a beginner or a pro, this video will transform how you build web apps. No more confusion-learn ALL rendering methods with real-world examples and practical demos! ✅ What You’ll Learn: - CSR (C...
Leetcode 1267. Count Servers that Communicate | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 1814 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 1267. Count Servers that Communicate | C | Hindi | Abhishek Sensei
Leetcode 2661. First Completely Painted Row or Column | DSA | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 4821 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 2661. First Completely Painted Row or Column | DSA | C | Hindi | Abhishek Sensei
Leetcode 2017. Grid Game | C++ | DSA | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 3521 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 2017. Grid Game | C | DSA | Hindi | Abhishek Sensei
Leetcode 2425. Bitwise XOR of All Pairings | C++ | DSA | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 2121 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 2425. Bitwise XOR of All Pairings | C | DSA | Hindi | Abhishek Sensei
Leetcode 2429. Minimize XOR | C++ | DSA | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 2228 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 2429. Minimize XOR | C | DSA | Hindi | Abhishek Sensei
Leetcode 2657. Find the Prefix Common Array of Two Arrays | C++ | DSA | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 7428 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpptutorial #cpp Leetcode 2657. Find the Prefix Common Array of Two Arrays | C | DSA | Hindi | Abhishek Sensei
Leetcode 3223. Minimum Length of String After Operations | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 2528 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 3223. Minimum Length of String After Operations | C | Hindi | Abhishek Sensei
Leetcode 2116. Check if a Parentheses String Can Be Valid | C++ | DSA | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 4628 āļ§āļąāļ™āļ—āļĩāđˆāļœāđˆāļēāļ™āļĄāļē
#leetcode #coding #programming #datastructure #cpp Leetcode 2116. Check if a Parentheses String Can Be Valid | C | Hindi | Abhishek Sensei #datastructuresandalgorithms #dsa
Only video you will ever need to understand JavaScript CLOSURES | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 70āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Ever wondered how JavaScript closures work? This video provides a clear and concise explanation of closures, including their underlying mechanisms and practical applications. We'll cover topics like scoping, function scope, and how closures can be used to create private variables. This video is perfect for both beginners and intermediate JavaScript developers. #javascript #closure #coding #prog...
You Won't Believe How Easy It Is to Create High-Quality REACT 19 or NEXT 15 Reusable Components
āļĄāļļāļĄāļĄāļ­āļ‡ 302 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
You Won't Believe How Easy It Is to Create High-Quality REACT 19 or NEXT 15 Reusable Components
The Surprising Truth About Custom Hooks in React 19 and Next 15 Nobody Tells You !!
āļĄāļļāļĄāļĄāļ­āļ‡ 822 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
The Surprising Truth About Custom Hooks in React 19 and Next 15 Nobody Tells You !!
Leetcode 2070. Most Beautiful Item for Each Query | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 693 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2070. Most Beautiful Item for Each Query | C | Hindi | Abhishek Sensei
Leetcode 2601. Prime Subtraction Operation | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 553 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2601. Prime Subtraction Operation | C | Hindi | Abhishek Sensei
Leetcode 2275. Largest Combination With Bitwise AND Greater Than Zero | C++ |Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 213 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2275. Largest Combination With Bitwise AND Greater Than Zero | C |Hindi | Abhishek Sensei
Leetcode 2914. Minimum Number of Changes to Make Binary String Beautiful | C++ | Hindi
āļĄāļļāļĄāļĄāļ­āļ‡ 783 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2914. Minimum Number of Changes to Make Binary String Beautiful | C | Hindi
Leetcode 3163. String Compression III | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 823 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 3163. String Compression III | C | Hindi | Abhishek Sensei
Leetcode 2530. Maximal Score After Applying K Operations | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 573 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2530. Maximal Score After Applying K Operations | C | Hindi | Abhishek Sensei
Leetcode 1963. Minimum Number of Swaps to Make the String Balanced | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 194 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 1963. Minimum Number of Swaps to Make the String Balanced | C | Hindi | Abhishek Sensei
Leetcode 2419. Longest Subarray With Maximum Bitwise AND | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 394 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2419. Longest Subarray With Maximum Bitwise AND | C | Hindi | Abhishek Sensei
Leetcode 1310. XOR Queries of a Subarray | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 674 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 1310. XOR Queries of a Subarray | C | Hindi | Abhishek Sensei
Leetcode 1684. Count the Number of Consistent Strings | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 965 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 1684. Count the Number of Consistent Strings | C | Hindi | Abhishek Sensei
Leetcode 2220. Minimum Bit Flips to Convert Number | C++ | Hindi | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 485 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2220. Minimum Bit Flips to Convert Number | C | Hindi | Abhishek Sensei
Leetcode 2807. Insert Greatest Common Divisors in Linked List | Hindi | C++ | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 365 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2807. Insert Greatest Common Divisors in Linked List | Hindi | C | Abhishek Sensei
Leetcode 2326. Spiral Matrix IV | Hindi | C++ | Abhishek Sensei
āļĄāļļāļĄāļĄāļ­āļ‡ 315 āļŦāļĨāļēāļĒāđ€āļ”āļ·āļ­āļ™āļāđˆāļ­āļ™
Leetcode 2326. Spiral Matrix IV | Hindi | C | Abhishek Sensei