killingMeSwiftly

Character Count Algorithm Solution Two

Recently I was asked to solve an algorithm:

In Swift, write a that counts the total number of characters of every number between two numbers (inclusive) spelled out, with whitespace, hyphens and “and” omitted. For example, “525” to…

General Question —

What have I done to expose myself to programming?

In order to answer what I have done to expose myself to programming, I think it’s important to clarify my perception of programming. I view programming and Swift more specifically as a living language(s). In order to…

Reversing a Linked List

I’m currently going through solving common data structure/algorithm questions that iOS developers have encountered and reversing a Linked List is one of them. The first thing we need to do is build the bare bones of a Linked List.

Character Count Algorithm — Solution One

Today we will analyze an algorithm I was asked to solve recently.

Question: Write a that counts the total number of characters of every number between two numbers (inclusive) spelled out, with whitespace, hyphens and “and” omitted…

High-Order Functions

What is a high order function?

A function that takes in a function as an argument, returns a function, or both. Yes, functions can take in other functions, they are closures. A closure is a self-contained block of code that can be passed around. Functions are…

Algorithms — Min and Max

In today’s blog post, let’s go over a recent algorithm problem I solved without any helper/high order functions. I was told to find the minimum and maximum value in an array without the functions min and max.

Linked Lists

A linked list contains ordered items, where each item is a node. There are single linked lists, where each node only has a reference to the next node. Then there is the doubly linked list, where each node references the previous node and the next node. The head node is the first node in your linked list…

Binary Search Tree

Implementing a Binary Search Tree:

Let’s get one thing clear, if you’re going to implement a BST, the underlying assumption is that you have the values that you are trying to sort in the order that you want them to be sorted in. If you call your binary search tree…

Cute QUEUES

I know that y’all have been waiting on this queue for too long. So let’s get right down to the code of the matter. Unlike Stacks, Queues are all about FIFO, think about FIFA, except not really. When you are in a queue you would hope that the first person in line would get served first. With this in mind…