Queue is a simple and widely used data structure that operates on a first in first out principle. Sometimes you can hear them being referred to as FIFO (first in first out) queues. In this article we’ll implement a queue with doubly linked list in swift. A linked list is… Read more »
Binary search trees are one of the most fundamental data structures in computer science. They are very efficient when inserting and searching for elements. And if you’re preparing for a technical interview it’s more than likely that you’ll be asked about them. In this article we’ll go over the theory… Read more »
You’ve probably heard of graphs in computer science, and you might even be dreading them a bit. After all, graphing algorithms are one of the favourite questions on technical interviews. In this article we’ll implement the edge-weighted digraph in swift. This is an essential structure that we’ll use later on… Read more »
You might have heard that some of the swift native types are being converted from classes to structures. In this article, we’ll explore structures and classes, we’ll talk about values, references, stacks and heaps. Hopefully, by the end of it, you’ll understand the differences between them. Reference Types and Value… Read more »
In computer science there are many data structures. In this post we will examine one such structure called a ‘Stack’. We’ll implement it using another data structure called a ‘Linked List’, and for the sake of comparison, we will implement the same stack data structure using plain old arrays, and… Read more »
