same problem ,i will try my best to find a solution.

can't even do the hard code part -_-

ok i will try but i dont think i can solve it

get data from website using something like beautifulsoup

i don't understand what am i supposed to do to solve this kata?

wait am i having the same O(n^2) issue when using ints.slice(0,i) in my JS solution?

any hints on how to optimize the code

fun kata , love it

really fun kata i enjoyed it a lot

how can i determine the highest avg before i even start lookin in the array
i solved it with big O of n^2 and it runs out of time

solved it thank u

ints[0:index] is creating a copy of the list on each loop and searches linearly, making your solution O(n²). You need a better data structure with faster lookups.

Mind sharing your code? You can mark it as a spoiler and we can help take a look to see where your approach is eating up time.

i solved this kata in 3 different ways O(n) time complexity but i keep getting time out error

now passing 2079 and still get time out