StackRating

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

templatetypedef

Rating
1691.92 (187th)
Reputation
276,765 (139th)
Page: 1 2 3 4 ... 81
Title Δ
Big O Time Complexity of an Algorithm 0.00
Time complexity where one loop repeatedly squares a value and one r... 0.00
Why does Collections.sort not put these strings in the right order? +0.55
What does minimising the loss function mean in k-means clustering? 0.00
Convert recursion to iteration when there are loops in the function 0.00
Big O time complexity of a while loop with a random Object +0.66
Is it possible to compute the intersection of two non completely sp... 0.00
Is the worst case scenario for the time complexity of this quicksor... +0.24
C++ derived class constructor call base class constructor errors 0.00
Why is the cost in a recursion tree shown as an addition? 0.00
Does rand() indeed produce a random value when the random number ge... +1.18
Calling std::move without move constructor or move assignment 0.00
Time Complexity Question about Square Roots 0.00
Can two items in a hashmap be in different locations but have the s... 0.00
Sorting set elements while respecting numbers? 0.00
Number of nodes at depth d in binomial tree -0.69
Biggest forest (Amazon interview question) +0.60
What is the purpose of a priority queue when heaps exist? +0.48
Solving Towers of Hanoi with the disks placed arbitrarily? 0.00
Reducing the time complexity of stair-step question (Amazon intervi... 0.00
Mapping a string or numerical to a NxM binary matrix +0.27
Maximum product cutting algorithm -0.27
How can Monotonic array problem be solved in Complexity O(n)? +0.70
Deque in which all pushes/pops (front/back) and get_min() are O(1)... 0.00
How many elements need to be in a hash table to force an 11-way col... 0.00
Why are braces not mandatory (as shown below)? -2.19
Asymptotic complexity of log(n) * log(log(n)) 0.00
Are hash sets worse in space complexity if there are a lot of input... +0.25
How to solve T(n) = 2*T(n/2) + n*log(n) using recursive tree? +0.87
How does LR parsing select a qualifying grammar production (to cons... 0.00
Adding a non-empty string to a vector using push_back, the vector c... -1.52
What's the point of the colors in red/black trees? 0.00
Why do you use -> to access struct member variables even if you... +0.23
What is the best rational approximation to pi using a 64-bit numera... 0.00
Why do we have double hashing function as [(hash1(key) + i * hash2(... +1.72
Master theorem for worst case quicksort 0.00
What's the difference between typedef enum and enum class? 0.00
Can I compare array[i] to 'letter' -1.50
Concern about space complexity of quick sort 0.00
What differentiates syntax analysis and semantic analysis? +1.31
Probability of hash collision 0.00
What is the difference between O(n + k log n) and O(n log n) -0.76
In Big-O terms if O(n-1) is the same thing as O(n) then why in the... 0.00
Implementation of the consolidate method of fibonacci heap in java,... 0.00
Which Graph Algorithms prefer adjacency matrix and why? 0.00
Finding all possible simple path in an undirected graph is NP hard/... -0.26
Pisano Period length finding +0.24
Which type of files can be compressed with Huffman coding? 0.00
Where is the address to the first element of an array stored? +1.20
Should it be possible to add to an iterator of an empty deque in C++? +0.95