StackRating

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

David Eisenstat

Rating
1664.20 (376th) 		Reputation
39,048 (2,876th)
Page: 1 ... 9 10 11 12 13 ... 32
Title Δ
Uniqueness in Permutation and Combination 0.00
How to find a unique set of closest pairs of points? 0.00
Is it possible to select a number from every given intervals withou... 0.00
Arranging array into all possible pairs 0.00
All possible partitions (clusters) of Tree +1.17
Effectively immutable array-backed sequence with linear concatenati... -2.34
Minimum rounds for rebalancing laundry 0.00
How to detect the precise sampling interval from samples stored in... 0.00
Is it possible to find the closest point to all points in subquadra... 0.00
Colouring a tree with two colour 0.00
Smallest cost in weighted directed graph with combinations 0.00
Algorithm to schedule people to an activity that should be done in... +1.15
Is it Polynomial time algorithm 0.00
How to generate all permutations of length M in array +0.30
How to tell if adding an edge to a DAG forms a directed cycle? -0.70
Calculate probability that M out of N events will appear 0.00
Master theorem with f(n)=n!? 0.00
Issue creating better random algorithm - daily spread 0.00
How to solve equation T(n) = 5T(n/5) + sqrt(n), T(1) = 1, T(0) = 0... 0.00
Why factoring big numbers is thought to be impossible +0.05
Theoretical model for IoT timestamp-based algorithm 0.00
Number of substrings in range [l, r] that can be permuted to palind... +1.28
Algorithm to output a subset of set A such that it maximizes the ov... 0.00
How to find asymptotic complexity when the function has a ceil in i... +0.30
What is the best pairing algorithm to use to determine ranking if a... 0.00
Grid Column Touch Determination Algorithm 0.00
Maximal subset sum smaller than a given value 0.00
Algorithm with O(n) time and O(n) space to compare two arrays -0.53
Prove a property of Minimum Spanning Tree +1.57
Non-Linear Recurrence Relation 0.00
maximum y speed to pass through line segments with a given maximum... -0.61
Knapsack or similar with no values and with limits as to which item... 0.00
What kind of algorithm is needed for this 0.00
Encoding of list of sum of 2 dice that has better compression. (byt... 0.00
Smallest sum of triplet products where the middle element is remove... +0.30
Subset sum variation: Get as many subset sums as possible +0.33
Labeling vertex to create minimum cost +1.40
Infinite loop in binary search variant (Java) +0.94
Moving maximum variant +1.42
Google Foobar, maximum unique visits under a resource limit, negati... 0.00
Monte Carlo pi method with fixed x -0.20
Time complexity of program determining if two strings are permutati... +0.31
destroying a binary tree iteratively in java +0.30
Is there a way to do modular exponentiation that requires at most d... 0.00
Knapsack: One constraint, each item can only be selected once, with... 0.00
How to find maximum edge of path for all pairs of vertices of mst 0.00
Fastest way to check if any point from a list is in bwteen two fixe... +1.03
How to get total number of non-repetitive substrings? +0.31
How does this method determine the greatest common divisor? -0.41
Find maximal subset of all non connected elements if Elements swapp... 0.00