This Repo consists of Data structures and Algorithms

Big-O complexities of common algorithms used in .NET and Computer Science.

🚀 🐍 Optimizes Python bytecode calculating linear recurrences, reducing the time complexity from O(n) to O(log n)

Python for Coding Interviews

Contains the solutions for the programming questions in the CodingNinjas Java+DSA course

I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...

TiML: A Functional Programming Language with Time Complexity

Coding/technical interview guide: data structures, algorithms, complexity analyses, interview questions

Beginner friendly repo for easily contributing algorithms' implementations

bigo time complexity

Benchmark a given function for variable input sizes and find out its time complexity

A comprehensive collection of algorithms and data structure implementations (arrays, graphs, trees, DP, greedy, disjoint set, tries, suffix arrays, bit manipulations, and more) in Python. Organized into topic-based folders and optimized for complexity and performance—perfect for interview prep and contest coding practice.

Solutions for well-known practice dojo problems. Mostly in Haskell because I like challenges!

sorting algorithms in python

Code examples demonstrating the complexity classes O(1), O(log n), O(n), O(n log n), O(n²).

Python time and space complexity documentation

Most developers memorize LeetCode solutions instead of understanding their code. Orthex is a browser extension that injects a real-time AI code reviewer right into their LeetCode workspace, instantly analyzing and visualizing time and space complexity.

LeetCode Solutions Time & Memory Complexity analyzer

TiML: A Functional Programming Language with Time Complexity

A Kotlin project with solutions for common algorithms and with their time and memory complexity. Tests are written in Spock.