<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Swift Algorithms &amp; Data Structures - Medium]]></title>
        <description><![CDATA[Modern code, Illustrations &amp; Computer science - Medium]]></description>
        <link>https://medium.com/swift-algorithms-data-structures?source=rss----befa206a7c5e---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Swift Algorithms &amp;amp; Data Structures - Medium</title>
            <link>https://medium.com/swift-algorithms-data-structures?source=rss----befa206a7c5e---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 05:30:31 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/swift-algorithms-data-structures" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Top 5 Dynamic Programming Problems for iOS Interviews]]></title>
            <link>https://medium.com/swift-algorithms-data-structures/top-5-dynamic-programming-problems-for-ios-interviews-405d1d5e3d1?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/405d1d5e3d1</guid>
            <category><![CDATA[xcode]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[ios-development]]></category>
            <category><![CDATA[ios]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Wed, 29 Sep 2021 19:23:52 GMT</pubDate>
            <atom:updated>2021-09-29T19:23:52.352Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*5ipY1hFf1aPrBK2f06V9Sw.jpeg" /></figure><p>In its simplest form, <a href="https://www.waynewbishop.com/dynamic-programming-problems">Dynamic programming</a> relies on data storage and reuse to increase algorithm efficiency. Most questions in computer science are solved using various forms of dynamic programming. The trick is recognizing when <a href="https://www.waynewbishop.com/computer-science-interview-questions">optimal solutions</a> can be devised using a simple variable or require the use of a sophisticated data structure or algorithm.</p><h3>Memoization</h3><p>The process of data reuse is also called memoization and can take many forms. As we’ll see, this style of programming provides numerous benefits.</p><p>If you’ve purchased something through Amazon, you’ll be familiar with the site term — <strong>save for later</strong>. As the phrase implies, shoppers can add items to their cart or save them to a wish list for later viewing. When writing algorithms, we often face a similar choice of completing actions (performing computations) as data is being interpreted or storing the results for later use. Examples include retrieving JSON data from a RESTful service or using the Core Data Framework:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/176/1*tbIBh7sCeyM496PF09Ru0g.png" /></figure><p>In iOS, design patterns can help us time and coordinate how data is processed. Specific techniques include multi-threaded operations ( <a href="https://www.waynewbishop.com/article/swift-async-await">structured concurrency</a> ), notifications, and delegation. On the other hand, dynamic programming isn’t necessarily a single coding technique but rather how to think about actions (e.g., subproblems) that occur as a function operates. The resulting DP solution could differ depending on the problem.</p><p>The following are the <strong>top 5 problems</strong> that can be solved using Dynamic programming:</p><ol><li><a href="https://www.waynewbishop.com/computer-science-interview-questions#count_of_occurences">Count of Occurrences</a></li><li><a href="https://www.waynewbishop.com/computer-science-interview-questions#counting_sort_algorithm">Counting Sort Algorithm</a></li><li><a href="https://www.waynewbishop.com/computer-science-interview-questions#fibonacci_revised">Fibonacci Revised</a></li><li><a href="https://www.waynewbishop.com/computer-science-interview-questions#longest_sequence">Longest Subsequence</a></li><li><a href="https://www.waynewbishop.com/computer-science-interview-questions#pair_of_numbers">Pair of Numbers</a></li></ol><p>Other well-known algorithms that also apply dynamic programming include <a href="https://www.waynewbishop.com/ios-interview/cslab">PageRank</a> as well as <a href="https://www.waynewbishop.com/ios-interview/cslab">Dijkstra’s Shortest Path</a>. These two algorithms alone power many of the online tools and processes we use today.</p><h3>Other Study Lists</h3><p>Thanks for checking out my dynamic programming list! If you haven’t already, be sure to also review my other lists as they relate to computer science and Swift / iOS development.</p><ul><li><a href="https://www.waynewbishop.com/swift-interview-questions">Top 100 Swift Interview Questions</a></li><li><a href="https://www.waynewbishop.com/computer-science-interview-questions">Top 20 Computer Science Interview Questions</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=405d1d5e3d1" width="1" height="1" alt=""><hr><p><a href="https://medium.com/swift-algorithms-data-structures/top-5-dynamic-programming-problems-for-ios-interviews-405d1d5e3d1">Top 5 Dynamic Programming Problems for iOS Interviews</a> was originally published in <a href="https://medium.com/swift-algorithms-data-structures">Swift Algorithms &amp; Data Structures</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Understanding Swift’s Async/Await Model with Exception Handling]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/understanding-swifts-async-await-model-with-exception-handling-889da70af0b6?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*2mcM2rtXAf372-fFzmV3wA.jpeg" width="3286"></a></p><p class="medium-feed-snippet">Understanding the syntax of throwing and catching Swift runtime exceptions with the new async / await model.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/understanding-swifts-async-await-model-with-exception-handling-889da70af0b6?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/understanding-swifts-async-await-model-with-exception-handling-889da70af0b6?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/889da70af0b6</guid>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[xcode]]></category>
            <category><![CDATA[ios]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Tue, 27 Jul 2021 18:53:50 GMT</pubDate>
            <atom:updated>2021-07-28T16:11:17.338Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Sequential vs Concurrent Operations with Async / Await in Swift]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/sequential-vs-concurrent-operations-with-async-await-in-swift-221e4ed4e8f6?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*JRYypfftHx0egYzuoRaOVQ.jpeg" width="3835"></a></p><p class="medium-feed-snippet">In this article we review practical examples of concurrent vs sequential operations with async / await in Swift.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/sequential-vs-concurrent-operations-with-async-await-in-swift-221e4ed4e8f6?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/sequential-vs-concurrent-operations-with-async-await-in-swift-221e4ed4e8f6?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/221e4ed4e8f6</guid>
            <category><![CDATA[code]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[ios]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[xcode]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Thu, 15 Jul 2021 18:14:48 GMT</pubDate>
            <atom:updated>2021-07-15T18:14:47.843Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Understanding Structured Concurrency and Swift]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/understanding-structured-concurrency-and-swift-84617de8fc6c?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*3puFEGIcyYnANJzsznmFOw.jpeg" width="4341"></a></p><p class="medium-feed-snippet">The introduction of Swift 5.5 comes a new model for managing asynchronous programming. Many are referring to this new model as async/await.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/understanding-structured-concurrency-and-swift-84617de8fc6c?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/understanding-structured-concurrency-and-swift-84617de8fc6c?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/84617de8fc6c</guid>
            <category><![CDATA[ios]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[code]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Tue, 13 Jul 2021 18:12:22 GMT</pubDate>
            <atom:updated>2021-07-13T18:12:22.355Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[15 Essential iOS Technical Code Challenge Questions (with Hints)]]></title>
            <link>https://medium.com/swift-algorithms-data-structures/15-essential-ios-technical-code-challenge-questions-with-hints-6bddcb9d5d20?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/6bddcb9d5d20</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[code]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[ios]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Sat, 22 May 2021 17:08:20 GMT</pubDate>
            <atom:updated>2024-08-20T22:52:46.292Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*vSD9KTtEeqbKpNILfBkvIw.jpeg" /></figure><p>After helping many iOS developers prepare for <a href="https://bit.ly/2W3DhpR">technical interviews</a> I’ve grown a fun <a href="http://pages.waynewbishop.com/">list of questions</a> I feel exercise a candidate’s breadth of knowledge when it comes to <a href="https://bit.ly/3b3Gmwi">algorithms</a>, data structures, and coding syntax. Feel free to cruise through the list as most of these are my favorites. What’s nice about programming is that there’s rarely a single right way of doing things. Rather it’s all about one proving <strong>their approach</strong> through thoughtful analysis, development experience as well as applying tools like <a href="https://bit.ly/3b3Gmwi">Big-O Notation</a>. Let’s begin!</p><h3>1. Find Common Characters</h3><p>Given an array of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including <strong>duplicates</strong>). For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer:</p><pre><strong>Input:</strong>[&quot;cool&quot;,&quot;lock&quot;,&quot;cook&quot;]<br><strong>Output:</strong>[&quot;c&quot;,&quot;o&quot;]</pre><p><em>Often when solving code challenges, specific words or phrases used provide clues for how best to approach the problem. For this challenge we see the word duplicates highlighted. Can you think of the an algorithm or data structure that addresses the common scenario of duplicates? How could this model be used to help us find common characters?</em></p><h3>2. Sorting Colors</h3><p>Given an array with n objects colored red, white or blue, sort them <strong>in-place</strong> so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively:</p><pre>let <strong>sequence</strong> = [2,0,2,1,1,0] -&gt; [0, 0, 1, 1, 2, 2]</pre><p><em>If not done correctly, sorting data can be one of the most expensive aspects of any program or application. While standard production sorting algorithms run in O(n log n) time, the average / worst case runtimes often produce a O(n) squared result. Is there a more efficient technique or algorithm you could implement to sort the color sequence?</em></p><h3>3. Removing Extra Space</h3><p>Given a proposed String, write an <strong>in-place</strong> algorithm to remove all whitespace. For this challenge, assume you don’t have access to a regular expression engine or SDK library function:</p><pre>let sequence = &quot;The qu ick fox jum ped over the lazy d o g&quot;</pre><p><em>How will your function search through the the data? How will you track the removal of data? Will your solution make use of fast enumeration? Why or why not?</em></p><h3>4. Prefix and Suffix Search</h3><p>In a technical interview, you’ve been asked to design a class <strong>WordFilter</strong> that supports one function, WordFilter.f(String prefix, String suffix). It will return the word with given prefix and suffix. If no word exists, return -1.</p><pre>WordFilter.([&quot;apple&quot;])<br>WordFilter.([&quot;app&quot;])<br>WordFilter.f(&quot;a&quot;, &quot;e&quot;) // returns 0<br>WordFilter.f(&quot;b&quot;, &quot;&quot;) // returns -1</pre><p><em>While most structures are designed to manage generic data, other models are more efficient when managing </em><strong><em>textual</em></strong><em> content. As a result, these specialized solutions are often at the core of search engine requests, dictionaries and many types of games.</em></p><h3>5. Find Common Element in Rows</h3><p>Given a matrix where every row is <strong>sorted</strong> in increasing order, return the <strong>smallest</strong> common element in all rows. If there is no common element return -1.</p><pre>Input: mat = [[1,2,3,4,5,8], [2,4,5,8,10], [3,5,7,8,9,11], [1,3,5,7,8,9]]</pre><pre><strong>Output: 5</strong></pre><p><em>How will you keep track of elements common to all rows? How many elements are common to all rows? How will you find the smallest value? As shown, there are a number of possibilities to track. Could the use of a specialized data structure be used to streamline your solution?</em></p><h3>6. Best Auction Bids</h3><p>In a technical interview, assume you are building a system to track <strong>top</strong> auction bids for your local community fundraiser. As new bids are made, your goal will be to track the number of top bids as they are announced:</p><pre>let <strong>bids</strong> = [2, 1, 9, 4, 8, 6, 10, 5]<br><br>func topBids(bids: [Int]) -&gt; Int {<br>  //code goes here..<br>}</pre><p><em>When organizing data, we sometimes make the assumption correctly sorted data should always be presented in ascending or descending order. However, there are many times when the primary objective is find the </em><strong><em>largest</em></strong><em> or smallest value for a given dataset.</em></p><h3>7. Pair of Numbers</h3><p>In a technical interview, you’ve have been given an array of numbers and you need to find a <strong>pair</strong> of numbers which are equal to the given target value. Numbers can be either positive, negative or both. Can you design an algorithm that works in O(n) — linear time or greater?</p><pre>let <strong>sequence</strong> = [8, 10, 2, 9, 7, 5]<br>let results = <strong>pairValues</strong>(11) = //returns (9, 2)</pre><p><em>What’s interesting about this solution is that it can be solved using different techniques. The main objective is calculating which numbers can be paired to achieve the expected result. How could this work, assuming your algorithm is only permitted to scan the sequence once?</em></p><h3>8. Reverse the Vowels</h3><p>You’ve been asked by your manager to build a new algorithm to reverse <strong>vowels</strong> in any proposed String. How would you build such a model, assuming you aren’t allowed to use any native String reverse() functions in your code?</p><pre>e.g. Hello = <strong>Holle</strong><br>e.g. BinarySearch = <strong>BanerySairch</strong></pre><p><em>When preparing for a technical interview, it’s common to practice code challenges on String manipulation, including being able to reverse sequences. This challenge presents a twist by reversing </em><strong><em>specific</em></strong><em> values. How will you track the position of vowels as you iterate through the model? Also, how will you reverse the series of vowels without using native Swift library functions?</em></p><h3>9. Count of Occurrences</h3><p>If asked in a technical interview, could you write a function that lists the number of occurrences for each word in descending order? For the output, assume your solution makes use of a standard Swift Dictionary or Array of tuple values. Also assume your algorithm does not make use of any built-in Swift sorting functions.</p><pre><strong>input:</strong> <br>this is a test of the emergency broadcast system this is only a test dog dog dog</pre><pre><strong>output:</strong><br>dog 3<br>a 2<br>is 2<br>test 2<br>this 2<br>broadcast 1<br>emergency 1<br>of 1<br>only 1<br>the 1<br>system 1</pre><p><em>At first glance, this challenge seems relatively straightforward. The idea being one could easily iterate through a list of words in O(n) — linear time and track the number of word occurrences with a standard dictionary. However, difficulty is introduced when sorting the word list. Without using a built-in function, how would you keep the list sorted as new items are being added?</em></p><h3>10. Power of Two</h3><p>If asked in a technical interview, could you write a function to determine if an integer is a power of two? For example:</p><pre>Input: 1<br>Output: <strong>true</strong> <br>Explanation: 20 = 1</pre><pre>Input: 16<br>Output: <strong>true<br></strong>Explanation: 24 = 16</pre><pre>Input: 218<br>Output: <strong>false</strong></pre><p><em>Even though the Swift SDK has built in functionality to accomplish this task, how would you write this algorithm from scratch? Could the input values be interpreted in a different way to achieve our objective?</em></p><h3>11. Longest Subsequence</h3><p>If asked in a technical interview, could you write a function in Swift to find the longest subsequence of array elements in consecutive order? The consecutive numbers can be in any order. For example:</p><pre>//input<br>let sequence: Array&lt;Int&gt; = [9, 4, 10, 2, 7, 3, 5, 1]<br><br><strong>//output = 4</strong><br>the values <strong>1, 2, 3, 4</strong> are the longest sequence of consecutive elements</pre><p><em>A consecutive sequence doesn’t necessarily require that our elements be in ascending or descending order. However, your solution will still need to be intuitive enough to recognize which values come in order. Could a brute force solution be designed to correctly sort through the array, or could the values be placed into a more efficient data structure?</em></p><h3>12. Tree Traversal</h3><p>If asked in a technical interview, what technique or algorithm would you use to print the following values in sequential order?</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/307/1*yN5XG_evPK-FIdRp2Z-B-w.png" /></figure><pre><strong>output</strong> = 1, 2, 3, 4, 5, 6, 7</pre><p><em>Often what makes tree-based questions difficult is knowing how to navigate their structure. Just like with working with standard Swift collections like a Dictionary, Array or Set, knowing how to navigate and manipulate content in trees unlocks their capabilities and allows us to apply them to specific situations.</em></p><h3>13. Fibonacci Revised</h3><p>If asked in a technical interview, how would you <strong>improve</strong> the runtime performance of this code? Why would your version be more effective?</p><pre>func <strong>fib</strong>(_ n: Int) -&gt; Int {<br>    guard n &gt; 1 else { return n }<br>    return <strong>fib</strong>(n-1) + <strong>fib</strong>(n-2)<br>}</pre><p><em>When learning the basics of recursive algorithms, the Fibonacci sequence is a widely used standard for understanding this process. However, there are a number of ways we can write this algorithm. Even though our function is technically correct, how could this function be improved? What is being implied when we say the algorithm is inefficient?</em></p><h3>14. Multiple Inheritance</h3><p>If asked in a technical interview, could you explain or write code showing why Swift doesn’t support multiple inheritance? What’s the alternative?</p><p><em>Even though the concept of multiple inheritance was once considered a must-have feature in languages such as C++, most modern programming languages like Java and Swift only support single inheritance. As part of your analysis, can you think of why is no longer used?</em></p><h3>15. Design a URL Shortener</h3><p>In a technical interview, you’ve been asked to provide a high-level design for the creation of a url shortener service (eg. bit.ly). Describe the major functions of the service as well as any additional supporting components.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*VXikKc1DgI4YCl6HQhlMmw.png" /></figure><p><em>How does a url shortener work? How will you ensure each hashed url is unique? How will end users retrieve hashed urls? Are all urls guaranteed to be unique? Can two or more hashed url’s be resolved to the same url?</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6bddcb9d5d20" width="1" height="1" alt=""><hr><p><a href="https://medium.com/swift-algorithms-data-structures/15-essential-ios-technical-code-challenge-questions-with-hints-6bddcb9d5d20">15 Essential iOS Technical Code Challenge Questions (with Hints)</a> was originally published in <a href="https://medium.com/swift-algorithms-data-structures">Swift Algorithms &amp; Data Structures</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[5 Free resources to help ace your next iOS technical interview]]></title>
            <link>https://medium.com/swift-algorithms-data-structures/5-free-resources-to-help-ace-your-next-ios-technical-interview-af13f3b557a3?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/af13f3b557a3</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[code]]></category>
            <category><![CDATA[xcode]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Wed, 27 Jan 2021 20:48:22 GMT</pubDate>
            <atom:updated>2021-01-28T00:43:52.931Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*5Fz7AmufNA5cwKbm_TaE-w.jpeg" /></figure><p>For iOS developers at any level, learning something new can be a time-consuming and challenging process. When discussing career goals with other iOS developers, most possess a good understanding of Swift/iOS coding syntax and commonly used design patterns. However, roadblocks are met when understanding ideas behind computer science, problem solving and algorithms. If this describes you, here are <strong>5 free resources</strong> to help you ace your next technical interview.</p><p><strong>The iOS Interview Worksheet</strong><br>Initially conceived as handwritten notes as I prepared for a technical interview at Google (years ago), <a href="http://pages.waynewbishop.com/">this free resource</a> has been expanded to support the many areas of consideration relative to iOS development. Downloaded by thousands and formatted in a 5-page checklist format, areas of recommended study include Swift, Objective-C, Design Patterns, User Interfaces, Data Management, Algorithms &amp; Data Structures as well as Version Control.</p><p><strong>The iOS Computer Science Lab</strong><br>The <a href="http://www.waynewbishop.com/ios-interview/cslab">Computer Science Lab</a> was started as a means to provide more detailed instruction for those preparing for their next technical interview. Going beyond (dry) written content or canned videos, students in the science lab solve coding challenges in a live virtual setting via Zoom. While some have used the lab to help them land specific jobs at Facebook, Apple, Airbnb etc. others use it as a general means to learn something new each week. While full-time students pay for the service, new users <a href="http://www.waynewbishop.com/ios-interview/cslab">can register</a> for their first class for free.</p><p><strong>The Wayne W Bishop YouTube Channel</strong><br>Recently stared in 2021, this <a href="https://www.youtube.com/channel/UC6zsQ1v1UEAdbsQcWcDcbZA">new video resource</a> has been designed to fill in specific knowledge gaps when preparing for a technical interview. For example, most students enrolled in the Computer Science Lab are at a medium/advanced level with iOS. For those new to Swift, <a href="https://www.youtube.com/channel/UC6zsQ1v1UEAdbsQcWcDcbZA">these tutorials</a> act as a nice bridge helping those get to the next level.</p><p><strong>The Swift Essentials Email Course (Sample)<br></strong>Delivered via email, the 15-part <a href="https://pages.waynewbishop.com/essentials">Swift Essentials</a> course is designed to help new and existing iOS Developers prepare for their next technical interview. The series contains code challenges designed to help you recall the fundamentals when it comes to the latest Swift syntax, design patterns and algorithms. While the full course is paid, users can register for a <a href="https://pages.waynewbishop.com/essentials">3-part free sample</a> at the website.</p><p><strong>The Swift Extras Website</strong><br>While its fabulous working directly other developers each week, sometimes the same questions arise which require a more detailed explanation. This extra content is published <a href="https://extras.waynewbishop.com/">free of charge</a> for others to access and review. In addition to full-length essays there is also a growing list of <a href="https://extras.waynewbishop.com/challenge">code challenges</a> as well. Popular articles include <a href="https://extras.waynewbishop.com/swift/learning-big-o-notation-with-swift">Understanding Big-O Notation with Swift</a> as well as <a href="https://extras.waynewbishop.com/swift/swift-closure-syntax">Understanding Swift Closure format</a>.</p><p>Happy Coding!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=af13f3b557a3" width="1" height="1" alt=""><hr><p><a href="https://medium.com/swift-algorithms-data-structures/5-free-resources-to-help-ace-your-next-ios-technical-interview-af13f3b557a3">5 Free resources to help ace your next iOS technical interview</a> was originally published in <a href="https://medium.com/swift-algorithms-data-structures">Swift Algorithms &amp; Data Structures</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[What Software Engineers can learn from Apple’s M1 Chip]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/what-software-engineers-can-learn-from-apples-m1-chip-8376374a0f97?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/980/1*jnv1eQR-F-Wxby3eVEhOsA.jpeg" width="980"></a></p><p class="medium-feed-snippet">Has Apple introduced some new revolutionary new technology, or have they revealed the potential of existing technologies when optimized?</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/what-software-engineers-can-learn-from-apples-m1-chip-8376374a0f97?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/what-software-engineers-can-learn-from-apples-m1-chip-8376374a0f97?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/8376374a0f97</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[apple]]></category>
            <category><![CDATA[xcode]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Tue, 01 Dec 2020 20:01:08 GMT</pubDate>
            <atom:updated>2020-12-01T20:01:08.637Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[5 Tips for Writing Your Own Algorithms in Swift]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/5-tips-for-writing-your-own-algorithms-in-swift-827b7e932ad1?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*6HRU03UvgOt_5ih3ssEDXw.jpeg" width="5657"></a></p><p class="medium-feed-snippet">Here are five tips to consider when writing your own algorithms.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/5-tips-for-writing-your-own-algorithms-in-swift-827b7e932ad1?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/5-tips-for-writing-your-own-algorithms-in-swift-827b7e932ad1?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/827b7e932ad1</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[xcode]]></category>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[ios]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Tue, 08 Sep 2020 21:42:53 GMT</pubDate>
            <atom:updated>2020-12-07T18:26:59.148Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Code Challenge: Bitwise Basics in Swift]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/code-challenge-bitwise-basics-in-swift-d5f086e53ffd?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*HvjBrGsi9UIfELQhtu_Ovw.jpeg" width="6000"></a></p><p class="medium-feed-snippet">In this code challenge, we review how to convert binary values in Swift.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/code-challenge-bitwise-basics-in-swift-d5f086e53ffd?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/code-challenge-bitwise-basics-in-swift-d5f086e53ffd?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/d5f086e53ffd</guid>
            <category><![CDATA[swift]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[ios]]></category>
            <category><![CDATA[xcode]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Mon, 04 May 2020 04:24:49 GMT</pubDate>
            <atom:updated>2020-12-07T18:27:53.688Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Understanding Swift Protocol-Oriented Programming]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/swift-algorithms-data-structures/understanding-swift-protocol-oriented-programming-223b4458c2be?source=rss----befa206a7c5e---4"><img src="https://cdn-images-1.medium.com/max/2600/1*UCgYK5btiFQJLlq75HB3NQ.jpeg" width="5760"></a></p><p class="medium-feed-snippet">In addition to the use of Optionals and Generics, what makes Swift a robust language is its extensive use of Protocols.</p><p class="medium-feed-link"><a href="https://medium.com/swift-algorithms-data-structures/understanding-swift-protocol-oriented-programming-223b4458c2be?source=rss----befa206a7c5e---4">Continue reading on Swift Algorithms &amp; Data Structures »</a></p></div>]]></description>
            <link>https://medium.com/swift-algorithms-data-structures/understanding-swift-protocol-oriented-programming-223b4458c2be?source=rss----befa206a7c5e---4</link>
            <guid isPermaLink="false">https://medium.com/p/223b4458c2be</guid>
            <category><![CDATA[xcode]]></category>
            <category><![CDATA[ios]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[swift-programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Wayne Bishop]]></dc:creator>
            <pubDate>Wed, 01 Apr 2020 21:38:23 GMT</pubDate>
            <atom:updated>2020-12-07T18:28:26.620Z</atom:updated>
        </item>
    </channel>
</rss>