Algorithms for Competitive Programming
Algorithms for Competitive Programming은 경쟁 프로그래밍 분야에서 널리 사용되는 다양한 알고리즘과 자료구조를 설명하는 오픈 소스 프로젝트입니다. 이 프로젝트는 원본 러시아어 자료를 번역하고 확장하여 무료로 제공하며, 사용자 기여와 후원을 통해 지속적으로 성장하고 있습니다. 최근에는 사이트 디자인 개선, 새로운 알고리즘 추가, 자동 RSS 피드 도입 등 다양한 업데이트가 이루어졌습니다. GitHub에서 소스 코드를 관리하며, 커뮤니티 중심으로 운영되는 점이 특징입니다.

https://cp-algorithms.com/index.html

#algorithms #competitiveprogramming #opensource #datastructures

Main Page - Algorithms for Competitive Programming

The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.

The Interactive Handbook on Data Structures and Algorithms by @ElijahYilma

https://cartesian.app/

#algorithms #DataStructures #interactive

The Interactive Handbook on Data Structures and Algorithms

Discover a unique, interactive way to master data structures and algorithms with rich visualizations, step-by-step code execution, hands-on problems, and an embedded Python coding environment—all in one immersive book.

Learn everything you need to know about Data Structures via these 123 free HackerNoon blog posts. https://hackernoon.com/123-blog-posts-to-learn-about-data-structures #datastructures
123 Blog Posts To Learn About Data Structures | HackerNoon

Learn everything you need to know about Data Structures via these 123 free HackerNoon blog posts.

When it comes to high-performance systems, traditional balanced binary search trees can hit a wall with concurrency due to rebalancing locks. Enter skiplists: a probabilistic data structure offering efficient O(log n) operations, even outperforming trees in multi-threaded environments. Learn how they simplify parallelization challenges and why they're crucial for databases like CockroachDB.

https://www.tpp.blog/1al0tx0

#technology #skiplists #datastructures

🤖 This post was AI-generated.

Fast and Easy Levenshtein distance using a Trie

<img src="http://stevehanov.ca/blog/images/acer.jpg"/> If you have a web site with a search function, you will rapidly realize that most mortals are terrible typists. Many searches contain mispelled words, and users will expect these searches to magically work. This magic is often done using levenshtein distance. In this article, I'll compare two ways of finding the closest matching word in a large dictionary. I'll describe how I use it on rhymebrain.com

Steve Hanov's Blog
Oh, joy! Another riveting tale of data structures everyone and their grandma has been clamoring to read since 2013. 🥱🔍 Let's dissect these 'practically O(1) appends' like it's the latest episode of 'Keeping Up with the Clojureians'—because who doesn't want a nail-biting cliffhanger to the next blog post on vectors? 💡😂
https://hypirion.com/musings/understanding-persistent-vector-pt-1 #dataStructures #Clojure #humor #techTrends #blogPost #vectors #HackerNews #ngated
Understanding Clojure's Persistent Vectors, pt. 1

Ever wondered how Clojure's persistent vector actually works? This is part 1 of a blog series which aims to explain them.

Understanding Clojure's Persistent Vectors, pt. 1

Ever wondered how Clojure's persistent vector actually works? This is part 1 of a blog series which aims to explain them.

Clojure on Fennel part one: Persistent Data Structures

part two: immutable.fnl optimizations part three: parsing Somewhere in 2019 I started a project that aimed to bring some of Clojure features to Lua runtime - fennel-cljlib. It was a library for Fennel that implemented a basic subset of clojure.core namespace functions and macros.

Alright, future engineers!

A **Tree** is an undirected graph where any two vertices are connected by exactly one path (no cycles). Ex: A graph with N vertices & N-1 edges (no cycles) is a tree. Pro-Tip: Perfect for modeling hierarchical structures like file systems!

#GraphTheory #DataStructures #STEM #StudyNotes