<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Data-Structures on Karpoke - Just Another Blog</title><link>http://karpoke.ignaciocano.com/tags/data-structures/</link><description>Recent content in Data-Structures on Karpoke - Just Another Blog</description><generator>Hugo -- 0.167.0</generator><language>es</language><lastBuildDate>Tue, 20 Feb 2024 22:47:48 +0100</lastBuildDate><atom:link href="http://karpoke.ignaciocano.com/tags/data-structures/index.xml" rel="self" type="application/rss+xml"/><item><title>Learn Data Structures and Algorithms in 48 Hours</title><link>http://karpoke.ignaciocano.com/2024/02/20/learn-data-structures-and-algorithms-in-48-hours/</link><pubDate>Tue, 20 Feb 2024 22:47:48 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2024/02/20/learn-data-structures-and-algorithms-in-48-hours/</guid><description>&lt;blockquote&gt;
&lt;p&gt;In the realm of software development, mastering Data Structures and
Algorithms could be a critical step towards securing your dream job. We
just posted a course on the freeCodeCamp.org YouTube channel that will
equip you with the knowledge to excel i&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» freeCodeCamp.org | &lt;a href="https://www.freecodecamp.org/news/learn-data-structures-and-algorithms-2/"&gt;freecodecamp.org&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Data Structures Handbook – The Key to Scalable Software</title><link>http://karpoke.ignaciocano.com/2023/11/23/data-structures-handbook-the-key-to-scalable-software/</link><pubDate>Thu, 23 Nov 2023 13:44:27 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2023/11/23/data-structures-handbook-the-key-to-scalable-software/</guid><description>&lt;blockquote&gt;
&lt;p&gt;If you&amp;rsquo;re regularly confronted by the complexity of modern data, you’re
not alone. In our data-centric world, understanding data structures
isn’t optional — it’s essential. Whether you’re a novice coder or an
experienced developer, this handbook is &amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» freeCodeCamp.org | &lt;a href="https://www.freecodecamp.org/news/data-structures-the-key-to-scalable-software/"&gt;freecodecamp.org&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Python — Duplicate For Loops</title><link>http://karpoke.ignaciocano.com/2023/04/19/python-duplicate-for-loops/</link><pubDate>Wed, 19 Apr 2023 15:33:52 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2023/04/19/python-duplicate-for-loops/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Python — Duplicate For Loops&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» hackernoon.com | &lt;a href="https://hackernoon.com/python-duplicate-for-loops"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Convert Sorted Array to Binary Search Tree</title><link>http://karpoke.ignaciocano.com/2023/02/12/convert-sorted-array-to-binary-search-tree/</link><pubDate>Sun, 12 Feb 2023 09:33:33 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2023/02/12/convert-sorted-array-to-binary-search-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Using Kotlin at your technical interviews!&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» hackernoon.com | &lt;a href="https://hackernoon.com/convert-sorted-array-to-binary-search-tree"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>The Big O</title><link>http://karpoke.ignaciocano.com/2022/08/03/the-big-o/</link><pubDate>Wed, 03 Aug 2022 16:58:53 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2022/08/03/the-big-o/</guid><description>&lt;blockquote&gt;
&lt;p&gt;The Big O is a way to measure how well your code solves a problem&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» hackernoon.com | &lt;a href="https://hackernoon.com/the-big-o"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>The Abstract Syntax Tree</title><link>http://karpoke.ignaciocano.com/2021/12/02/the-abstract-syntax-tree/</link><pubDate>Thu, 02 Dec 2021 13:03:41 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/12/02/the-abstract-syntax-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Introduction One of the first steps a compiler must take is parse the
human-readable&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/drbearhands/the-abstract-syntax-tree-1p30"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Merge Sort and Quick Sort!</title><link>http://karpoke.ignaciocano.com/2021/11/10/merge-sort-and-quick-sort/</link><pubDate>Wed, 10 Nov 2021 14:25:35 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/11/10/merge-sort-and-quick-sort/</guid><description>&lt;blockquote&gt;
&lt;p&gt;In this article I am going to explain two sorting algorithms, Merge Sort
and Quick Sort with detailed&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/suchitra_13/merge-sort-and-quick-sort-icn"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Merge Two Sorted Arrays</title><link>http://karpoke.ignaciocano.com/2021/09/07/merge-two-sorted-arrays/</link><pubDate>Tue, 07 Sep 2021 07:42:59 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/09/07/merge-two-sorted-arrays/</guid><description>&lt;blockquote&gt;
&lt;p&gt;BruteForce. Straight forward solution. Time complexity O(nlogn). Space
complexity&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/gangzhaorige/merge-two-sorted-arrays-3623"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Breadth First Search (BFS) Algorithm</title><link>http://karpoke.ignaciocano.com/2021/07/11/breadth-first-search-bfs-algorithm/</link><pubDate>Sun, 11 Jul 2021 11:09:23 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/07/11/breadth-first-search-bfs-algorithm/</guid><description>&lt;blockquote&gt;
&lt;p&gt;hi guys, on this beautiful day we&amp;rsquo;ll talk about Breadth-First Search
Definition of&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/ayabouchiha/breadth-first-search-bfs-algorithm-1m5c"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Depth First Search (DFS) Algorithm</title><link>http://karpoke.ignaciocano.com/2021/07/11/depth-first-search-dfs-algorithm/</link><pubDate>Sun, 11 Jul 2021 10:22:30 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/07/11/depth-first-search-dfs-algorithm/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Hi, today, we&amp;rsquo;re going to talk about Depth First Search (DFS) Definition
of Depth First&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/ayabouchiha/depth-first-search-dfs-algorithm-3gjp"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Data Structures: Graphs</title><link>http://karpoke.ignaciocano.com/2021/06/17/data-structures-graphs/</link><pubDate>Thu, 17 Jun 2021 18:18:27 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/06/17/data-structures-graphs/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Introduction Graphs. Everyone talks about them. They always ask them
in&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/tamerlang/data-structures-graphs-2960"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Queue Data Structure</title><link>http://karpoke.ignaciocano.com/2021/06/15/queue-data-structure/</link><pubDate>Tue, 15 Jun 2021 20:08:37 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/06/15/queue-data-structure/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Hi, today, we&amp;rsquo;re going to discuss queue :) Definition Of Queue A Queue
is a linear data&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/ayabouchiha/queue-data-structure-2hfg"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Solution: Construct Binary Tree from Preorder and Inorder Traversal</title><link>http://karpoke.ignaciocano.com/2021/06/09/solution-construct-binary-tree-from-preorder-and-inorder-traversal/</link><pubDate>Wed, 09 Jun 2021 08:30:56 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/06/09/solution-construct-binary-tree-from-preorder-and-inorder-traversal/</guid><description>&lt;blockquote&gt;
&lt;p&gt;This is part of a series of Leetcode solution explanations (index). If
you liked this solution or fou&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/seanpgallivan/solution-construct-binary-tree-from-preorder-and-inorder-traversal-32c5"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Structs in C</title><link>http://karpoke.ignaciocano.com/2021/05/13/structs-in-c/</link><pubDate>Thu, 13 May 2021 15:38:18 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/05/13/structs-in-c/</guid><description>&lt;blockquote&gt;
&lt;p&gt;In this article, I will show you what structs are and how to effectively
use them in your programs. I&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/tomislavkraljic/structs-in-c-2ojh"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Solution: Convert Sorted List to Binary Search Tree</title><link>http://karpoke.ignaciocano.com/2021/05/06/solution-convert-sorted-list-to-binary-search-tree/</link><pubDate>Thu, 06 May 2021 14:39:59 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2021/05/06/solution-convert-sorted-list-to-binary-search-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;This is part of a series of Leetcode solution explanations (index). If
you liked this solution or fou&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/seanpgallivan/solution-convert-sorted-list-to-binary-search-tree-2i0e"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Recursion vs Iteration: 13 Ways to Traverse a Tree.</title><link>http://karpoke.ignaciocano.com/2020/10/18/recursion-vs-iteration-13-ways-to-traverse-a-tree/</link><pubDate>Sun, 18 Oct 2020 10:56:37 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/10/18/recursion-vs-iteration-13-ways-to-traverse-a-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;To understand recursion, you must understand recursion. I will show you
13 different ways to traverse&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/codinglanguages/recursion-vs-iteration-13-ways-to-traverse-a-tree-2n89"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>WTF is a Binary Search Tree?</title><link>http://karpoke.ignaciocano.com/2020/10/07/wtf-is-a-binary-search-tree/</link><pubDate>Wed, 07 Oct 2020 16:31:28 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/10/07/wtf-is-a-binary-search-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;The binary tree is a type of data structure that is commonly used to
represent hierarchical data. It is an efficient way of storing and
organizing data that is ranked in parent nodes and child nodes.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» hackernoon.com | &lt;a href="https://hackernoon.com/wtf-is-a-binary-search-tree-9ky3wk4"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>How to learn (not memorize) any algorithm or data structure. Analysis of 20 problem-solving techniques you must know</title><link>http://karpoke.ignaciocano.com/2020/09/03/how-to-learn-not-memorize-any-algorithm-or-data-structure-analysis-of-20-problem/</link><pubDate>Thu, 03 Sep 2020 22:52:27 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/09/03/how-to-learn-not-memorize-any-algorithm-or-data-structure-analysis-of-20-problem/</guid><description>&lt;blockquote&gt;
&lt;p&gt;This article was originally published in my blog &lt;a href="https://www.yourdevopsguy.com"&gt;www.yourdevopsguy.com&lt;/a&gt;.
This is the article I wish I&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/codinglanguages/how-to-learn-not-memorize-any-algorithm-or-data-structure-analysis-of-20-problem-solving-techniques-you-must-know-d77"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>Complete Introduction to the 30 Most Essential Data Structures &amp; Algorithms</title><link>http://karpoke.ignaciocano.com/2020/09/03/complete-introduction-to-the-30-most-essential-data-structures-algorithms/</link><pubDate>Thu, 03 Sep 2020 22:52:23 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/09/03/complete-introduction-to-the-30-most-essential-data-structures-algorithms/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Data Structures &amp;amp; Algorithms (DSA) is often considered to be an
intimidating topic - a common&amp;hellip;&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/iuliagroza/complete-introduction-to-the-30-most-essential-data-structures-algorithms-43kd"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>How Do We Get a Balanced Binary Tree?</title><link>http://karpoke.ignaciocano.com/2020/09/01/how-do-we-get-a-balanced-binary-tree/</link><pubDate>Tue, 01 Sep 2020 22:28:34 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/09/01/how-do-we-get-a-balanced-binary-tree/</guid><description>&lt;blockquote&gt;
&lt;p&gt;A binary tree can be empty, implying zero nodes in the tree. The cool
thing about &lt;code&gt;binary trees&lt;/code&gt; is that they are recursive structures.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» DEV Community | &lt;a href="https://dev.to/jacobjzhang/how-do-we-get-a-balanced-binary-tree-259e"&gt;dev.to&lt;/a&gt;&lt;/p&gt;</description></item><item><title>How to check if a binary tree is balanced</title><link>http://karpoke.ignaciocano.com/2020/02/08/how-to-check-if-a-binary-tree-is-balanced/</link><pubDate>Sat, 08 Feb 2020 12:21:51 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2020/02/08/how-to-check-if-a-binary-tree-is-balanced/</guid><description>&lt;blockquote&gt;
&lt;p&gt;An O(n) algorithm to check if a binary tree is balanced, by passing up
the height from recursive calls.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» jameshfisher.com | &lt;a href="https://jameshfisher.com/2020/01/23/how-to-check-if-a-binary-tree-is-balanced/"&gt;jameshfisher.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>10 Data Structure &amp; Algorithms Books Every Programmer Should Read</title><link>http://karpoke.ignaciocano.com/2019/06/21/10-data-structure-amp-algorithms-books-every-programmer-should-read/</link><pubDate>Fri, 21 Jun 2019 15:11:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2019/06/21/10-data-structure-amp-algorithms-books-every-programmer-should-read/</guid><description>&lt;blockquote&gt;
&lt;p&gt;A collection of awesome Algorithms books which should find a place in every
programmer’s book self. Includes language specific books in Java, Python,
and JavaScript for easy learning. Algorithms are language agnostic and any
programmer worth their salt should be able to convert them to code in their
programming language of choice.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» Hacker Noon | &lt;a href="https://hackernoon.com/10-data-structure-algorithms-books-every-programmer-should-read-d50487313127----3a8144eabfe3---4"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>10 Data Structure, Algorithms, and Programming Courses to Crack Any Coding Interview</title><link>http://karpoke.ignaciocano.com/2018/10/26/10-data-structure-algorithms-and-programming-courses-to-crack-any-coding-interview/</link><pubDate>Fri, 26 Oct 2018 04:21:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2018/10/26/10-data-structure-algorithms-and-programming-courses-to-crack-any-coding-interview/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Many junior developers dream of making it at one of the larger tech
companies, but, to be honest with you, getting your first job is never easy.
It is, in fact, one of the hardest things in your life and you need to put
your best effort to find a job in your dream company.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» Hacker Noon | &lt;a href="https://hackernoon.com/10-data-structure-algorithms-and-programming-courses-to-crack-any-coding-interview-e1c50b30b927"&gt;hackernoon.com&lt;/a&gt;&lt;/p&gt;</description></item></channel></rss>