Golang Data Structures - Build Your Own Cache ! #lru-cache #go-cache #cachewithgolang #go-dsa

Golang Data Structures - Build Your Own Cache !

In this video, we will use data structures with golang to build our own efficient cache which is a least recently used cache implementation.
To implement the cache, we will use a linked list to build a queue and a hashmap.

▬ Contents of this video ▬▬▬▬▬▬▬▬▬▬
0:00 - intro
0:45 - demo
1:46 - project briefing
8:30 - back to drawboard

#golangproject #datastructures #go-dsa #dsawithgo #go-cache

[SatishkumarDhule]

Can you please reduce background music

[alekseiap]

Thanks Akhil. It would be wonderful if the background music weren't quite so loud.

[shubhammurarka]

Case 1: if already exists
-> place at front
Case2: if doesn't exists
->cache filled
-> remove element at tail and add new element at front
-> cache not filled
-> add element at front

[vamsikorubelli]

My humble request for akhil is to reduce background music.

[awallaustin]

Thanks for the video, great content and great step-by-step instruction. I think I understand the point of the hash, in this case it's merely there to check for the presence of an item in the cache at the time of item creation. Is that right? It's just not immediately obvious to me at first pass, and i'm used to hashing functions where we pass a value or values to create a hash. In this case it seems you just simplified all of that and still represented the concept of a hash here.

[ephraimetuk]

😂😂😂yup..music's loud.. still not stopping me from finishing this

[leoantony]

creating an empty head node and empty left node just complicates things