GitHub - 01zulfi/leetcode: LeetCode problems I've solved

What

Need Leetcode.

There might be multiple times I've completed a problem as indicated by multiple files.

How

Usually I try to solve it without keeping time/space complexity in mind. When that's done, I research other solutions and modify mine to get the best time/space complexity.

Name		Name	Last commit message	Last commit date
Latest commit History 32 Commits
add-binary		add-binary
balanced-binary-tree		balanced-binary-tree
best-time-to-buy-and-sell-stock		best-time-to-buy-and-sell-stock
binary-search		binary-search
climbing-stairs		climbing-stairs
contains-duplicate		contains-duplicate
diameter-of-binary-tree		diameter-of-binary-tree
first-bad-version		first-bad-version
flood-fill		flood-fill
group-anagrams		group-anagrams
implement-queue-using-stacks		implement-queue-using-stacks
invert-binary-tree		invert-binary-tree
linked-list-cycle		linked-list-cycle
longest-palindrome		longest-palindrome
lowest-common-ancestor-of-a-binary-search-tree		lowest-common-ancestor-of-a-binary-search-tree
lru-cache		lru-cache
majority-element		majority-element
maximum-depth-of-binary-tree		maximum-depth-of-binary-tree
maximum-subarray		maximum-subarray
merge-two-sorted-lists		merge-two-sorted-lists
middle-of-the-linked-list		middle-of-the-linked-list
ransom-note		ransom-note
reverse-linked-list		reverse-linked-list
two-sum		two-sum
valid-anagram		valid-anagram
valid-palindrome		valid-palindrome
valid-parantheses		valid-parantheses
README.md		README.md

01zulfi/leetcode

Folders and files

Latest commit

History

Repository files navigation

What

How

About

Resources

Stars

Watchers

Forks

Languages