StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

Chris Okasaki

Rating
1542.81 (10,509th) 		Reputation
4,025 (41,666th)
Page: 1
Title Δ
Optimal algorithm to count the no of strings of length `N` a DFA ac... +3.55
Is dynamic programming backtracking with cache +2.30
Dealing with Union-Find algorithms with alot of objects -2.67
Backtracking and recursion to solve a maze 0.00
Is a Trie a K-ary tree? -1.30
What exactly is the queue Abstract Data Type? -0.64
How to detect whether a directed graph is uniquely connected? 0.00
Correct functional implementation on Binomial Heap -0.72
Efficiently finding overlapping intervals from a list of list of in... -4.40
maximum length of a descending path in a tree which always goes lef... +3.54
Disjoint-set forests - why should the rank be increased by one when... -1.41
Do I need to take explicit actions to facilitate sharing with persi... +1.26
Finding a minimal subarray of n integers of sum >= k in linear t... +3.40
Big idea/strategy behind turning while/for loops into recursions? A... +3.23
Implementing an AVL tree using a List +3.62
Duplicate / multiplicate tree efficiently +3.56
Preprocess a constant set of strings for binary searching +3.69
String datastructure supporting append, prepend and search operations +4.17
Functional implementation of Tarjan's Strongly Connected Components... +2.20
Fixed-Point Combinators 0.00
Balanced Binary Search Tree―store data only in leaves -1.29
An ordered dictionary supporting decrease-key? 0.00
Asymptotic Notations and forming Recurrence relations by analysing... +3.85
Find median in O(1) in binary tree -1.79
Moving minheap.top to maxheap.top where maxheap.top <= minheap.top +3.32
What are the drawbacks of writing an algorithm in a class or in an... +5.47
Complex permutation/combination 0.00
Appointment scheduling algorithm (N people with N free-busy slots,... -1.56
Practical applications of confluent persistence +3.94
Is a dynamically sized heap insertion technically O(n)? 0.00
Find if any permutation of a number is within a range -1.94
Quickselect Algorithm - Simplified Explanation 0.00
Finding number of concurrent events given start and end times -1.40
Suitable tree data structure +4.22
Haskell : find smallest nonnegative integer not in list in linear t... -4.08
Scheduling algorithm for a round-robin tournament? 0.00
best way to choose the majority among three +0.50
complexity of turning a sorted array to a 2-4 B tree +4.03
Is a tree with all black nodes a red black tree? +0.35
F# PurelyFunctionalDataStructures WeightBiasedLeftistHeap ex 3.4 +5.80
Efficient mass modification of persistent data structures 0.00
Pairwise priority queue 0.00