miku86

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 Problem solving is an important skill, for your career and your life in general.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 I take interesting katas of all levels and explain how to solve them.

Intro 🌐 Today, I start a new series about code katas.

Intro 🌐 Last time, we learned how to get the whole entries (= all key-value pairs) of our Hash Table.

Intro 🌐 Last time, we learned how to get the values from our hash table.

Intro 🌐 Last time, we learned how to get the keys from our hash table.

Intro 🌐 Last time, we learned how to get data from our hash table .

Intro 🌐 Last time, we learned how to add data to our hash table .

Intro 🌐 Last time, we learned how to setup our hash table .

Intro 🌐 Last time, we learned how to handle hash collisions.

Intro 🌐 Last time, we learned what a Hash Function is and how to write a simple one.

Intro 🌐 Last time, we learned what a Hash Table is and why we want to use it.

Intro 🌐 After we finished the small series about the Queue and compared our linear data structures, we start with the Hash Table.

Problem I build an app and use git branches.

Intro Last time, we made a recap of the Queue data structure.

Intro Last time, we added the dequeue method.

Intro Last time, we learned to enqueue a node to the end of the Queue.

Intro Last time, we learned what a Queue is and set it up.

Intro After we finished the small series about the Stack, we start with the Queue.

Intro Last time, we added the last method.

Intro Last time, we learned how to add a new node to the Stack.

Intro Last time, we learned what a Stack is and set it up.

Intro After completing the series about the Doubly Linked List, we start with the Stack.

Intro Last time, we added the last method.

Intro Last time, we learned how to insert a new node at a specific index.

Intro Last time, we learned how to update a specific node.

Intro Last time, we learned how to get a specific node by its index from our Doubly Linked List.

Intro Last time, we learned how to shift / remove data from the beginning of our Doubly Linked List.

Intro Last time, we learned how to unshift / add data to the beginning of our Doubly Linked List.

Intro Last time, we learned how to pop / remove data from end of our Doubly Linked List.

Intro Last time, we learned how to add data to the end of our Doubly Linked List.

Intro Last time, we learned how to setup our Doubly Linked List.