Code With K5KC

computer science

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! 🚀


Spiral Matrix II - Leetcode 59 | Using 4 boundaries

Spiral Matrix II - Leetcode 59 | Using 4 boundaries
Spiral Matrix - Leetcode 54 | Check the boundary conditions

Spiral Matrix - Leetcode 54 | Check the boundary conditions
Reorder List - Leetcode 143 | Using two pointers

Reorder List - Leetcode 143 | Using two pointers
Middle of the linked list - Leetcode 876 | From 2 Pass to 1 Pass using 2 Pointers

Middle of the linked list - Leetcode 876 | From 2 Pass to 1 Pass using 2 Pointers
Merge K Sorted Lists - Leetcode 23 | Naive, Merge sort and Minheap

Merge K Sorted Lists - Leetcode 23 | Naive, Merge sort and Minheap
Remove Nth Node From End of List - Leetcode 19 | Using 2 pointers

Remove Nth Node From End of List - Leetcode 19 | Using 2 pointers
Reverse Linked List - Leetcode 206 | Iterative & Recursive Approaches

Reverse Linked List - Leetcode 206 | Iterative & Recursive Approaches
House Robber II - Leetcode 213 | Using Dynamic Programming solution from House Robber 1

House Robber II - Leetcode 213 | Using Dynamic Programming solution from House Robber 1
House Robber - Leetcode 198 | From Naive to space efficient DP

House Robber - Leetcode 198 | From Naive to space efficient DP
Word Break - Leetcode 139 | Using Dynamic Programming

Word Break - Leetcode 139 | Using Dynamic Programming
Longest Increasing Subsequence - Leetcode 300 | Using Binary Search

Longest Increasing Subsequence - Leetcode 300 | Using Binary Search
Longest Increasing Subsequence - Leetcode 300 | Using Dynamic Programming

Longest Increasing Subsequence - Leetcode 300 | Using Dynamic Programming
Coin Change - Leetcode 322 | Using Dynamic Programming

Coin Change - Leetcode 322 | Using Dynamic Programming
Decode Ways - Leetcode 91 | From Naive to Dynamic Programming

Decode Ways - Leetcode 91 | From Naive to Dynamic Programming
Unique Paths in Grid - Leetcode 62 | 5 Approaches including DP and Combinatorics

Unique Paths in Grid - Leetcode 62 | 5 Approaches including DP and Combinatorics
Jump Game - Leetcode 55 | Using DP and Greedy Approach

Jump Game - Leetcode 55 | Using DP and Greedy Approach
Combination Sum 1 - Leetcode 39 | Using Backtracking

Combination Sum 1 - Leetcode 39 | Using Backtracking
Climbing Stairs - Leetcode 70 | Using Dynamic Programming

Climbing Stairs - Leetcode 70 | Using Dynamic Programming
Fibonacci Number - Leetcode 509 | Using Dynamic Programming

Fibonacci Number - Leetcode 509 | Using Dynamic Programming
Sum of Two Integers - Leetcode 371 | Bit manipulation

Sum of Two Integers - Leetcode 371 | Bit manipulation
Counting Bits - Leetcode 338 | From Naive to Optimal Using Dynamic Programming and Bit patterns

Counting Bits - Leetcode 338 | From Naive to Optimal Using Dynamic Programming and Bit patterns
Missing Number - Leetcode 268 | Intuitive 7 Methods

Missing Number - Leetcode 268 | Intuitive 7 Methods
Reverse Bits - Leetcode 190 | Bitwise manipulation

Reverse Bits - Leetcode 190 | Bitwise manipulation
Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm

Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm
Find Minimum in Rotated Sorted Array - Leetcode 153 | Using Binary Search

Find Minimum in Rotated Sorted Array - Leetcode 153 | Using Binary Search
Search in Rotated Sorted Array - Leetcode 33 | Using Binary Search

Search in Rotated Sorted Array - Leetcode 33 | Using Binary Search
Binary Search - Leetcode 704

Binary Search - Leetcode 704
Three Sum - Leetcode 15 - Java

Three Sum - Leetcode 15 - Java
Two Sum II - Leetcode 167 | 3 Approaches (Naive, Binary Search, Two Pointers)

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

Two Sum - Leetcode 1 | 4 Approaches: Brute Force, Sorting + Binary Search/Two Pointers and Hashmap