Name		Name	Last commit message	Last commit date
Latest commit History 346 Commits
.vscode		.vscode
01 knapsack.py		01 knapsack.py
1791. Find Center of Star Graph		1791. Find Center of Star Graph
3sum closest.py		3sum closest.py
3sum smaller.py		3sum smaller.py
3sum.py		3sum.py
4sum II.py		4sum II.py
4sum.py		4sum.py
52. N-Queens II		52. N-Queens II
Intersection of two arrays II.py		Intersection of two arrays II.py
Kth largets element.py		Kth largets element.py
LRU cache.py		LRU cache.py
N-queens.py		N-queens.py
README.md		README.md
String_Anagram		String_Anagram
Two Sum II - Input array is sorted.py		Two Sum II - Input array is sorted.py
add two numbers.py		add two numbers.py
alien dictionary.py		alien dictionary.py
all paths for a sum.py		all paths for a sum.py
all paths root-to-leaf.py		all paths root-to-leaf.py
asteroid collision.py		asteroid collision.py
backspace string compare - stack.py		backspace string compare - stack.py
backspace string compare - two pointers.py		backspace string compare - two pointers.py
balance a binary search tree.py		balance a binary search tree.py
best time to buy and sell stock II.py		best time to buy and sell stock II.py
best time to buy and sell stock.py		best time to buy and sell stock.py
binary search.py		binary search.py
binary tree dfs iterative.py		binary tree dfs iterative.py
binary tree dfs.py		binary tree dfs.py
binary tree level order traversal.py		binary tree level order traversal.py
binary tree path sum.py		binary tree path sum.py
binary tree reverse level order traversal.py		binary tree reverse level order traversal.py
binary tree zigzag traversal.py		binary tree zigzag traversal.py
bitonic array maximum.py		bitonic array maximum.py
ceiling of a number.py		ceiling of a number.py
circular array loop.py		circular array loop.py
climbing stairs.py		climbing stairs.py
compare version numbers.py		compare version numbers.py
conflicting appointments - 2.py		conflicting appointments - 2.py
conflicting appointments.py		conflicting appointments.py
connect all level order siblings.py		connect all level order siblings.py
connect level order sibling.py		connect level order sibling.py
construct binary tree from preorder and inorder traversal.py		construct binary tree from preorder and inorder traversal.py
container with most water.py		container with most water.py
contains duplicate.py		contains duplicate.py
convert sorted array to binary search tree.py		convert sorted array to binary search tree.py
copy list with random pointer.py		copy list with random pointer.py
count and say.py		count and say.py
count complete tree nodes.py		count complete tree nodes.py
count good nodes in binary tree.py		count good nodes in binary tree.py
count paths for sum.py		count paths for sum.py
count rotations.py		count rotations.py
count subsets with given sum.py		count subsets with given sum.py
course schedule.py		course schedule.py
course shedule II or task schedule.py		course shedule II or task schedule.py
cyclic sort.py		cyclic sort.py
cyclically rotate an array by one (GEEKFORGEEKS).py		cyclically rotate an array by one (GEEKFORGEEKS).py
daily tempratures.py		daily tempratures.py
decode string.py		decode string.py
degree of an array.py		degree of an array.py
design hashset.py		design hashset.py
design parking system.py		design parking system.py
doubly linked list.py		doubly linked list.py
duplicatezeros.py		duplicatezeros.py
employee free time.py		employee free time.py
encode and decode tinyurl.py		encode and decode tinyurl.py
encode decode string.py		encode decode string.py
equal subset sum partition.py		equal subset sum partition.py
factorial trailing zeros.py		factorial trailing zeros.py
fibonacci number.py		fibonacci number.py
fibonacci sequence.py		fibonacci sequence.py
find all duplicates.py		find all duplicates.py
find all missing numbers.py		find all missing numbers.py
find all numbers dissappeared in array.py		find all numbers dissappeared in array.py
find duplicates - fast & slow pointer.py		find duplicates - fast & slow pointer.py
find first and last position of the element in sorted array or number range.py		find first and last position of the element in sorted array or number range.py
find k closest elements or numbers.py		find k closest elements or numbers.py
find min and max in sorted array.py		find min and max in sorted array.py
find missing number.py		find missing number.py
find number of bits to change a to b.py		find number of bits to change a to b.py
find peak element.py		find peak element.py
find shortest path-graph bfs.py		find shortest path-graph bfs.py
find shortest path-graph dfs.py		find shortest path-graph dfs.py
find smallest letter greater than target or next letter.py		find smallest letter greater than target or next letter.py
find the corrupt pair.py		find the corrupt pair.py
find the difference.py		find the difference.py
find the first k missing positive numbers.py		find the first k missing positive numbers.py
find the median of a number stream.py		find the median of a number stream.py
find the winner or josephus problem.py		find the winner or josephus problem.py
first bad version.py		first bad version.py
first duplicate.py		first duplicate.py
first missing positive.py		first missing positive.py
first unique character in string.py		first unique character in string.py
fizzbuzz.py		fizzbuzz.py
flatten a multilevel doubly linked list.py		flatten a multilevel doubly linked list.py
flip an image.py		flip an image.py
floor of a number.py		floor of a number.py
frequency stack.py		frequency stack.py
fruits into baskets.py		fruits into baskets.py
generate parenthesis.py		generate parenthesis.py

Repository files navigation

LeetCode

LeetCode solutions

prashantchanne12/Leetcode

Folders and files

Latest commit

History