GitHub - yakin-ts/Competitive-programming: A repository dedicated to storing the code solutions for DSA problems I've solved on Leetcode, Codeforces, and HackerRank.

yakin-ts / Competitive-programming Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A repository dedicated to storing the code solutions for DSA problems I've solved on Leetcode, Codeforces, and HackerRank.

leetcode.com/yakin_ts/

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 261 Commits
.cph		.cph
after-camp		after-camp
week1/python-track		week1/python-track
week4		week4
01-matrix.py		01-matrix.py
2-keys-keyboard.py		2-keys-keyboard.py
D_X-Sum.py		D_X-Sum.py
accounts-merge.py		accounts-merge.py
add-two-numbers-ii.py		add-two-numbers-ii.py
add-two-numbers.py		add-two-numbers.py
all-ancestors-of-a-node-in-a-directed-acyclic-graph.py		all-ancestors-of-a-node-in-a-directed-acyclic-graph.py
all-nodes-distance-k-in-binary-tree.py		all-nodes-distance-k-in-binary-tree.py
all-paths-from-source-to-target.py		all-paths-from-source-to-target.py
average-of-levels-in-binary-tree.py		average-of-levels-in-binary-tree.py
basic-calculator-ii.py		basic-calculator-ii.py
best-team-with-no-conflicts.py		best-team-with-no-conflicts.py
best-time-to-buy-and-sell-stock-with-transaction-fee.py		best-time-to-buy-and-sell-stock-with-transaction-fee.py
binary-tree-maximum-path-sum.py		binary-tree-maximum-path-sum.py
champagne-tower.py		champagne-tower.py
cheapest-flights-within-k-stops.py		cheapest-flights-within-k-stops.py
closest-prime-numbers-in-range.py		closest-prime-numbers-in-range.py
combination-sum-iv.py		combination-sum-iv.py
construct-binary-search-tree-from-preorder-traversal.py		construct-binary-search-tree-from-preorder-traversal.py
construct-string-from-binary-tree.py		construct-string-from-binary-tree.py
count-sub-islands.py		count-sub-islands.py
count-unhappy-friends.py		count-unhappy-friends.py
course-schedule-iv.py		course-schedule-iv.py
course-schedule.py		course-schedule.py
d.py		d.py
delete-node-in-a-linked-list.py		delete-node-in-a-linked-list.py
delete-the-middle-node-of-a-linked-list.py		delete-the-middle-node-of-a-linked-list.py
design-add-and-search-words-data-structure.py		design-add-and-search-words-data-structure.py
design-hashmap.py		design-hashmap.py
detonate-the-maximum-bombs.py		detonate-the-maximum-bombs.py
dungeon-game.py		dungeon-game.py
employee-importance.py		employee-importance.py
evaluate-division.py		evaluate-division.py
find-all-people-with-secret.py		find-all-people-with-secret.py
find-eventual-safe-states.py		find-eventual-safe-states.py
find-if-path-exists-in-graph.py		find-if-path-exists-in-graph.py
find-in-mountain-array.py		find-in-mountain-array.py
find-median-from-data-stream.py		find-median-from-data-stream.py
find-the-index-of-the-first-occurrence-in-a-string.py		find-the-index-of-the-first-occurrence-in-a-string.py
flatten-nested-list-iterator.py		flatten-nested-list-iterator.py
flood-fill.py		flood-fill.py
get-maximum-in-generated-array.py		get-maximum-in-generated-array.py
h-index-ii.py		h-index-ii.py
heap-sort.py		heap-sort.py
house-robber-ii.py		house-robber-ii.py
implement-trie-prefix-tree.py		implement-trie-prefix-tree.py
insert-delete-getrandom-o1.py		insert-delete-getrandom-o1.py
insertion-sort-list.py		insertion-sort-list.py
is-graph-bipartite.py		is-graph-bipartite.py
keys-and-rooms.py		keys-and-rooms.py
knight-dialer.py		knight-dialer.py
kth-largest-element-in-an-array.py		kth-largest-element-in-an-array.py
kth-smallest-element-in-a-bst.py		kth-smallest-element-in-a-bst.py
largest-number.py		largest-number.py
last-stone-weight-ii.py		last-stone-weight-ii.py
last-stone-weight.py		last-stone-weight.py
lemonade-change.py		lemonade-change.py
lexicographically-smallest-equivalent-string.py		lexicographically-smallest-equivalent-string.py
linked-list-cycle-ii.py		linked-list-cycle-ii.py
linked-list-cycle.py		linked-list-cycle.py
longest-arithmetic-subsequence-of-given-difference.py		longest-arithmetic-subsequence-of-given-difference.py
longest-palindromic-subsequence.py		longest-palindromic-subsequence.py
longest-word-in-dictionary.py		longest-word-in-dictionary.py
loud-and-rich..ruby		loud-and-rich..ruby
lowest-common-ancestor-of-a-binary-tree.py		lowest-common-ancestor-of-a-binary-tree.py
lru-cache.py		lru-cache.py
map-sum-pairs.py		map-sum-pairs.py
max-area-of-island.py		max-area-of-island.py
maximal-network-rank.py		maximal-network-rank.py
maximalNetworkRank.py		maximalNetworkRank.py
maximum-depth-of-n-ary-tree.py		maximum-depth-of-n-ary-tree.py
maximum-element-after-decreasing-and-rearranging.py		maximum-element-after-decreasing-and-rearranging.py
maximum-product-of-word-lengths.py		maximum-product-of-word-lengths.py
maximum-twin-sum-of-a-linked-list.py		maximum-twin-sum-of-a-linked-list.py
maximum-width-of-binary-tree.py		maximum-width-of-binary-tree.py
middle-of-the-linked-list.py		middle-of-the-linked-list.py
min-cost-climbing-stairs.py		min-cost-climbing-stairs.py
min-cost-to-connect-all-points.py		min-cost-to-connect-all-points.py
min-stack.py		min-stack.py
minesweeper.py		minesweeper.py
minimize-hamming-distance-after-swap-operations.py		minimize-hamming-distance-after-swap-operations.py
minimize-maximum-of-array.py		minimize-maximum-of-array.py
minimum-cost-for-tickets.py		minimum-cost-for-tickets.py
minimum-difference-between-largest-and-smallest-value-in-three-moves.py		minimum-difference-between-largest-and-smallest-value-in-three-moves.py
minimum-falling-path-sum.py		minimum-falling-path-sum.py
minimum-path-sum.py		minimum-path-sum.py
minimum-score-of-a-path-between-two-cities.py		minimum-score-of-a-path-between-two-cities.py
most-stones-removed-with-same-row-or-column.py		most-stones-removed-with-same-row-or-column.py
network-delay-time.py		network-delay-time.py
next-greater-node-in-linked-list.py		next-greater-node-in-linked-list.py
non-decreasing-subsequences.py		non-decreasing-subsequences.py
number-of-matching-subsequences.py		number-of-matching-subsequences.py
number-of-nodes-in-the-sub-tree-with-the-same-label.py		number-of-nodes-in-the-sub-tree-with-the-same-label.py
number-of-pairs-satisfying-inequality.py		number-of-pairs-satisfying-inequality.py
number-of-provinces.py		number-of-provinces.py
number-of-subarrays-with-gcd-equal-to-k.py		number-of-subarrays-with-gcd-equal-to-k.py