StackRating

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

notbad

Rating
1509.10 (77,347th) 		Reputation
1,652 (99,896th)
Page: 1 2
Title Δ
Is Shortest Hamiltonian path NP-hard? 0.00
Algorithm to traverse several locations finding the shortest route 0.00
Why is the total number of possible substrings of a string n^2? -1.14
Find the maximum K digit number formed by a given number while pres... -2.00
wrong Subset sum in O(n^2) -4.04
How can I find out an induced subgraph of k nodes with at least m*k... 0.00
combinational sum calculation issue 0.00
Algorithm to find indexes of k smallest numbers in an array -1.47
Find the maximum in a string +0.39
How to find all ordered pairs of elements in array of integers whos... +3.25
Give an efficient greedy algorithm that finds an optimal vertex cov... 0.00
1-D Peak Finding Algorithm for Multiple Peaks 0.00
The optimal way to find multiple needle in string +3.87
Check if a vertex in a graph belongs to loop +1.76
Why not hold the last node pointer in LinkedList to reduce insertio... -0.11
Longest path in ordered graph -3.50
relation between maximum types values -3.66
let insert(L,n) insert natural number n into a singly linked list L... -0.27
Complexity in Dijkstras algorithm 0.00
Dynamic Programming Recurrence to Solution 0.00
Shortest path between two vertex in a complete graph 0.00
Largest equal submatrices in bigger matrix +6.28
What if doublehashing function returns 0? 0.00
Design the data structure to query least common multiple of a subma... 0.00
std::sort comparing elements to null -0.29
Maxsub array using divide and conquer 0.00
A variant of the minimum vertex cover 0.00
Solving a Sum of Array Values Exercise in "kn" Instead of... +1.98
Bubble-sorting doubly linked list +1.98
build shortest string from a collection of its subsequence +1.24
find the minimum number of vertices in a directed graph from which... 0.00
Uniform cost search vs depth first search -3.90
Worst case time complexity lists -0.11
Exponentials: Little Oh +0.12
better complexity for reading data (string to integer represntation) -0.09
scanf and strcmp with c string +4.06
Explanation what for(i=0;1;i++) does in C? -1.71
Casting pointer to (void *) lvalue +0.31
Subset-Sum in Linear Time -1.76
C++ Random String Array not working? +1.59
Find the amortized complexity of a Hash function +0.02
Np-Complete VS NP-Hard +2.04
Is it possible to efficiently search a bit-trie for values less tha... +0.73
Finding Max Value Of A[J] +- A[I] -0.20
How to sum up multi-line of output of numbers? +0.76
how can i figure the order of complexity? 0.00
Introduction to Algorithm 3rd edition, Exercise 4.3-6 0.00
How to sort faster than n log n (given a strong condition on the li... -1.98
Max Flow & Min Cut. Did I get it right? -0.01
nth Fibonacci number in dynamic programming -1.56