StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

kraskevich

Rating
1572.43 (3,772nd)

Reputation
16,505 (8,431st)

Page: 1 ... 4 5 6 7 8 ... 14

Title	Δ
How to reverse a suffix tree of a string (findind the string it rep...	0.00
Check If there exists a Circle	+0.87
Finding the complement of a DFA structure	0.00
Find mode of a multiset in given time bound (most multiplicity)	+1.97
Sum of product of distinct numbers and their count	0.00
Determine the top 'm' most occurring k-Page-sequence	-0.04
c++ ordered(stable) priority queue	0.00
Maximise the minimum difference	+1.91
Problems Solving Recurrence T(n) = 4T(n/4) + 3log n	0.00
Design the binomial coefficient algorithm using a single dimensiona...	0.00
C++ - Value of local non-initialized variables	+0.76
Efficient way to count subsets with given sum	-0.08
Xor sum of array	0.00
Find kth number in sum array	-0.06
Sum of continous sequences	+0.45
Does using ReadWriteLock inside a synchronized method make sense?	+2.28
Dynamic programming: finding largest triangle	+0.47
MergeSort Using a Non-Recursive Sort Threshold	0.00
Maximum no of trains that k platform can hold	+1.38
naive suffix tree implementation in Java	0.00
Mutex lock/unlock order	+0.43
Find largest square in matrix that can move from one corner to the...	-0.08
JAVA (Android) bitwise operator on strings	+0.45
Having trouble understanding peak finding algorithm differences	-0.41
How to improve the algorithm of the following Code	0.00
Printing subsets of a set with sum equals to k	0.00
Understanding Skiena's algorithm to detect cycles in a graph	-1.65
Determine average of all Node values within a Tree Structure	0.00
Sublinear algorithm to find the maximum contiguous range with eleme...	0.00
Search two dimensional array for adjacent identical objects	0.00
Posix Threads with Mutex	0.00
one Local Olampyad Questions on Informatic in 2011	0.00
The shortest connection algorithm, mind game	0.00
Relax Function on Shortest Path Algorithm	-1.89
Traversal through limited permutation	+0.45
An array A[1 . . 2n + 1] is wiggly if A[1] <= A[2] => A[3] &l...	0.00
Dynamic Programming: Vertex Cover of simple graphs	0.00
algorithm to find the total number of ways to reach the last layer...	0.00
Optimal way to read a book having N chapters in M days	0.00
Non-blocking solution to the dining philosophers	+0.45
Python quick-sort parallel sort slower than sequential	-0.17
Algo to calculate sum of sub-rectangles which allows updates as well	0.00
Find triplets in an array whose sum is some integer X	+0.43
Pattern matching interview Q	+0.80
TreeMap with custom comparator doesn't remove entries	-1.01
ArrayList and java.lang.OutOfMemoryError	-0.52
JVM seems to stop context switching very quickly	+1.76
Copying words from one file to another in cpp	0.00
Amortized Analysis Example on Empty List	-0.05
Given all roots, how do I find the coefficients of a polynomial in...	-0.01