Message from @Vesdii

Discord ID: 610739042501394462


2019-08-13 05:32:15 UTC  

For experience?

2019-08-13 05:44:55 UTC  

<a:PepeLaugh:585580270883700749>

2019-08-13 05:45:16 UTC  

I need to try some of these leetcode puzzles

2019-08-13 07:11:34 UTC  

You can take some of my exams if you want @Vesdii

2019-08-13 07:12:08 UTC  

wot

2019-08-13 07:15:42 UTC  

im doing this rn

2019-08-13 07:15:51 UTC  

and i'm so painfully fucking confused

2019-08-13 07:16:23 UTC  

the "Explanation" for each example explains nothing for me and only confuses me further

2019-08-13 07:22:44 UTC  

wait, fibonnaci numbers are supposed to continue decreasing?

2019-08-13 07:22:57 UTC  

that just seemed off to me so i didnt believe it lol

2019-08-13 07:34:42 UTC  

Oh fibonacci numbers. That's easy. The n-th fib number is the sum of n-1 and n-2 fib numbers.

2019-08-13 07:34:57 UTC  

You can either do this interactively or recursively.

2019-08-13 07:35:39 UTC  

0 1 1 2 3 5 8 13 21....

2019-08-13 07:35:53 UTC  

Thats the fibonacci series

2019-08-13 07:38:02 UTC  

Did that help @Vesdii?

2019-08-13 07:38:27 UTC  

yeah i got that

2019-08-13 07:38:32 UTC  

i just

2019-08-13 07:38:41 UTC  

expected it to be an increasing thing so i was like

2019-08-13 07:38:50 UTC  

is this explanation LYiNg

2019-08-13 07:38:54 UTC  

<:REEEEE:593204316303785989>

2019-08-13 07:39:24 UTC  

It does increase

2019-08-13 07:39:31 UTC  

wot

2019-08-13 07:39:46 UTC  

How are you getting that it decreases?

2019-08-13 07:43:22 UTC  

Here is a previous final exam for my data structures course.
https://hkn.eecs.berkeley.edu/examfiles/cs61b_sp18_f.pdf

2019-08-13 07:43:31 UTC  
2019-08-13 07:43:43 UTC  

oh lord

2019-08-13 07:45:02 UTC  

imagine thinking i might know what a single thing means on this pdf

2019-08-13 07:45:23 UTC  

That's a freshman level course

2019-08-13 07:45:26 UTC  

Here

2019-08-13 07:45:44 UTC  

Lol

2019-08-13 07:45:58 UTC  

Granted its second semester freshman level

2019-08-13 07:46:36 UTC  

I found the class rather easy. Fun. But easy

2019-08-13 07:47:08 UTC  

Lol I could show you an exam from a class i found hard if you like

2019-08-13 07:47:36 UTC  

Complete with N-dimensional hypercubes

2019-08-13 07:48:53 UTC  

There you go

2019-08-13 07:49:27 UTC  

Cs 70. Discrete mathematics, probability and combinatorics

2019-08-13 07:50:02 UTC  

34 pages long exam

2019-08-13 07:50:10 UTC  

lol

2019-08-13 07:52:16 UTC  

Lol welcome to UC berkeley. That is what is expected of you.