A VS Code extension for Competitive Programmers. Features heuristic time complexity analysis (O(N), O(log N)), specific algorithm detection, and a local test runner with Codeforces parsing.
-
Updated
Apr 9, 2026 - TypeScript
#
time-complexity
Here are 6 public repositories matching this topic...
Repository consisting of solved Leetcode problems with proper numbering and descriptions.
-
Updated
Dec 14, 2025 - TypeScript
This is a collection of the LeetCode problems I have solved
typescript algorithms data-structures big-o time-complexity object-oriented-programming space-complexity
-
Updated
Aug 13, 2024 - TypeScript
📝 TypeScript implementation of an algorithm to extract common characters across multiple strings, optimized for performance with O(n*k) time complexity.
performance typescript algorithms leetcode optimization npm-package data-structures string-manipulation educational time-complexity problem-solving hash-table hacktoberfest coding-challenge interview-preparation coding-interview
-
Updated
Nov 15, 2024 - TypeScript
A powerful VS Code extension that analyzes the algorithmic complexity (Big O notation) of your code using a high-performance Rust WASM engine. Get instant insights into your code's performance characteristics with beautiful visualizations and detailed reports.
time-complexity algorithm-analysis complexity-analysis algorithm-complexity space-complexity big-o-notation
-
Updated
Jan 12, 2026 - TypeScript
Provides a quick lookup for the time complexity of built-in data structure methods across multiple programming languages - useful for code reviews, and writing performant code.
-
Updated
May 23, 2026 - TypeScript
Improve this page
Add a description, image, and links to the time-complexity topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the time-complexity topic, visit your repo's landing page and select "manage topics."