StackRating

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

Matt Timmermans

Rating
1575.70 (3,413th)
Reputation
22,180 (5,955th)
Page: 1 ... 8 9 10 11 12 ... 28
Title Δ
Given O(n) sets, what is complexity of figuring out distinct ones a... +1.38
Which among these is the proper implementation of the Memento desig... +0.38
Maximum number of consecutive 1's in a string 0.00
Bi-Directional Binary Search Trees? +1.64
What's the good of Marker Interface? -0.24
What's the purpose of making the class which instantiates all o... -1.14
Implement the singleton pattern with a twist +1.08
Implementing a variable size ring buffer? +0.39
How to insert values into single linked list +0.38
Optimize for loop with huge lists 0.00
Java: New thread to skip synchronised method if another thread alre... +1.81
Find inside part algorithm for Paper.io game -0.62
Why is it in JavaScript, to implement a hash table, ES6 map is gene... 0.00
Check if set of characters exists in a string or not - Improvement +0.67
Data structure to store objects identified by unique 8digit hexadec... +1.65
Algorithm to transform from an expression to a graph (DAG) represen... 0.00
Reducing Graph Reachability to SAT (CNF) +0.39
Continually updating the median + space efficiency 0.00
How to Identify Each Components from Audio Signal? 0.00
Division algorithm for calculating quotient without keeping track o... +1.71
Give a data structure that you can initialize in O(n) given n key p... 0.00
Using heap for big disk sorts 0.00
Postfix notation is changing precedence of parentheses in evalution -0.30
Real-World Performance of Red-Black vs. 2-3-4 trees, especially con... 0.00
If a function is called more than million times in a second, print... 0.00
What does Liskov Substitution Principle preserve? 0.00
What contains the beachline in Fortune's algorithm? 0.00
What is the proper name given to MySQL's Linear Hash algorithm? 0.00
GCC rotate implementation 0.00
Data Structures for Indexing 0.00
What is the complexity of path compression technique for disjoint s... 0.00
Runtime of singe-source shortest paths in the directed acyclic grap... 0.00
confusion about conversion answer infix to postfix 0.00
Is O(K + (N-K)logK) equivalent to O(K + N log K)? -1.41
Is there a heap or heap-like structure that works with pointers, in... +0.40
Establishing chronology of a list based on a directed graph tree -1.89
Simulating noise with specific time character 0.00
Optimizing the given problem to linear time without worrying about... +1.78
Dining philosophers's problem with test-set instruction -0.39
Idempotent decryption routine/algorithm -2.20
data structure for recombining tree: parents are permutations +0.38
Is there a converter from List<CompletionStage> to Completion... -0.15
What is the motivation behind React's "diffing" Heuri... +1.43
Typical layered architecture - project structure 0.00
How to generate a line with exact number of points? 0.00
Find a Circle ((x,y,r)) that has maximum number of points 'on&#... +0.38
How to write a next method with an Iterator and a MaxHeapPriorityQu... -0.10
DIfference between signed and unsigned practically +1.84
How should I combine completable futures and try/catch in Java? +1.28
How to set 3 consecutive position of array an RGB values in a loop +1.88