Hope this helps some people :-) I've always wanted a cheat sheet that I could print out or save as a reference. A quick scan before interview day will be sure to help you feel more confident.
This is well-written, and a good survey of basic data structures. It would be more useful if you included more advanced data structures, as well. Do you have any plans to add more? For instance, the first thing I looked for was self balancing binary search trees.
Side note: I've never heard it expressed as FILO before. Or at least I've never noticed it. It's always been LIFO. :)
Comments
Hope this helps some people :-) I've always wanted a cheat sheet that I could print out or save as a reference. A quick scan before interview day will be sure to help you feel more confident.
This is well-written, and a good survey of basic data structures. It would be more useful if you included more advanced data structures, as well. Do you have any plans to add more? For instance, the first thing I looked for was self balancing binary search trees.
Side note: I've never heard it expressed as FILO before. Or at least I've never noticed it. It's always been LIFO. :)
Thanks! There's definitely plans to include more. For now, a lot of additional material can be found at https://algodaily.com/curriculum :-)
Sweet little reference sheet; thanks for sharing!