StackRating

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

Evgeny Kluev

Rating
1587.62 (2,464th) 		Reputation
22,559 (5,810th)
Page: 1 2 3 4 ... 6
Title Δ
Efficient data structure for very long array of characters with ins... +0.42
Construct a circle contains all n-bit binary number +1.29
Variable length array estension using SIMD operation 0.00
Implement circular buffer to write/read arbitrary amount of data in... +0.38
Smallest number that can not be formed from sum of numbers from array -0.77
Determine if some row permutation of a matrix is Toeplitz +1.70
Longest convex subsequence in an array 0.00
Generate equation with the result value closest to the requested on... -0.95
Getting parent of a vertex in a perfect binary tree +1.23
How to efficiently find a contiguous range of used/free slots from... -0.32
Applications of a circular shift -0.58
Majority element - parts of an array +0.82
Find sum of subset with multiplication -1.98
Find the smallest number that does not occur as a subsequence of th... 0.00
Explanation for the "loop rolling algorithm" 0.00
What's the difference between vextracti128 and vextractf128? 0.00
Time complexity on simulation exercise -1.97
Find the dominant cyclic substring of a given string +1.10
Closest pair of points across a line +0.65
How to find pair with kth largest sum? +0.87
What sorting techniques can I use when comparing elements is expens... -0.47
Find a perfect matching or proof that it's impossible +1.13
You are given a set of intervals S. You have to find all intervals... -0.62
Longest equally-spaced subsequence +0.64
How do I sum the four 2-bit bitfields in a single 8-bit byte? -0.24
Find the biggest interval that has all its members in list in O(n) +0.70
Number of Distinct Subarrays +0.78
find minimum bottleneck path in a graph 0.00
Efficient way to iterate a std::list that's changing? +0.77
Minimal number of Increasing Subsequences 0.00
Minimum path cover in DAG 0.00
how to design the one-to-one communication algorithm between proces... 0.00
why is inlined function slower than function pointer? 0.00
Equalizing a circular array 0.00
Find a vertex disjoint path from source to destination -0.66
Copy value into consts for optimization +0.51
Strategy for mass storage of small files +1.58
AVX2 gather instructions - load address calculation +0.39
Dynamic approach to the TSP -0.48
Hotspot in a for loop 0.00
Efficient data-structure for finding smallest substring having all... 0.00
Sort array by pairwise difference -1.57
Does an algorithm exist to find the minimal sum of non-intersecting... 0.00
Bomb dropping algorithm +0.58
Counting total number of points inside 2 circles +2.10
System of nondistinct representatives efficiently solvable? +0.69
Maximum Sum of a non decreasing sub-sequence in an array using fenw... 0.00
Optimal data structure to access items near the highest value? +1.72
Given an input array find all subarrays with given sum K 0.00
Find duplicate element in array in time O(N) -0.99