Tag: intermediate
All the articles with the tag "intermediate".
-
Kata: Depth-First Search
Implement DFS recursively and iteratively, with applications to path finding and cycle detection.
-
Kata: Merge Sort
Implement merge sort using divide and conquer, with time and space analysis.
-
Kata: Factory Pattern
Implement the factory pattern for creating objects without specifying their concrete classes.
-
Kata: Decorator Pattern
Implement the decorator pattern for adding behavior to objects dynamically.
-
Kata: Graph Representation and Traversal
Build a graph with an adjacency list and implement BFS and DFS traversals.
-
Kata: Build a Hash Map
Implement a hash map with separate chaining, dynamic resizing, and collision handling.
-
Kata: Binary Search Tree
Implement a binary search tree with insert, search, delete, and in-order traversal.