StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Nikunj Banka

Rating
1538.74 (12,446th)

Reputation
6,398 (25,343rd)

Page: 1 2

Title	Δ
what definition to generally use for connectedness	+4.04
Sorting and Displaying Entries from an Array in Java	0.00
Detecting Common Elements in an Unsorted Array	-1.72
Can an O(n) algorithm ever exceed O(n^2) in terms of computation ti...	+2.88
Binary Search Trees-Deletion	-0.21
Iterate through a binary search tree	-1.62
UVa-784 Wrong Answer	0.00
Non-recursive implementation of Flood Fill algorithm?	+4.08
Max. number of rotations while inserting a new element into n-eleme...	0.00
Why does decreasekey in Dijkstra's algorithm take O(logN) time?	0.00
Rotation in a Red Black tree	0.00
Understanding Kadane's Algorithm for 2-D Array	0.00
Finding path with maximum minimum capacity in graph	0.00
BIT:Using a binary indexed tree?	0.00
Check if edge is included in SOME MST in linear time (non-distinct...	0.00
Red black tree over avl tree	0.00
Dynamic Programming: top down versus bottom up comparison	0.00
why Dijkstra's algo does not work for negative weight edges	0.00
Mergesort - Is Bottom-Up faster than Top-Down?	0.00
Generic minimum spanning tree	0.00
Find whether a minimum spanning tree contains an edge in linear time?	0.00
Applications of red-black trees	0.00
Finding the path with the maximum minimal weight	0.00
Recursion or Iteration?	0.00