Skip to content
/ Leetcode Public

My journey through the world of competitive programming and problem-solving.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Kafiling/Leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits
1. Two Sum - Hash Map - O(N).py
1. Two Sum - Hash Map - O(N).py
 
 
121. Best Time to Buy and Sell Stock.py
121. Best Time to Buy and Sell Stock.py
 
 
125. Valid Palindrome - Two Pointer - O(N).py
125. Valid Palindrome - Two Pointer - O(N).py
 
 
1342. Number of Steps to Reduce a Number to Zero.java
1342. Number of Steps to Reduce a Number to Zero.java
 
 
141. Linked List Cycle By Comparison - O(N).py
141. Linked List Cycle By Comparison - O(N).py
 
 
155. Min Stack - Two Stack - All method are O(1).py
155. Min Stack - Two Stack - All method are O(1).py
 
 
1929. Concatenation of Array.py
1929. Concatenation of Array.py
 
 
20. Valid Parentheses.py
20. Valid Parentheses.py
 
 
207. Course Schedule - BFS for cycle in graph - O(V+E).py
207. Course Schedule - BFS for cycle in graph - O(V+E).py
 
 
21. Merge Two Sorted Lists.java - Solve by create totally new LinkedList.java
21. Merge Two Sorted Lists.java - Solve by create totally new LinkedList.java
 
 
217. Contains Duplicate - Hashing - O(N).py
217. Contains Duplicate - Hashing - O(N).py
 
 
226. Invert Binary Tree - BF -O(N).py
226. Invert Binary Tree - BF -O(N).py
 
 
232. Implement Queue using Stacks.py
232. Implement Queue using Stacks.py
 
 
26. Remove Duplicates from Sorted Array.py
26. Remove Duplicates from Sorted Array.py
 
 
278. First Bad Version - O(logN) - Binary Search.py
278. First Bad Version - O(logN) - Binary Search.py
 
 
347. Top K Frequent Elements.py
347. Top K Frequent Elements.py
 
 
383. Ransom Note - O(N+M) .py
383. Ransom Note - O(N+M) .py
 
 
412. Fizz Buzz.java
412. Fizz Buzz.java
 
 
53. Maximum Subarray - Greedy - O(N).py
53. Maximum Subarray - Greedy - O(N).py
 
 
733. Flood Fill Using Dynamic Programming - O(N)
733. Flood Fill Using Dynamic Programming - O(N)
 
 
9. Palindrome Number.py
9. Palindrome Number.py
 
 
Neetcode - Dynamic Array Class.py
Neetcode - Dynamic Array Class.py
 
 
README.md
README.md
 
 

Repository files navigation

LeetCode Solutions

Welcome to my repository of LeetCode solutions! This collection represents my journey through the world of competitive programming and problem-solving.

Motivation

The purpose of this repository is to track my progress, reflect on my learning, and share my approaches with others who might find them helpful. Whether you're preparing for technical interviews or just love solving puzzles, I hope you find these solutions insightful!

Contribution

Feel free to explore, suggest improvements, or contribute your own solutions. Let's learn and grow together!

Happy coding!

About

My journey through the world of competitive programming and problem-solving.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages