# Algorithms and data structures Published articles for Algorithms and data structures. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## 10 Online Platforms for Practicing Python DevFeed: [10 Online Platforms for Practicing Python]() Original publisher: [Read original article]() Author: Lucilla Tomassi Published: 2025-05-13T08:40:57Z Content type: comparison Language: en Sources: [Backend Job: skill, salary and insights - Codemotion Magazine]() Topics: [Python](), [Programming](), [LeetCode](), [Algorithms](), [Data structures](), [Repl.it](), [HackerRank]() Tags: [algorithms](), [algorithms-and-data-structures](), [backend](), [frameworks](), [learning](), [programming](), [python](), [replit]() ### AI overview This comparison introduces ten online platforms for practicing Python, considering their advantages and drawbacks for learners and experienced developers. The supplied text highlights Replit for browser-based coding and collaboration, and LeetCode for algorithm and data-structure challenges and interview preparation. ### Source excerpt Learning and improving your Python skills is a never-ending journey. Whether you're a beginner taking your first steps into the world of programming or a senior developer looking to sharpen your expertise, practicing Python is essential for growing as a programmer. Luckily, in 2025, there are plenty of online platforms offering both basic exercises for... Read more The post Top 10 online platforms to practice Python every dev should know appeared first on Codemotion Magazine. ## 26 programming languages in 25 days, Part 2: Reflections on language design DevFeed: [26 programming languages in 25 days, Part 2: Reflections on language design]() Original publisher: [Read original article]() Published: 2022-12-31T19:36:56Z Content type: opinion Language: en Sources: [Matt Might]() Topics: [Programming language](), [Functional programming](), [Programming](), [Data structures](), [Advent of Code]() Tags: [advent-of-code](), [algorithms](), [algorithms-and-data-structures](), [functional](), [programming](), [programming-languages]() ### AI overview The author reflects on completing Advent of Code 2022 with 26 programming languages in 25 days. They found that functional techniques, algorithms, and data structures generally mattered more than language performance, while language design choices such as syntax, typing, and purity affected readability, debugging, and development speed in different puzzle contexts. ### Source excerpt I recently wrote about completing Advent of Code 2022 using a different programming language (or two) every day for 25 days. That note focused on the strategy, tactics and logistics involved in using 26 languages in 25 days without saying much about the languages or the experience itself. Using so many languages in such a short span provided insight into tradeoffs in language design. Here are my two high-level reflections from the experience: Good program design in the first part of each puzzle - especially more functional techniques and abstractions - tended to make the second part easier. So, in general, functional languages seemed to have the advantage in the puzzles. Using better algorithms and data structures was more important than having a "faster" programming language. There was never a time where rewriting in another language felt like the right way to get better performance. Read on for more specific reflections on language design. Click here to read the rest of the article ## Ideas and Solutions for Advent of Code 2021 in Kotlin -- Part 2/4 DevFeed: [Ideas and Solutions for Advent of Code 2021 in Kotlin -- Part 2/4]() Original publisher: [Read original article]() Author: Yev Kanivets Published: 2021-12-18T19:56:15Z Content type: tutorial Language: en Sources: [xorum.io - Medium]() Topics: [Advent of Code](), [Kotlin](), [Algorithms, Complexity](), [Data structures](), [Graphs]() Tags: [advent-of-code](), [algorithms](), [algorithms-and-data-structures](), [competetive-programming](), [data-structures](), [graph](), [kotlin]() ### AI overview This article presents ideas and partial solutions for Advent of Code 2021 tasks 7 through 9 in Kotlin. It discusses minimizing alignment cost for an array, decoding malfunctioning seven-segment displays, and locating low points and basins in a two-dimensional digit map using breadth-first or depth-first search. ### Source excerpt Ideas and Solutions for Advent of Code 2021 in Kotlin -- Part 2/4 The second week of Advent of Code introduces us to more difficult tasks, some of which require fundamental knowledge in algorithms and data structures. Do you need an idea or a tiny hint to get that gold star? Here we are, the second six tasks. What's special about this article? I won't be sharing the complete editorial, but the key idea only, so you can still solve the task by yourself. And if you need more guidance, there is a source code linked. Ideas and Solutions for tasks 1 to 6 can be found here. Day 7: The Treachery of Whales We are provided with an array of different values, which we need to align to a single value with the lowest possible cost. The cost function is different for the two sub-tasks. Here is the complete task. The solution is as simple as checking all possible values to align from min value to max value in the original array and choosing one with the lowest cost. The cost function (array of cost of moving value by 0, 1, 2 ... N) can be passed as an argument to your solution. Here is my solution. Day 8: Seven Segment Search Malfunctioning seven-segment digital display sends us some signals, which we need to decode knowing the representation of the full set of digits and which segments are used for each entry. Here is the complete task. The first sub-task requires you to parse only four digits -- 1, 4, 7, 8. All of them are unique in terms of segments used, so guessing them is relatively simple. The second sub-task asks you to guess the other 6 digits. I'm sure there are many different sequences in which you can guess them, but in my case, I've done the following: segments b and d are present in digit 4, but not in digit 1 segment bd is present only in digit 5 between all digits that use 5 segments then we can decode segments c and f by looking on the intersection of digits 1 and 5 using newly discovered segments, we find digits 3, 2, and 6 segment d can be found as an intersection o ## An overview of end-to-end entity resolution for big data DevFeed: [An overview of end-to-end entity resolution for big data]() Original publisher: [Read original article]() Author: adriancolyer Published: 2020-12-14T14:37:00Z Content type: article Language: en Sources: [Adrian Colyer]() Topics: [Entity resolution](), [big-data](), [data]() Tags: [algorithms-and-data-structures](), [article](), [big-data](), [blocking](), [clustering](), [comparisons](), [overview](), [uncategorized]() ### AI overview This article summarizes an ACM Computing Surveys survey on end-to-end entity resolution for big data. It explains the main pipeline stages: blocking to reduce comparisons, block processing to remove redundant and superfluous comparisons, matching entity-description pairs, and clustering matches into resolved entities. It also outlines classification dimensions including schema awareness, matching process, and batch or incremental processing. ### Source excerpt An overview of end-to-end entity resolution for big data, Christophides et al., ACM Computing Surveys, Dec. 2020, Article No. 127 The ACM Computing Surveys are always a great way to get a quick orientation in a new subject area, and hot off the press is this survey on the entity resolution (aka record linking) problem. It's an ... Continue reading An overview of end-to-end entity resolution for big data