Skip to content

These are highly optimized solutions for various cs problems, mostly of mid-level complexity

Notifications You must be signed in to change notification settings

akaliutau/cs-problems-revisited

Repository files navigation

About

This is one of my everlasting side projects. I solve CS puzzles to master my algorithmic skills and to reflect about perfect solution for various CS problems. For the last 10 years I have solved in total 2000+ problems. This repository contains about 500 of them, mostly of mid-level complexity

Overview

The package problem contains solutions of some medium-level complexity problems. The main accent is made on optimization and simplicity of solution. All problems are grouped by category (total 39 categories):

array
backtracking
bfs
binarysearch
bitmanipulation
bst
buckets
combinatorics
design
dfs
dividenconquer
dp
game
graph
greedy
hashtable
heap
intervals
linesweep
linkedlist
math
matrix
misc
palindrome
parentheses
pattern
prefix
priority queue
regex
robots
segmenttree
slidingwindow
sort
stack
statistics
string
topologicalsort
tree
trie
twopointers
unionfind

About

These are highly optimized solutions for various cs problems, mostly of mid-level complexity

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages