0001-1000.md

Problems 0001-1000

Algorithms

• Array
• Backtracking
• Binary Search
• Dynamic Programming
• Greedy
• Hash Table
• Math
• String

Array

#	Title	Solution	Time	Space	Difficulty	Tag	Note
1672	Richest Customer Wealth	C#	$O(n\cdot m)$	$O(1)$	Easy

Backtracking

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0017	Letter Combinations of a Phone Number	C#	$O(4^n)$	$O(4^n)$	Medium

Binary Search

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0704	Binary Search	C#	$O(log(n))$	$O(1)$	Easy
0278	First Bad Version	C#	$O(log(n))$	$O(1)$	Easy

Dynamic Programming

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0053	Maximum Subarray	C#	$O(n)$	$O(1)$	Easy		Kadane's algorithm

Greedy

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0011	Container With Most Water	C#	$O(n)$	$O(1)$	Medium		Two Pointers

Hash Table

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0001	Two Sum	C#	$O(n)$	$O(n)$	Easy
0049	Group Anagrams	C#	$O(n\cdot m\cdot log(m))$	$O(n\cdot m)$	Medium
0217	Contains Duplicate	C#	$O(n)$	$O(n)$	Easy

Math

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0009	Palindrome Number	C#	$O(n)$	$O(1)$	Easy		Two Pointers

String

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0125	Valid Palindrome	C#	$O(n)$	$O(1)$	Easy		Two Pointers
0242	Valid Anagram	C#	$O(n)$	$O(1)$	Easy
0273	Integer to English Words	C#	$O(log(n))$	$O(log(n))$	Hard		Recursion
1903	Largest Odd Number in String	C#	$O(n)$	$O(1)$	Easy