feat: P2 TypeScript migrations — set, recursion, bigO, heap#257
Merged
Conversation
…cript - 02-bigOnotation: add 01-big-o-intro.ts and 03-exercises.ts - 07-set: add set.ts with typed MySet class - 09-recursion: add 02-factorial.ts and 04-fibonacci.ts - 10-tree: add compare.ts and comparator.ts (dependency for heap) - 11-heap: add heap.ts (generic Heap<T>), 01-min-heap.ts, 02-max-heap.ts
- 10-tree: binary-search-tree, avl-tree, red-black-tree, fenwick-tree, segment-tree + demo files (01-bst through 06-red-black) - 13-graph: graph, bfs, dfs, dijkstra, floyd-warshall, kruskal, prim + demo files (01-airline-system through 07-using-kruskal)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Migrates 4 JS-only folders to TypeScript (implementations kept identical — types only added).
Changes
02-bigOnotation/01-big-o-intro.ts,03-exercises.ts07-set/set.ts— typedMySetclass09-recursion/02-factorial.ts,04-fibonacci.ts10-tree/compare.ts,comparator.ts(dep for heap)11-heap/heap.ts(genericHeap<T>),01-min-heap.ts,02-max-heap.tsVerification
npx tsc --noEmit→ 0 errorsnpm test→ 120/120 tests pass