Support us on Patreon: / geekific
Discord Community: / discord
GitHub Repository: github.com/geekific-official/
Practice is the most important thing to do while preparing for an interview. That's why, in this video, we solve yet another LeetCode problem: Find the Duplicate Number, using both the Negative Marking and Floyd's Cycle Detection or the Tortoise and Hare algorithm.
LeetCode Problems solved in this video:
- leetcode.com/problems/find-th...
Timestamps:
00:00 Introduction
00:07 Defining the Problem
01:26 Negative Marking Solution
02:57 Tortoise and Hare Solution
04:39 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Object-Oriented Programming Fundamentals: • What is Object-Oriente...
- SOLID Principles and Best Practices: • SOLID Design Principle...
- Recursion Made Simple, Recursive Methods: • What is Recursion? | R...
- Use-Case and Sequence Diagrams: • UML Use-Case and Seque...
- Introduction to Dynamic Programming: • What Is Dynamic Progra...
- What is the Two-Pointers Technique and how to use it?: • What is the Two-Pointe...
- Trees Compared and Visualized, BST vs AVL vs RedBlack vs Splay vs Heaps: • Trees Compared and Vis...
- Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: • Generics and Wildcards...
- Two Sum Problem, from Brute Force to Optimal: • Two Sum Problem | From...
- What is a Thread? (Process, Program, Parallelism, Scheduler Explained): • What is a Thread? | Th...
- Domain-Driven Design Made Simple: • Domain-Driven Design M...
#Geekific #NegativeMarking #FloydCycleDetection #CodingInteview #LeetCode #Java #Google #Amazon #Meta #Microsoft #Apple #Netflix