Комментарии:
Which are the best books for data structure and algorithms
ОтветитьThe caliber of this content is striking. A book I read with akin content became a turning point. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell
Ответить謝謝!
ОтветитьHi, I got a bit of trouble following the Big-O notation part of the lecture. Specifically the examples explaining it. What exactly do I need to know in order to understand it well? Which area of mathematics would I have to understand better in order to follow along better?
ОтветитьHe is high defo on sum next level crack ha shush
ОтветитьHe had spliff and drank the green hash tea thats why he is slow, just another way to reduce his stress and tiredness.
ОтветитьDon't be, Someone whom thinks, da I Know every Science endeavor in the the "World Shithead ".
ОтветитьCan i learn and follow the course if i know only python?
Ответить@freecodecamp, just some useful advice: next time put the lecture slides in the description, not everyone can sit through an 8 hour video.
ОтветитьYou sound like Charlie lol
ОтветитьThnak you
ОтветитьAmazing video
ОтветитьIs this video good for FANG companies interview?
Ответитьdoes this covers all the topics of dsa in details?
or should we prefer some other materials after this to be pro in dsa
Hmmm. I think for a dynamic array, rather than an `add` function we could only use indexers, like how it is in PHP and JavaScript. For example, if the length of the internal array is four then the max index should be 3 but if the user sets a[4] = 9; then we can adjust the internal array.
ОтветитьCharlie?
ОтветитьDoes it also include algorithms ?
ОтветитьRegarding LSBs in Binary Index tree, I suppose you mean the nearest bit to least significant bit that has value = 1 ?
eg for 12 , LSB is 0 and nearest bit place where the value = 1 is 3
Is that correct ?
Fenwick Trees -> Examples on LSP: Rightmost bit is LSP. Not the leftmost.
ОтветитьSorry but his voice is so annoying
ОтветитьJava NOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO!!!
ОтветитьIs it DSA In C?
Ответить17.00
ОтветитьThank You freecodecamp for bringing this amazing course
ОтветитьIs this course enough and if it is enough can someone tell me where to do questions from
ОтветитьMore Suitable and Exceptional, Thambi
Ответитьthis guy sounds like the guy from the movie "The Mask", seriously, great course though
ОтветитьWhich programming language is it?
ОтветитьFor the unify function in the Union Find Code, don't we need to change the id[p]/ id[q] in the if-else statement so that it points directly to the new root?
ОтветитьHow do you turn them to code is what i'm confused right now
Ответитьla ma audaixu hai ta google ma job khana. hahahah
Ответить