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 2 3 4 ... 28
Title Δ
O(m+n) algorithm to check if a directed graph is unilaterally conne... +0.40
Calculating the Time and Space Complexity of Maximum sum of two ele... 0.00
Depth First Search recursive calls cause StackOverflow error -0.11
Transform frame-based to time-based movement -0.33
Number of unique elements only using equality comparisons 0.00
Asymptotic lower bounding does not work. Why? +1.08
Add Z dimension to 2D Homogeneous Transform Matrix 0.00
AWS API Gateway gives 'More than one client certificate passed&... 0.00
Locks and synchronized in java +1.63
Find set of points on the grid which are at the maximal Manhattan d... 0.00
How do I rearrange an integer so that it is rearranged as its highe... -0.55
Create a potential function for an abstract queue data structure to... 0.00
Space complexity of this monotonic algorithm? -1.27
Infix to Postfix short trick +0.39
Does the following algorithm for rounding given number to next mult... -1.48
How can I logically invert a stack by a method that works in O(1)? -0.12
Interface segregation principle for a framework interface with opti... 0.00
Function for calculating variance of aspect ratio of rectangles +1.68
Why is it possible in Kotlin to read from contrvariant list -2.04
Why it doesn't work? Simple multithreading example +1.84
Drawing a star on a sphere 0.00
A linked list program using one class 0.00
How to solve following bitwise xor problem in O(n) 0.00
Why are Linked Lists Reversed? +0.90
Time limit exceeded on test 10 code forces +1.90
Best Way to create Adjacency List in java? 0.00
Calculating a camera position to have all objects in view with a fi... -0.13
What is the time complexity of Dijkstra's alogrithm using an ad... 0.00
Number of nodes at depth d in binomial tree +0.69
Efficiently transform float and double values into bytes that prese... 0.00
How can it be solved using Dijkstra’s algorithm? -0.56
Constant time to access array element while storing items of multip... -1.53
3D Maze solving with BFS. How to get a full shortest path to the en... 0.00
What is the time complexity of kruskal's algorithm for an adjac... 0.00
Greedy algorithm - Criteria for a coin system to be canonical -2.21
calculator expression evaluator - prefix vs postfix notation? 0.00
Plotting a discrete-time signal shows amplitude modulation 0.00
Expected runtime of hashing with chaining, but with each list in so... 0.00
Calculating TSS on streaming data +0.31
Number of N-digit numbers that are divisible by given two numbers 0.00
Initializing an Array in the Context of Studying Data Structures +1.47
Maximum subarray sum with same starting and end element 0.00
Convert a two colored tree into a bipartite tree 0.00
Could you implement async-await by memcopying stack frames rather t... +0.38
C# implementation of Levenshtein algorithm for substring matching 0.00
Is there a way to reduce complexity when modelling interactions bet... 0.00
Is it possible to devise a O(n log n) sorting algorithm using these... +0.32
Maximize The Cut Segments 0.00
What is the minimum number of adjacent swaps needed to segregate a... -0.45
Why does MeasureString insist extra height is required for text? 0.00