Name		Name	Last commit message	Last commit date
Latest commit History 533 Commits
3sum-zero.cpp		3sum-zero.cpp
README.md		README.md
add-binary.cpp		add-binary.cpp
array-partition.cpp		array-partition.cpp
base_conversion.cpp		base_conversion.cpp
bit-reversal.cpp		bit-reversal.cpp
bitset.cpp		bitset.cpp
bounded-blocking-queue.cpp		bounded-blocking-queue.cpp
bst-implementation.cpp		bst-implementation.cpp
bst-inorder-iterator.cpp		bst-inorder-iterator.cpp
bst-k-closest.cpp		bst-k-closest.cpp
bst-kth-smallest.cpp		bst-kth-smallest.cpp
bst-lca.cpp		bst-lca.cpp
bst-ser-deser.cpp		bst-ser-deser.cpp
bst-unique.cpp		bst-unique.cpp
bt-all-paths.cpp		bt-all-paths.cpp
bt-closest-leaf.cpp		bt-closest-leaf.cpp
bt-construct.cpp		bt-construct.cpp
bt-diameter.cpp		bt-diameter.cpp
bt-equality.cpp		bt-equality.cpp
bt-extract-leaves.cpp		bt-extract-leaves.cpp
bt-house-robber3.cpp		bt-house-robber3.cpp
bt-isbst.cpp		bt-isbst.cpp
bt-largest-each-level.cpp		bt-largest-each-level.cpp
bt-lca-parent.cpp		bt-lca-parent.cpp
bt-lca.cpp		bt-lca.cpp
bt-level-order.cpp		bt-level-order.cpp
bt-max-depth.cpp		bt-max-depth.cpp
bt-path-to-sum-variants.cpp		bt-path-to-sum-variants.cpp
bt-pretty-print.cpp		bt-pretty-print.cpp
bt-serialize-deserialize.cpp		bt-serialize-deserialize.cpp
bt-symmetric-tree.cpp		bt-symmetric-tree.cpp
bt-upside-down.cpp		bt-upside-down.cpp
bt-zigzag-level-order.cpp		bt-zigzag-level-order.cpp
can-form-triangle.cpp		can-form-triangle.cpp
can-i-win.cpp		can-i-win.cpp
cartesian-product.cpp		cartesian-product.cpp
celebrity.cpp		celebrity.cpp
circular-queue.cpp		circular-queue.cpp
clone-obj-graph.cpp		clone-obj-graph.cpp
closest-integers-same-weight.cpp		closest-integers-same-weight.cpp
collinear_points.cpp		collinear_points.cpp
columnify.cpp		columnify.cpp
combination-sum-ii.cpp		combination-sum-ii.cpp
combination-sum.cpp		combination-sum.cpp
compact-tree.cpp		compact-tree.cpp
connected-components.cpp		connected-components.cpp
connection-degree.cpp		connection-degree.cpp
count-palindromic-subsequences.cpp		count-palindromic-subsequences.cpp
count-triangles.cpp		count-triangles.cpp
course-schedule-i.cpp		course-schedule-i.cpp
course-schedule-ii.cpp		course-schedule-ii.cpp
division-use-addSubMul.cpp		division-use-addSubMul.cpp
edit-distance.cpp		edit-distance.cpp
ellias-gamma.cpp		ellias-gamma.cpp
enemy-attack.cpp		enemy-attack.cpp
enumerate-primes.cpp		enumerate-primes.cpp
evaluate-rpn-expression.cpp		evaluate-rpn-expression.cpp
excel-sheet-int2str.cpp		excel-sheet-int2str.cpp
exclusive-time-functions.cpp		exclusive-time-functions.cpp
expression-add-operators.cpp		expression-add-operators.cpp
factor-combinations.cpp		factor-combinations.cpp
filter-iterator.cpp		filter-iterator.cpp
find-all-palindromes.cpp		find-all-palindromes.cpp
find-max-score.cpp		find-max-score.cpp
first-bad-version.cpp		first-bad-version.cpp
flatten.cpp		flatten.cpp
flip-game.cpp		flip-game.cpp
flowerbed.cpp		flowerbed.cpp
gcd-without-mulDivMod-ops.cpp		gcd-without-mulDivMod-ops.cpp
graph-color.cpp		graph-color.cpp
group-anagrams.cpp		group-anagrams.cpp
holes-in-text.cpp		holes-in-text.cpp
house-robber.cpp		house-robber.cpp
house-robber2.cpp		house-robber2.cpp
implement-dictionary-wildcard-search.cpp		implement-dictionary-wildcard-search.cpp
implement-hash-table.cpp		implement-hash-table.cpp
inclusive-exclusive-time-function.cpp		inclusive-exclusive-time-function.cpp
insert-delete-ran-O1-ii.cpp		insert-delete-ran-O1-ii.cpp
insert-delete-rand-O1.cpp		insert-delete-rand-O1.cpp
insert-interval.cpp		insert-interval.cpp
integer-to-roman.cpp		integer-to-roman.cpp
intersecting_rectangles.cpp		intersecting_rectangles.cpp
intersection-arrays.cpp		intersection-arrays.cpp
interval-add-getLen.cpp		interval-add-getLen.cpp
islands.cpp		islands.cpp
isomorphic-strings.cpp		isomorphic-strings.cpp
k-smallest-pairs.cpp		k-smallest-pairs.cpp
kth-largest-array.cpp		kth-largest-array.cpp
largest-k-int.cpp		largest-k-int.cpp
linked-list-detect-merged-lists.cpp		linked-list-detect-merged-lists.cpp
linked-list-intersection.cpp		linked-list-intersection.cpp
linked-list-loop-i.cpp		linked-list-loop-i.cpp
linked-list-loop-ii.cpp		linked-list-loop-ii.cpp
linked-list-merge-2-sorted-lists.cpp		linked-list-merge-2-sorted-lists.cpp
linked-list-merge-k-sorted-lists.cpp		linked-list-merge-k-sorted-lists.cpp
linked-list-rotate-k.cpp		linked-list-rotate-k.cpp
linked-list-union-intersection.cpp		linked-list-union-intersection.cpp
locker.cpp		locker.cpp
logger-rate-limiter.cpp		logger-rate-limiter.cpp

Repository files navigation

Practice

This is a repository I maintain for all my coding exercises and any relevant/interesting codes/designs I come across.

TODO:

Time/space complexity analysis: a. Nested list weight c. Merge k lists - all approaches e. Multi dimensional sum
Paint house when houses are arranged in a circle: Reuse same logic, except for the last row. For the last row, find 3 minimum of last-1th row instead of 2 minimum. Why? Coz one might clash with itself, the other might clash with 0th row (which has already been 'painted'). Will this logic work or is there a better one?
Add interval and getTotalLength. Merge in getLength() vs merge in Add. Tradeoffs. RemoveRange and RemoveInterval implementation TBD.
Verify triangles(all variations) and identify O(nlgn) algorithm for listing triangles, if any.
Implement hash table: 1) How to instantiate HashTable class?, 2) Try to implement Remove, 3) Add concurrency.
Remaining questons and design.
Follow-ups for 1) merge stream, 2) largest k integers
Follow-up for phone-words with combos of numbers and words.

unyieldingGlacier/coding-exercises

Folders and files

Latest commit

History