StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Eloy Pérez Torres

Rating
1494.04 (4,307,741st)

Reputation
674 (214,566th)

Page: 1

Title	Δ
Coin Change Greedy Algorithm Not Passing Test Case	0.00
What is the fastest method to find all substrings that are containe...	0.00
How can an AVL tree have a complexity of O(log n) when the in-order...	+3.94
What is a greedy algorithm that choses n pairs such that the max ∆...	0.00
How do I print multiple inputs and outputs in C++?	0.00
Count total number paths in tree length wise	0.00
MST in a Graph of Coordinates	0.00
Big O for nested loops	0.00
How do I use other values in a vector in a std::transform?	-2.50
Knight on Chess Board - Shortest Path	0.00
Eliminating NaN Values from an array in C	+4.63
simple way to tell if MST will improve if a specific edge cost is r...	-3.86
Getting multiple rows of inputs without specifying the number of ro...	0.00
O(n^2) calculation assistance needed	-0.67
How to record the path in this critical path algo (Python - Floyd W...	0.00
Will Google Colab keep running cells for saving files in mounted dr...	0.00
Robot in a Grid - how to get all possible paths	0.00
Printing multiples of a number starting from 0 using recursion	0.00
How to compare elements in sublist python?	0.00
Finding a triplet in an array of floating pointer numbers that sum...	0.00
Insert Unique element into trie	0.00
Python - How to calculate this recursive function time complexity?	0.00
What would be the best data structure to search and update integer...	0.00
how to find a name from a phonebook string in O(logn)	0.00
union find set algorithm return parent[v] = find_set(parent[v]); me...	0.00
Read A File in Google Codelab	0.00
Is RBT always full?	-4.86
An algorithm implemented with O(1) time can not be improved faster,...	0.00
How to use "link to cell" in Colab	0.00
Where are datasets downloaded using torchvision?	0.00
BST in-order recursion: Finding the first node that's greater t...	-0.28
How to Convert Adjacency list into binary tree?	+3.93
Time complexity in terms of n if time complexity is O(x*y) where x+...	-3.12
In fractional knapsack implementation my solution is using always t...	0.00
Can anyone spot what is wrong with that code?	0.00
Find the least and most weighted path in a matrix	-4.01
Time complexity on nested for loop	+0.84
Dynamic Programming: Number of Seating Arrangements	0.00
Print all minimum paths between 2 nodes in an undirected weighted g...	0.00
Get highest score in this game: choosing and removing elements in a...	0.00
GIven a tree, for each vertex find longest path to other vertex	0.00
Is there a way to maximize the max flow of a graph by adjusting the...	0.00
The complexity of the following code is O(n) , but if arr [ i ] <...	0.00
Should this be solved by DP instead?	0.00
Calculate Height of a Binary Tree Recursive method	0.00