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 ... 7 8 9 10 11 ... 32
Title Δ
Constrained Longest Increasing Subsequence +1.60
Divide n people into m groups k times with minimal overlap +1.26
Algorithm for finding the maximum number of points -0.66
Largest Permutation in k steps (R) 0.00
Longest straight line in a convex polygon with fixed slope and cons... -0.00
Algorithm to calculate worst case time complexity? 0.00
Gorillas and Poles meeting point algorithm - Not able to figure out... 0.00
Maximum edge weight from one node A to node B 0.00
How to reverse engineer this equation -0.19
Maximum Product of Three Numbers +1.24
Efficient intersection of two sets -1.08
How does the Fibonacci sequence arise in the solution to the CodeCh... 0.00
N Queen with predefined queen(s) 0.00
O(n*log(n)) Turing Machine with exactly 1 tape for "equal numb... 0.00
Which implementation is best for Prims algorithm , using Set or Pro... -0.69
Two 3D triangles, method to figuring out z-order (graphics) -2.90
Getting nth value of a G-Series (General Fibonnaci Sequence) 0.00
Constructive planarity testing 0.00
Is an adjacent lightest edge in an MST 0.00
IEEE754 single precision - General algorithm for representing the h... 0.00
Integer division using only addition, multiplication, subtraction a... +1.33
Largest simplex in convex hull of points in n dimensions 0.00
How to elegantly and imperatively generate the nth string of an alp... 0.00
Scheduling a 16-team 1v1 competition with 6 different game types 0.00
Find two elements with smallest absolute difference in an interval +0.31
Why isn't there a bucket sort library(or is there?) 0.00
Generating possible sentences from a scrambled list of n-grams (pyt... +0.32
Effective way to list of all k-permutations of n objects, while mee... 0.00
Data structure representing a two-value array with 3 operations +0.30
Bitonic Sort (Calculating complexity) +1.05
Minimum weight cut by product instead of sum in a undirected graph 0.00
Fast algorithm for checking if binary arrays can be rotated to not... +1.25
How to find all the subsets of a collection with duplicates? +0.31
How to remove duplicate letters while preserving the smallest lexic... -0.41
Milstein algorithm when variance of the noise is different from 1 0.00
Set Cover - A Couple Different Versions 0.00
Performance and complexity of force-directed graph layouts? 0.00
Why can't we use binary search in jump search instead of linear... 0.00
Most efficient way to search for unknown patterns in a string? -1.03
D-ary heap: Intuition behind parent(int i) and child(int i) functio... 0.00
How to approximate the sum of number of divisors from 1 to n? +0.33
Find the Nth term of series 0.00
Determining coefficient of x^m term in (x^2 + x + 1)^n is even or odd +0.25
Does optimization of the initial guess make the Babylonian method o... -0.48
Minimum number of edges for a disconnected directed graph to make i... 0.00
How do I eliminate outliers in pricing data? -1.81
Efficient checking of whether a point is inside a large number of t... 0.00
Minimum comparisons to perform finding the max element 0.00
If Y is reducible to X in polynomial time, then how is it true that... -0.69
Construct a binary tree from permutation in n log n time 0.00