Welcome to Code with K5KC!

Dive into the ultimate destination for all things coding interviews and beyond. Our channel is dedicated to providing high-quality, comprehensive tutorials and insights that will help you ace your coding interview and excel in your tech career.

Learn from basic to advance coding skills and become a better programmer:

- Datastructure and Algorithms
- System Design
- Programming Languages like Java, Python, and more

And Much More: Stay tuned for a variety of content that will take your coding skills to the next level.

Whether you're prepping for an upcoming interview or looking to broaden your programming knowledge, Code with K5KC is here to support you every step of the way. Subscribe and join our community of learners and future tech leaders! πŸš€


Word Break - Leetcode 139 | Using Dynamic Programming
16:57
Word Break - Leetcode 139 | Using Dynamic Programming
Longest Increasing Subsequence - Leetcode 300 | Using Binary Search
9:33
Longest Increasing Subsequence - Leetcode 300 | Using Binary Search
Longest Increasing Subsequence - Leetcode 300 | Using Dynamic Programming
18:54
Longest Increasing Subsequence - Leetcode 300 | Using Dynamic Programming
Coin Change - Leetcode 322 | Using Dynamic Programming
17:58
Coin Change - Leetcode 322 | Using Dynamic Programming
Decode Ways - Leetcode 91 | From Naive to Dynamic Programming
19:28
Decode Ways - Leetcode 91 | From Naive to Dynamic Programming
Unique Paths in Grid - Leetcode 62 | 5 Approaches including DP and Combinatorics
15:07
Unique Paths in Grid - Leetcode 62 | 5 Approaches including DP and Combinatorics
Jump Game - Leetcode 55 | Using DP and Greedy Approach
14:12
Jump Game - Leetcode 55 | Using DP and Greedy Approach
Combination Sum 1 - Leetcode 39 | Using Backtracking
11:39
Combination Sum 1 - Leetcode 39 | Using Backtracking
Climbing Stairs - Leetcode 70 | Using Dynamic Programming
16:44
Climbing Stairs - Leetcode 70 | Using Dynamic Programming
Fibonacci Number - Leetcode 509 | Using Dynamic Programming
15:48
Fibonacci Number - Leetcode 509 | Using Dynamic Programming
Sum of Two Integers - Leetcode 371 | Bit manipulation
8:19
Sum of Two Integers - Leetcode 371 | Bit manipulation
Counting Bits - Leetcode 338 | From Naive to Optimal Using Dynamic Programming and Bit patterns
14:41
Counting Bits - Leetcode 338 | From Naive to Optimal Using Dynamic Programming and Bit patterns
Missing Number - Leetcode 268 | Intuitive 7 Methods
14:50
Missing Number - Leetcode 268 | Intuitive 7 Methods
Reverse Bits - Leetcode 190 | Bitwise manipulation
10:40
Reverse Bits - Leetcode 190 | Bitwise manipulation
Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm
13:18
Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm
Find Minimum in Rotated Sorted Array - Leetcode 153 | Using Binary Search
9:12
Find Minimum in Rotated Sorted Array - Leetcode 153 | Using Binary Search
Search in Rotated Sorted Array - Leetcode 33 | Using Binary Search
10:52
Search in Rotated Sorted Array - Leetcode 33 | Using Binary Search
Binary Search - Leetcode 704
11:05
Binary Search - Leetcode 704
Three Sum - Leetcode 15 - Java
15:02
Three Sum - Leetcode 15 - Java
Two Sum II - Leetcode 167 | 3 Approaches (Naive, Binary Search, Two Pointers)
7:51
Two Sum II - Leetcode 167 | 3 Approaches (Naive, Binary Search, Two Pointers)
Two Sum - Leetcode 1 | 4 Approaches: Brute Force, Sorting + Binary Search/Two Pointers and Hashmap
11:38
Two Sum - Leetcode 1 | 4 Approaches: Brute Force, Sorting + Binary Search/Two Pointers and Hashmap
Container With Most Water - Leetcode 11 | Two Pointer Approach
10:40
Container With Most Water - Leetcode 11 | Two Pointer Approach
Best Time To Buy And Sell Stock - Leetcode 121
6:34
Best Time To Buy And Sell Stock - Leetcode 121
Product of Array Except Self - Leetcode 238 | 4 Methods from Naive to Optimal
15:22
Product of Array Except Self - Leetcode 238 | 4 Methods from Naive to Optimal
Valid Anagram - Leetcode 242 | 4 Methods
14:06
Valid Anagram - Leetcode 242 | 4 Methods
Apply Operations to an Array - Leetcode 2460 | 3 Methods including 2 Pointer Technique
10:51
Apply Operations to an Array - Leetcode 2460 | 3 Methods including 2 Pointer Technique
Longest Common Subsequence - Leetcode 1143 | Recursion β†’ Top-Down DP β†’ Bottom-Up DP
16:23
Longest Common Subsequence - Leetcode 1143 | Recursion β†’ Top-Down DP β†’ Bottom-Up DP
Length of Longest Fibonacci Subsequence - Leetcode 873 | Greedy and Dynamic programming
14:57
Length of Longest Fibonacci Subsequence - Leetcode 873 | Greedy and Dynamic programming
Maximum Absolute Sum of Any Subarray - Leetcode 1749 | 5 Ways including Prefix Sum & Kadane's Algo
14:00
Maximum Absolute Sum of Any Subarray - Leetcode 1749 | 5 Ways including Prefix Sum & Kadane's Algo
Number of Sub arrays With Odd Sum
12:28
Number of Sub arrays With Odd Sum