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 ... 21 22 23 24 25 ... 32
Title Δ
Example of algorithm which has different worst case upper bound, wo... -2.00
How to find maximum element on left hand side of an element which i... +2.62
Improving complex -0.40
Algorithm to detect and remove least number of inconsistent facts (... +1.74
Summation of product of all pairs of array elements 0.00
Algorithm - How to select one number from each column in an array s... +0.38
Minimum time to assign Holes to Mices 0.00
c# summarise Blocks in a Grid like structure +0.37
Assigning dependency trees to machines 0.00
find min element over multiple intervals in an array in better than... +1.63
Line Circle intersection for Vertical and Horizontal Lines +0.58
Count permutations of N A's and B's -0.65
Reduce set size while preserving minimum frequency +0.38
Sorted Event form transformation puzzle +0.68
Algorithm for removing edges in a connected graph +0.65
Modify this algorithm for Nearest Neighbour Search (NNS) to perform... 0.00
Search in array with high dimensions having specific properties +1.15
find / remove superfluous edges from a polygon +1.63
Formula/Class to find best lineup based on salary cap/points 0.00
search in array with specific properties +1.08
Algorithm for finding polygon vertices for a given set of overlappi... 0.00
How to maintain the precedence of an object inside a priority queue... 0.00
Generate one of many ways of distributing toys among children 0.00
What is the fastest way to match string prefixes for the building o... 0.00
algorithm - Range Query 0.00
Dividing the array in K parts -1.21
Do Yen's modifications of Bellman-Ford algorithm work for DAGs? 0.00
How to find the maximum common subtree 0.00
Longest consecutive sub-sequence with maximal and minimal end points +0.36
Can we use binary search to find most frequently occuring integer i... -0.58
Write code to check if s2 is a rotation of s1 using only one call t... 0.00
Can you explain this test cases of this program of codechef? 0.00
Counting Paths Between 2 Vertices In A Graph 0.00
Is deleting from binary search tree is symmetric? 0.00
Fixed length consecutive sub-sequences with largest minimal element +0.34
How to find all mutually exclusive nearest neighbours between two a... +0.37
Need help count inversions with merge sort +0.40
Insertion and deletion of nodes in Splay Trees 0.00
Optimal way to group time intervals based on projected points +0.38
practical implementation detail of edge labels/splitting in radix t... 0.00
Minimum number of distinct characters to result in a given suffix a... 0.00
Min-Heap to Max-Heap, Comparison +0.37
Neo4J - Traveling Salesman 0.00
What's time complexity of this algorithm for Wildcard Matching? 0.00
Lexicographic minimum permutation such that all adjacent letters ar... -0.70
Number of ways to make change for amount N 0.00
Solve assignment probIem without cost matrix? 0.00
Why is igraph's cliques() method orders of magnitude slower tha... +1.89
Dynamic threshold determination in array of dynamic numerical values 0.00
Using extended euclidean algorithm to find number of intersections... -0.17