- 252
- 65 736
Hack Code
Приєднався 25 лют 2024
Welcome to Hack Code - your gateway to unlocking the secrets of code! 🚀
👨💻 About Me:
Hey! I'm a software engineer 👨💻 with 4 + YOE and wanna help others succeed by sharing the things I've learnt over the years.
🎓 Top Resources:
🔹 Practice DSA: LeetCode, HackerRank, InterviewBit
🔹 Mock Interviews: Pramp , interviewing.io
🔹 Interview Experiences: CareerCup , Glassdoor
🔹 Behavioural Interview Worksheets: added link in bio
🔹 Resume Guide: Student Resume Guide: added link in bio
🔹 Visualize Code: Python Tutor
💡 Why Subscribe?
Join a community that values growth, learning, and collaboration. With real-world experience, I’m here to help you succeed.
👨💻 About Me:
Hey! I'm a software engineer 👨💻 with 4 + YOE and wanna help others succeed by sharing the things I've learnt over the years.
🎓 Top Resources:
🔹 Practice DSA: LeetCode, HackerRank, InterviewBit
🔹 Mock Interviews: Pramp , interviewing.io
🔹 Interview Experiences: CareerCup , Glassdoor
🔹 Behavioural Interview Worksheets: added link in bio
🔹 Resume Guide: Student Resume Guide: added link in bio
🔹 Visualize Code: Python Tutor
💡 Why Subscribe?
Join a community that values growth, learning, and collaboration. With real-world experience, I’m here to help you succeed.
LeetCode 417: Pacific Atlantic Water Flow 🌊 |Matrix & Set-Based Solutions| DSA| Interview Question
🌊 Dive into DFS mastery with this detailed walkthrough of LeetCode 417: Pacific Atlantic Water Flow! This video will guide you through solving the problem step-by-step, using two powerful approaches:
✅ Traditional 2D matrix-based DFS
✅ Space-efficient set-based DFS
In this video, you’ll learn:
🔹 How to represent the Pacific and Atlantic water flow as a graph.
🔹 Leveraging DFS to explore valid paths.
🔹 Using sets to optimize memory and simplify code.
🔹 Breaking down time and space complexities.
📌 Problem Statement:
You’re given a 2D grid representing heights, and you need to determine which cells can flow to both the Pacific and Atlantic Oceans. This problem is ideal for honing your skills in matrix traversal and graph-based algorithms!
💡 Whether you're a beginner or prepping for coding interviews, this tutorial will help you ace this problem. Don’t forget to like, comment, and subscribe for more coding tutorials!
📄 LeetCode Blind 75 DSA Sheet: docs.google.com/spreadsheets/d/1ohxk2Hw3O9ySKvLhxMjy3mOmOxnUWMB8MV4gZELaakM/edit?usp=sharing
🎥 LeetCode Blind 75 Playlist: ua-cam.com/play/PLJjAsZiSomUnMPgsLClYXxeO9VYQGCNuH.html
📸 Instagram: @hackcode.lb
💬 Telegram: t.me/hackcodelb
📲 Follow us on Instagram for regular updates and join our Telegram community for discussions and additional resources. Let’s crack coding interviews together! 💻
Timestamps:
0:00 Welcome!
0:08 Problem Statement
4:01 About Blind75
4:29 Depth First Search (BFS) - Intuition & Algorithm
7:41 Code Explanation - 2D Matrix
12:18 Complexities
12:56 Code Explanation - Set
15:11 Outro
#codinginterviews #leetcode #graphalgorithms #dfs #matrixdfs #pacificatlantic #codingtips #programmingtutorial #hackcode #interviewprep #problemwalkthrough #algorithmexplained #spaceoptimization #graphtraversal #pythoncoding #codingchallenges
[dfs, graph traversal, leetcode 417, pacific atlantic water flow, dfs in matrix, set-based dfs, space-efficient algorithms, python dfs tutorial, coding interview questions, matrix traversal, leetcode tutorial, coding challenges, graph-based problems, dfs problem solving, hack code, algorithm optimization, coding for beginners, interview prep, leetcode solutions]
✅ Traditional 2D matrix-based DFS
✅ Space-efficient set-based DFS
In this video, you’ll learn:
🔹 How to represent the Pacific and Atlantic water flow as a graph.
🔹 Leveraging DFS to explore valid paths.
🔹 Using sets to optimize memory and simplify code.
🔹 Breaking down time and space complexities.
📌 Problem Statement:
You’re given a 2D grid representing heights, and you need to determine which cells can flow to both the Pacific and Atlantic Oceans. This problem is ideal for honing your skills in matrix traversal and graph-based algorithms!
💡 Whether you're a beginner or prepping for coding interviews, this tutorial will help you ace this problem. Don’t forget to like, comment, and subscribe for more coding tutorials!
📄 LeetCode Blind 75 DSA Sheet: docs.google.com/spreadsheets/d/1ohxk2Hw3O9ySKvLhxMjy3mOmOxnUWMB8MV4gZELaakM/edit?usp=sharing
🎥 LeetCode Blind 75 Playlist: ua-cam.com/play/PLJjAsZiSomUnMPgsLClYXxeO9VYQGCNuH.html
📸 Instagram: @hackcode.lb
💬 Telegram: t.me/hackcodelb
📲 Follow us on Instagram for regular updates and join our Telegram community for discussions and additional resources. Let’s crack coding interviews together! 💻
Timestamps:
0:00 Welcome!
0:08 Problem Statement
4:01 About Blind75
4:29 Depth First Search (BFS) - Intuition & Algorithm
7:41 Code Explanation - 2D Matrix
12:18 Complexities
12:56 Code Explanation - Set
15:11 Outro
#codinginterviews #leetcode #graphalgorithms #dfs #matrixdfs #pacificatlantic #codingtips #programmingtutorial #hackcode #interviewprep #problemwalkthrough #algorithmexplained #spaceoptimization #graphtraversal #pythoncoding #codingchallenges
[dfs, graph traversal, leetcode 417, pacific atlantic water flow, dfs in matrix, set-based dfs, space-efficient algorithms, python dfs tutorial, coding interview questions, matrix traversal, leetcode tutorial, coding challenges, graph-based problems, dfs problem solving, hack code, algorithm optimization, coding for beginners, interview prep, leetcode solutions]
Переглядів: 48
Відео
🚀 Master LeetCode 207. Course Schedule | Cycle Detection with DFS Explained Step-by-Step!
Переглядів 5714 днів тому
Struggling with graph problems? 🤔 In this video, we’ll tackle LeetCode 207: Course Schedule, an essential problem for coding interviews! Learn how to detect cycles in a dependency graph using DFS with Cycle Detection. 🎯 Perfect for mastering graph traversal techniques! 📌 What You’ll Learn: 🌟 How to represent course dependencies using an adjacency list. 🔍 How to detect cycles in a graph with a v...
LeetCode 133. Clone Graph Solution 🚀 | DFS & BFS Approaches | Must-Know Graph Problem for Interviews
Переглядів 142Місяць тому
🌟 What is graph cloning, and why is it so important for coding interviews? In this video, we tackle the Clone Graph problem from LeetCode (133) step-by-step. This problem is essential for mastering graph traversal algorithms like DFS and BFS, skills that every programmer needs! Here’s what you’ll learn in this comprehensive guide: 🔹 What is a Connected Undirected Graph? 🔹 DFS Approach: Intuitiv...
Day 2/100: How to Pay Daily with Minimum Gold Bar Cuts? 🪙 Puzzle Solution!
Переглядів 31Місяць тому
🧩 Puzzle Challenge Day 2/100 You have a gold bar and an employee working for 5 days. The challenge? You need to pay them 1/5th of the gold bar every day, but you’re only allowed to make the fewest number of cuts. Can you figure out the best way to do it? 🎯 In this video, you’ll learn: ✨ The ingenious solution to divide the gold bar with only 2 cuts 🛠️ How to manage daily payments using give-and...
🧩 Day 1/100: Pay an employee using a gold rod of 7 units ? Genius Puzzle - Easiest Solution!
Переглядів 79Місяць тому
🧩 Puzzle Challenge Day 1/100 Can you solve this mind-bending question? You have a gold rod of 7 units and need to pay your employee for 7 days. The twist? You’re allowed to make only 2 cuts! How can you manage to pay exactly one unit each day without overpaying or underpaying? 🎯 In this video, you’ll discover: ✨ The clever way to cut the rod into 1, 2, and 4 units 🛠️ How to use give-and-take lo...
LeetCode 139.Word Break - Explained 🚀 | Master Recursion, Dynamic Programming & Optimisation | DSA
Переглядів 160Місяць тому
🔥 Struggling with LeetCode 139: Word Break? This video is your ultimate guide to mastering the problem! Perfect for coding interviews, this problem sharpens your understanding of recursion, dynamic programming, and optimisation techniques. 📌 In this video, you’ll learn: ✅ Brute force solution with recursion and its challenges 🌀 ✅ How to optimize using memoization 🧠 ✅ The dynamic programming app...
LeetCode 91: Decode Ways 💡| Most Repeated Interview Question | 3 Approaches | Recursion & DP Made Ez
Переглядів 213Місяць тому
🚀 LeetCode 91: Decode Ways is a must-know problem for acing coding interviews! In this video, we break down the problem into three clear approaches: 1️⃣ Recursive Solution: Start with the fundamental logic. 2️⃣ Dynamic Programming (Top-Down): Optimize recursion with memoization. 3️⃣ Dynamic Programming (Bottom-Up): Simplify with tabulation for maximum efficiency. 🎯 What you’ll learn in this vid...
LeetCode 377: 🎯 Combination Sum IV Explained: Crack Coding Interviews Like a Pro! 3 Approaches 🚀
Переглядів 116Місяць тому
✨ Welcome to Hack Code! Are you preparing for coding interviews? 🤔 Dive into this video to master Combination Sum IV from LeetCode - a must-know problem for developers! Here’s what we’ll cover: 📌 Problem Explanation: Understand the essentials of Combination Sum IV. 💡 Step-by-Step Intuition: Learn how to approach the problem systematically. 🛠️ 3 Approaches: 🌀 Naive Recursive Solution 📈Top-Down D...
LeetCode 62. Unique Paths | Brute Force to Optimised Solutions | Dynamic Programming |Interview Prep
Переглядів 91Місяць тому
🎯 Want to ace coding interviews? Let’s conquer the Unique Paths problem from LeetCode 62! 🚀 This grid-based problem is a game-changer for mastering Dynamic Programming in interviews. 👨💻 In this video, you’ll learn: ✨ How to approach the problem intuitively 💡 Step-by-step explanation of Bottom-Up Dynamic Programming 📊 Time & space complexities simplified 🧩 How to solve grid traversal problems w...
🚀 LeetCode 55. Jump Game | Recursion, Memoization & Greedy Approach Explained
Переглядів 1392 місяці тому
🚀 LeetCode 55. Jump Game | Recursion, Memoization & Greedy Approach Explained
🔥 Interview Preparation Secrets 🤫: What I Wish I Knew Earlier for Job Success! ✨🚀
Переглядів 792 місяці тому
🔥 Interview Preparation Secrets 🤫: What I Wish I Knew Earlier for Job Success! ✨🚀
LeetCode 213. House Robber II 🏠💰 | 4 Approaches to Crack Circular Arrays| Easiest Explanations|DSA
Переглядів 1202 місяці тому
LeetCode 213. House Robber II 🏠💰 | 4 Approaches to Crack Circular Arrays| Easiest Explanations|DSA
🔒 LeetCode 198: House Robber - 4 Approaches Explained | Naive to Optimised | Recursion to DP 🚀
Переглядів 1522 місяці тому
🔒 LeetCode 198: House Robber - 4 Approaches Explained | Naive to Optimised | Recursion to DP 🚀
🤑 How to access PAID Udemy Courses for FREE with Certificates in 2024 | 4 Proven Ways | FREE Of Cost
Переглядів 2,2 тис.2 місяці тому
🤑 How to access PAID Udemy Courses for FREE with Certificates in 2024 | 4 Proven Ways | FREE Of Cost
🚀 LeetCode 1143. Longest Common Subsequence | Brute Force, Top-Down & Bottom-Up DP Approaches | DSA
Переглядів 962 місяці тому
🚀 LeetCode 1143. Longest Common Subsequence | Brute Force, Top-Down & Bottom-Up DP Approaches | DSA
LeetCode 300. Longest Increasing Subsequence | Brute Force, Dynamic Programming & Binary Search 🚀
Переглядів 802 місяці тому
LeetCode 300. Longest Increasing Subsequence | Brute Force, Dynamic Programming & Binary Search 🚀
LeetCode 322. Coin Change 💰 | BruteForce to Dynamic Programming Approaches Explained with Basics! 🚀
Переглядів 862 місяці тому
LeetCode 322. Coin Change 💰 | BruteForce to Dynamic Programming Approaches Explained with Basics! 🚀
LeetCode 79. Word Search | Explained Step-by-Step with DFS Backtracking | Solve Like a Pro 🧩
Переглядів 1912 місяці тому
LeetCode 79. Word Search | Explained Step-by-Step with DFS Backtracking | Solve Like a Pro 🧩
LeetCode 48: Rotate Image | Brute Force & In-Place Rotation Explained | Mastering Matrix Rotation 🔄
Переглядів 923 місяці тому
LeetCode 48: Rotate Image | Brute Force & In-Place Rotation Explained | Mastering Matrix Rotation 🔄
🚀 LeetCode 253: Meeting Rooms || | Brute Force to Optimized Solutions | Two Pointers | Min Heap| DSA
Переглядів 1333 місяці тому
🚀 LeetCode 253: Meeting Rooms || | Brute Force to Optimized Solutions | Two Pointers | Min Heap| DSA
LeetCode 252: Meeting Rooms | Brute Force & Optimised Approach Explained💡|Python |Beginner Friendly
Переглядів 1013 місяці тому
LeetCode 252: Meeting Rooms | Brute Force & Optimised Approach Explained💡|Python |Beginner Friendly
LeetCode 271: Encode and Decode Strings | String manipulation | Length and Delimiter Encoding (O(N))
Переглядів 713 місяці тому
LeetCode 271: Encode and Decode Strings | String manipulation | Length and Delimiter Encoding (O(N))
🚀 Master LeetCode 647: Palindromic Substrings Explained!(3 Approaches + line-by-line Code Breakdown)
Переглядів 1433 місяці тому
🚀 Master LeetCode 647: Palindromic Substrings Explained!(3 Approaches line-by-line Code Breakdown)
🚀 LeetCode 70: Climbing Stairs| 4 Approaches Explained|Recursion + DP Top-Down + Bottom-Up)| Made Ez
Переглядів 1263 місяці тому
🚀 LeetCode 70: Climbing Stairs| 4 Approaches Explained|Recursion DP Top-Down Bottom-Up)| Made Ez
Unlock Your Career: How to Secure Internships & Job Referrals in 2024!
Переглядів 593 місяці тому
Unlock Your Career: How to Secure Internships & Job Referrals in 2024!
🚀 LeetCode 11: Container With Most Water | Brute Force & Two-Pointer Approach Explained!
Переглядів 1083 місяці тому
🚀 LeetCode 11: Container With Most Water | Brute Force & Two-Pointer Approach Explained!
LeetCode 15. 3Sum 🔍 | Optimised Two-Pointer Approach + Brute Force Breakdown | Interview Question
Переглядів 1603 місяці тому
LeetCode 15. 3Sum 🔍 | Optimised Two-Pointer Approach Brute Force Breakdown | Interview Question
LeetCode 33. Search in Rotated Sorted Array | Master Linear Search and Modified Binary Search | DSA
Переглядів 1163 місяці тому
LeetCode 33. Search in Rotated Sorted Array | Master Linear Search and Modified Binary Search | DSA
💥 🚀 LeetCode 152. Maximum Product Subarray|Master Brute Force & Dynamic Programming Techniques|DSA
Переглядів 1913 місяці тому
💥 🚀 LeetCode 152. Maximum Product Subarray|Master Brute Force & Dynamic Programming Techniques|DSA
Linked list and it’s types | Singly Linkedlist | Doubly Linkedlist | Circular Linkedlist | Linear DS
Переглядів 303 місяці тому
Linked list and it’s types | Singly Linkedlist | Doubly Linkedlist | Circular Linkedlist | Linear DS
Great video
🙌🙌
Thanks for sharing such valuable information! A bit off-topic, but I wanted to ask: I have a SafePal wallet with USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). Could you explain how to move them to Binance?
This is helpful
sure, checkout DSA sheet! docs.google.com/spreadsheets/d/1ohxk2Hw3O9ySKvLhxMjy3mOmOxnUWMB8MV4gZELaakM/edit?usp=sharing
Link
can u dm in insta?
Is it for all time
Yes
frequency does not mean sequence ABCABDABEABFABHABKABLAB
Yes, we take a window each time and get the counts and go to next window
Could you please explain what is the length of container? is it the distance between to index of array?
Yes, it’s distance between indexes on X axis, I’ve pinned the better version of this in comments, do checkout 🙌
you cannot get refund if you use a considerable amount in the course,its showing like that
not sure if you have used for extended period of time or if they revised the policies but cheers we have got 3 other ways!
bro its known bro i need specific course how to do that specific its not there in that
If it’s not available in 4 ways then u need to buy it
Yes it's true check it out guys❤
This code is not looking best javascript 😂
Need JS code?
Your explanation is superb
Thank you!
Please I want CEH PRO COURSE ON UDEMY FOR FREE
Dm in Insta
Coding Journey
The Way you Explain is Nice and I clearly Understand Thank you❤
Glad it helped! 🙌
if trial version finished, is this still workable?
Yes, we using free version
Thanks for this
Glad that it helped you!
Coding Journey
Coding Journey
Thank you bro ❤
You're welcome!🙌
I got error Your default credentials not found. What should I set up more?
It’s shown in video, service account path has to be specified
@@HackCodeLb I installed CloudSDK and logged in with my account, and cloned your code and change the ids and credential key link. But it came with error Invalid project ID 'test-bigquery-438817.test-bigquery-438817.test'.
sir, i want java code?
Will upload in GitHub, works?
thank you for providing resources sir
Glad it helped, do share with the ones for whom it might help 🙌📈
A better version with good sound quality can be found here: ua-cam.com/video/39csCc8BogI/v-deo.html
Day1
docs.google.com/spreadsheets/d/1ohxk2Hw3O9ySKvLhxMjy3mOmOxnUWMB8MV4gZELaakM/edit?usp=sharing
Checkout our Blind 75 playlist bro 🙌
Day 1
A better version with good quality can be found here: ua-cam.com/video/dfzHBuebh_A/v-deo.html
Bro you are the gorgeos super talanted you are very skilled i was trying to get the code from last 1month finaly now its working A++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Glad it helped you! Share the channel bro 😎 , let’s grow together🙌
@@HackCodeLb Sure and how can i contact you?
instagram handle @hackcode.lb
A better version with good sound can be found here: ua-cam.com/video/XCl9ubUMfh4/v-deo.html
A better version with good sound can be found here: ua-cam.com/video/Ssfymz7Og4o/v-deo.html
A better version with good sound can be found here: ua-cam.com/video/68h1OWTXRTM/v-deo.html
A better version with good sound can be found here: ua-cam.com/video/asLx9rrM1vw/v-deo.html
Bro do upload videos about DSA you forgot the structures Stack, queue,tree , graph , hash table , array, trie, dp ...etc....
Noted, currently on mission to complete Blind 75 playlist as it will help for interview and revisions.. will continue this playlist very soon 🙌
Love it
Bro your content is good bro
Thank you so much 😀
A better version with good sound can be found here: ua-cam.com/video/SCb0Hccci0M/v-deo.html 5 Easy approaches Explained in above
Here's a better version with good sound: ua-cam.com/video/VMSH7_cFd48/v-deo.html
Same video with better sound is found here: ua-cam.com/video/omMKKsWYImo/v-deo.html
mic a little bit better. Much better than the vids I mentioned elsewhere. Thanks!
Glad to hear it! 🙌
Volume is so low. Fix it please.
Sure, it was for initial set of videos, like some 2-4, apart from that I’ve used mic. Can u pls checkout latest ones n lemme know if its good enough
Will re-upload this by fixing up the volume very soon 🙌
@@HackCodeLb Got it. Thanks!
@@HackCodeLb Will do. Thanks!
uploaded: ua-cam.com/video/QYOIRhZMhD8/v-deo.html
Super bro
Glad it helped you! 🙌
Balkan Graph not free, how can you do?
I’m doing using google sheet apis
@@HackCodeLb do you still use it for your family? JavaScript of Balkan not free, and we can not use after a period of time
@@xteavn current version is free and im using standalone copy of it, so it works
@@HackCodeLb thank you
thanks!!
Glad that it helped you, keep leaning and growing 🙌📈
please make detail video for what to keep and what to not keep in pom file and application properties like datasource url
Sure will make it 🙌
i made the application with big query but while running it shows error of unsatisfied dependency.for the path of credential json while i giving correct path
Could be the case where you haven’t added the dependencies in Pom file, can u dm me error message in Instagram?
@@HackCodeLb it's done..now
Keep it up brother
🙌
cool 😎
Explanation is all over the place
Thanks for sharing the video. very usefull. Also can you please share the sample repo link, so that i can cross compare my code.
github.com/HackCodeLb/spring-boot-bigquery-crud-api
yup today marks the first day i used UA-cam's speed at a lower setting
Bro 😂, it was sped up for a reel and uploaded same here as I felt it would be quick to recap concepts 🙌