<?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[Stories by Supun Geethanjana Jayasinghe on Medium]]></title>
        <description><![CDATA[Stories by Supun Geethanjana Jayasinghe on Medium]]></description>
        <link>https://medium.com/@supungeethanjana1?source=rss-5e8a689bcc37------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*T0tmtcl5kZGUstsyNVwb5w.jpeg</url>
            <title>Stories by Supun Geethanjana Jayasinghe on Medium</title>
            <link>https://medium.com/@supungeethanjana1?source=rss-5e8a689bcc37------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 16:35:57 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@supungeethanjana1/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[The Architectural Trilemma: Monolith, Modular Monolith, and Microservices]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/the-architectural-trilemma-monolith-modular-monolith-and-microservices-be6577498cea?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1280/1*cpHtPZcuoBSQj_rBogouMg.png" width="1280"></a></p><p class="medium-feed-snippet">In the world of software engineering, few decisions carry the long-term strategic weight of choosing an architectural style. The debate&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/the-architectural-trilemma-monolith-modular-monolith-and-microservices-be6577498cea?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/the-architectural-trilemma-monolith-modular-monolith-and-microservices-be6577498cea?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/be6577498cea</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Mon, 22 Sep 2025 12:47:47 GMT</pubDate>
            <atom:updated>2025-09-22T12:47:47.140Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Linear Data Structures: Arrays]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/linear-data-structures-arrays-8f8dd3ab8ff8?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1536/1*C49rZsJsi7VkwHyDb5Gm-w.png" width="1536"></a></p><p class="medium-feed-snippet">An Introduction to the Array Data Structure</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/linear-data-structures-arrays-8f8dd3ab8ff8?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/linear-data-structures-arrays-8f8dd3ab8ff8?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/8f8dd3ab8ff8</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Mon, 15 Sep 2025 11:02:32 GMT</pubDate>
            <atom:updated>2025-09-15T11:02:32.883Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[What is an Algorithm? A First Look at Big O Notation]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/what-is-an-algorithm-a-first-look-at-big-o-notation-cb73b9fe6816?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1536/1*RL_MCy5vkhdsdP3CTI0kPw.png" width="1536"></a></p><p class="medium-feed-snippet">Introduction: The Digital Recipe Book</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/what-is-an-algorithm-a-first-look-at-big-o-notation-cb73b9fe6816?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/what-is-an-algorithm-a-first-look-at-big-o-notation-cb73b9fe6816?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/cb73b9fe6816</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Mon, 01 Sep 2025 06:02:51 GMT</pubDate>
            <atom:updated>2025-09-01T06:02:51.712Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Why Learn Data Structures and Algorithms?]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/why-learn-data-structures-and-algorithms-27ed917070c1?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/675/1*U9Cn0uu2Ikp53elCKjpdlQ.png" width="675"></a></p><p class="medium-feed-snippet">The Timeless Core: Beyond Code and Frameworks</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/why-learn-data-structures-and-algorithms-27ed917070c1?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/why-learn-data-structures-and-algorithms-27ed917070c1?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/27ed917070c1</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Tue, 26 Aug 2025 14:22:42 GMT</pubDate>
            <atom:updated>2025-09-01T06:11:34.241Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Understanding FHIR: The Universal Translator for Healthcare Data]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/understanding-fhir-the-universal-translator-for-healthcare-data-21bb23724cea?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1024/1*01BkFR1WLcny9cnlONtoHw.png" width="1024"></a></p><p class="medium-feed-snippet">I. The Imperative for Interoperability in Modern Healthcare</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/understanding-fhir-the-universal-translator-for-healthcare-data-21bb23724cea?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/understanding-fhir-the-universal-translator-for-healthcare-data-21bb23724cea?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/21bb23724cea</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Fri, 08 Aug 2025 07:01:39 GMT</pubDate>
            <atom:updated>2025-08-08T07:01:39.987Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Code Refactoring: A Deep Dive into Enhancing Software Quality]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/code-refactoring-a-deep-dive-into-enhancing-software-quality-4e5d79ff21b6?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1280/1*88d7AtilBY_UZSCnS293qg.jpeg" width="1280"></a></p><p class="medium-feed-snippet">Code refactoring is a crucial practice in software development that goes beyond simply writing code.</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/code-refactoring-a-deep-dive-into-enhancing-software-quality-4e5d79ff21b6?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/code-refactoring-a-deep-dive-into-enhancing-software-quality-4e5d79ff21b6?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/4e5d79ff21b6</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Tue, 05 Aug 2025 05:47:17 GMT</pubDate>
            <atom:updated>2025-08-05T05:47:17.027Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[The Healthcare Interoperability Challenge — Speaking Different Languages]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/the-healthcare-interoperability-challenge-speaking-different-languages-1314aee22d4a?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/2000/1*N2ml_MHHmG7-uA-cq4qdoA.jpeg" width="2000"></a></p><p class="medium-feed-snippet">I. Introduction: The Tower of Babel in Healthcare</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/the-healthcare-interoperability-challenge-speaking-different-languages-1314aee22d4a?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/the-healthcare-interoperability-challenge-speaking-different-languages-1314aee22d4a?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/1314aee22d4a</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Tue, 29 Jul 2025 13:54:45 GMT</pubDate>
            <atom:updated>2025-07-29T13:54:45.460Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Mastering Data Access: A Deep Dive into Spring Data Repositories]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@supungeethanjana1/mastering-data-access-a-deep-dive-into-spring-data-repositories-07e7df2acee8?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1280/1*6EH--qDSx_NnPnn6i7YXyA.png" width="1280"></a></p><p class="medium-feed-snippet">Streamlining Data Access with Spring Data Repositories</p><p class="medium-feed-link"><a href="https://medium.com/@supungeethanjana1/mastering-data-access-a-deep-dive-into-spring-data-repositories-07e7df2acee8?source=rss-5e8a689bcc37------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@supungeethanjana1/mastering-data-access-a-deep-dive-into-spring-data-repositories-07e7df2acee8?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/07e7df2acee8</guid>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Mon, 28 Jul 2025 13:17:23 GMT</pubDate>
            <atom:updated>2025-07-28T13:17:23.376Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Choosing Your Backend Foundation: A Comprehensive Comparison of Spring Boot and Nest.js]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://javascript.plainenglish.io/choosing-your-backend-foundation-a-comprehensive-comparison-of-spring-boot-and-nest-js-7387beeb2c33?source=rss-5e8a689bcc37------2"><img src="https://cdn-images-1.medium.com/max/1280/1*pFq02YmZk88_EZ1FCcE0hw.png" width="1280"></a></p><p class="medium-feed-snippet">This article compares Spring Boot and Nest.js for monolithic and microservice architectures. Spring Boot, a mature Java framework, excels&#x2026;</p><p class="medium-feed-link"><a href="https://javascript.plainenglish.io/choosing-your-backend-foundation-a-comprehensive-comparison-of-spring-boot-and-nest-js-7387beeb2c33?source=rss-5e8a689bcc37------2">Continue reading on JavaScript in Plain English »</a></p></div>]]></description>
            <link>https://javascript.plainenglish.io/choosing-your-backend-foundation-a-comprehensive-comparison-of-spring-boot-and-nest-js-7387beeb2c33?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/7387beeb2c33</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[backend-development]]></category>
            <category><![CDATA[spring-boot]]></category>
            <category><![CDATA[nestjs]]></category>
            <category><![CDATA[microservices]]></category>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Wed, 16 Jul 2025 10:18:06 GMT</pubDate>
            <atom:updated>2025-07-30T00:51:30.936Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Data Structures: The Backbone of Computer Science]]></title>
            <link>https://medium.com/@supungeethanjana1/data-structures-the-backbone-of-computer-science-278a91c45613?source=rss-5e8a689bcc37------2</link>
            <guid isPermaLink="false">https://medium.com/p/278a91c45613</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[data-structures]]></category>
            <dc:creator><![CDATA[Supun Geethanjana Jayasinghe]]></dc:creator>
            <pubDate>Mon, 12 Aug 2024 15:03:29 GMT</pubDate>
            <atom:updated>2024-08-12T15:05:31.149Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*p7IsVq9Nc91KoFtKimk8sw.jpeg" /></figure><h3>What are Data Structures?</h3><p>Imagine building a house. You wouldn’t just throw bricks and wood together randomly; you’d follow a blueprint. Similarly, in computer programming, data structures are the blueprints for organizing and storing data.</p><p>They determine how data is arranged and accessed, influencing the efficiency and effectiveness of your code.</p><p>A data structure is essentially a container that holds data. But it’s not just any container; it’s designed to optimize specific operations. For example, if you need to quickly find an item in a large collection, a hash table might be ideal. If you need to process data in a specific order, a queue or stack might be better suited.</p><h3>Why are Data Structures Important?</h3><p>Data structures are the backbone of computer science, providing the framework for organizing and storing data efficiently. They provide the blue print for organizing and storing data in a computer’s memory. Their importance lies in several key areas:</p><p>1. Efficiency</p><ul><li>Optimized operations: Data structures are designed to excel at specific operations. For example, a hash table is ideal for quick lookups, while a heap is efficient for finding the maximum or minimum value.</li><li>Reduced time complexity: By choosing the right data structure, you can significantly improve the performance of your algorithms.</li></ul><p>2. Organization</p><ul><li>Logical arrangement: Data structures impose structure on data, making it easier to manage and understand.</li><li>Data integrity: They help maintain data consistency and prevent errors.</li></ul><p>3. Problem-solving</p><ul><li>Algorithm foundation: Many algorithms rely on specific data structures to function effectively.</li><li>Real-world applications: From databases to operating systems, data structures are used to solve complex problems.</li></ul><p>4. Memory Management</p><ul><li>Efficient space utilization: Data structures help optimize memory usage, preventing waste and improving performance.</li><li>Data persistence: They enable storing data for later retrieval.</li></ul><p>5. Code Reusability</p><ul><li>Modular design: Well-defined data structures can be reused in different parts of a program or even in other projects.</li><li>Abstraction: They provide a higher level of abstraction, making code more readable and maintainable.</li></ul><p>In essence, data structures are the tools that empower programmers to create efficient, scalable, and reliable software applications.</p><h3>Common Types of Data Structures</h3><p>There are numerous data structures, each with its own strengths and weaknesses. Here are some of the most common ones:</p><p>Linear Data Structures</p><p>Linear data structures are those where data elements are arranged sequentially or linearly. Each element is connected to its neighboring elements, forming a linear sequence. This means you can traverse through all elements in a single run.</p><p>Characteristics of Linear Data Structures</p><ul><li>Data elements are arranged sequentially.</li><li>Each element has a predecessor and successor (except for the first and last elements).</li><li>Data is stored at a single level.</li><li>Traversal of elements is done in a linear fashion.</li></ul><p>Common Linear Data Structures</p><p>Arrays:</p><ul><li>A collection of elements, each identified by an index.</li><li>Elements are stored in contiguous memory locations.</li><li>Efficient for random access but inefficient for insertions and deletions</li></ul><p>Linked Lists:</p><ul><li>A sequence of nodes, where each node contains data and a reference to the next node.</li><li>Dynamic in size, allowing efficient insertions and deletions.</li><li>Random access is slower compared to arrays</li></ul><p>Stacks:</p><ul><li>LIFO (Last In, First Out) structure.</li><li>Elements are added and removed from the same end (top).</li><li>Used for function calls, undo/redo operations, etc.</li></ul><p>Queues:</p><ul><li>FIFO (First In, First Out) structure.</li><li>Elements are added at the rear and removed from the front.</li><li>Used for task scheduling, print queues, etc.</li></ul><p>Non-Linear Data Structures</p><p>Unlike linear data structures, where elements are arranged sequentially, non-linear data structures have a more complex arrangement. They don’t follow a linear path, and elements can be connected in multiple ways</p><p>Characteristics of Non-Linear Data Structures</p><ul><li>Data elements are not arranged sequentially.</li><li>Elements can be at multiple levels.</li><li>Traversal of all elements requires multiple passes.</li><li>Often more complex to implement than linear data structures.</li><li>Generally more efficient in terms of memory utilization</li></ul><p>Common Non-Linear Data Structures</p><p>Trees:</p><ul><li>Hierarchical structures with a root node and child nodes.</li><li>Common types include binary trees, binary search trees, AVL trees, heaps.</li><li>Used for representing hierarchical relationships, searching, sorting.</li></ul><p>Graphs:</p><ul><li>A collection of nodes (vertices) connected by edges.</li><li>Represents networks, relationships, and connections.</li><li>Used in social networks, routing algorithms, map applications.</li></ul><h3>Choosing the Right Data Structure</h3><p>Choosing the right data structure is crucial for efficient and effective programming. Here are the key factors to consider:</p><p>1. Type of Data:</p><ul><li>Nature of data: Numerical, textual, or structured.</li><li>Data size: Small, medium, or large.</li><li>Data distribution: Uniform, skewed, or clustered.</li></ul><p>2. Required Operations:</p><ul><li>Frequency of operations: How often will you perform insertions, deletions, searches, updates, etc.?</li><li>Order of operations: Do operations need to be performed in a specific order?</li><li>Time complexity: How fast should operations be executed?</li></ul><p>3. Memory Constraints:</p><ul><li>Available memory: How much memory is available for the data structure?</li><li>Memory efficiency: How efficiently does the data structure utilize memory?</li></ul><p>4. Time Complexity:</p><ul><li>Performance requirements: How fast should operations be executed?</li><li>Trade-offs: Consider the time complexity of different operations (e.g., search, insert, delete).</li></ul><p>5. Space Complexity:</p><ul><li>Memory usage: How much memory does the data structure require?</li><li>Trade-offs: Consider the space requirements of different data structures.</li></ul><p>6. Implementation Complexity:</p><ul><li>Development time: How complex is it to implement the data structure?</li><li>Maintainability: How easy is it to modify and update the data structure?</li></ul><p>7. Data Organization:</p><ul><li>Hierarchical or linear: Does the data have a hierarchical structure or is it sequential?</li><li>Relationships between elements: How are the data elements related to each other?</li></ul><p>By carefully considering these factors, you can select the most appropriate data structure for your specific problem and optimize the performance of your code.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=278a91c45613" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>