LightNews — News, ranked by scholars

@hn100.bsky.social

Datastructures-JS – The JavaScript data structures project

Discussion

November 7, 2026 at 6:40 PM

Peanut the squirrel honor guard 🏳️‍⚧️🇵🇸🇺🇦

@lampsofgold.bsky.social

Ooh yes you’re right, LLMs are very good fit here imo. So here I would look a little bit at datastructures, databases, and alternative ways to store and organize your information (you can also ask the robot to explain these things at a basic level, or get resources from them) your goal is to

November 9, 2026 at 4:04 PM

HN

@hnws.bsky.social

Datastructures-JS – The JavaScript data structures project
comments · posted on 2026.11.07 at 11:07:52 (c=0, p=4)

November 7, 2026 at 6:40 PM

Nire Bryce

@nirebryce.breadthcharge.net

Algorithms, Datastructures, and Programming Design Patterns only actually makes sense taught as a history class and I'll die on this hill, teaching them as if they're timeless and flat means so much pathological reinvention of the wheel and axle

Nire Bryce @nirebryce.breadthcharge.net · 8d

while I'm out here having opinions I think a computer history curriculum would actually be a pretty neat track opposite computer science, and would produce equally ready and able devs but with a very different understanding of the metaphor stack and why things got the way they are

November 2, 2026 at 12:24 AM

Nire Bryce

@nirebryce.breadthcharge.net

like the algorithms and datastructures curriculum suffers the same issue as an Intro to Marxism class where if you're made to actually implement them there's no actual time to teach you why it's important even tho it's built into every stdlib now

November 2, 2026 at 3:51 AM

Xojo

@xojo.com

Sort an ID array on its own, and the names in a parallel array may no longer match. Use SortWith to rearrange both arrays together, with unique IDs as the base.

https://documentation.xojo.com/api/language/arrays.html#arrays-sortwith

#Programming #DataStructures #CodingTips

November 3, 2026 at 3:16 PM

ePrint Updates

@eprint.ing.bot

An Algebraic Polynomial Evaluation Datastructure for Fields of Large Characteristic (Hiroki Okada, Rachel Player, Simon Pohmann) ia.cr/2026/2668

Abstract. In this work, we study (multivariate) polynomial evaluation datastructures, i.e. algorithms that can evaluate a multivariate polynomial at any input point, using random access to some precomputed encoding of the polynomial. Multiple constructions have been proposed in the literature, with the work by Bhargava, Ghosh, Guo, Kumar and Umans (2024) achieving optimal datastructure size and query complexity, up to polynomial factors. For n ∈ d^(o(1)) this is equivalent to having datastructure size d^(n + o(n))(dnlog q)^(O(1)) and query complexity (dnlog q)^(O(1)) for an n-variate polynomial of total degree d over 𝔽_(q). However, the algorithm of Bhargava et al. is not algebraic, since it requires lifting prime field elements to ℤ. An algebraic algorithm would be desirable, as an algebraic model of computation is natural for studying polynomial evaluation and is the standard model in algebraic complexity theory.

One approach to finding algebraic polynomial evaluation datastructures is to use univariate polynomial interpolation to reconstruct the polynomial along algebraic curves. This approach was first made explicit by Bhargava, Ghosh, Kumar and Mohapatra (2023), who used it to build an essentially optimal algebraic polynomial evaluation datastructure for fields of small characteristic p = char(𝔽_(q)) ∈ d^(o(1)). Over these fields, their construction refutes a previous conjecture by Miltersen. For fields of larger characteristic, it remains an open problem to find an algebraic algorithm with optimal datastructure size and query complexity.

In this work, we propose a new way to construct algebraic curves over prime fields that allow polynomial interpolation: by deriving curves from the base-β representation of (lifts of) prime field elements, we are able to recursively reduce the evaluation problem to points in boxes of decreasing size. This leads to a datastructure whose performance scales much more favourably with p. Concretely, we improve the dependency of the query complexity on p from p^(O(1)) to d^(2log₂ln ln p)ln p, and completely remove the dependency on p from the datastructure size. Its query complexity is still slightly super-polynomial in dlog p. Nevertheless, a variant of our results is enough to disprove Miltersen’s conjecture for all finite fields, including prime fields.

We further show that for a certain class of datastructures, which captures natural generalizations of our approach, the query complexity is lower-bounded by d^((1 − o(1))log₃ln ln p). Consequently, within this class, our construction is optimal up to a constant in the exponent.

November 9, 2026 at 2:07 AM

Moises Gamio

@codersite.bsky.social

Why does a binary search tree get slow after you insert sorted data? Insert, search, delete and traversal in Java, and when TreeMap is the better choice.

#Java #DataStructures

Binary Search Tree in Java: Insert, Search, Delete and Traversal (with GTIN Example)

Build a binary search tree in Java with a real product lookup by GTIN: insert, search, delete, in-order traversal, why unbalanced trees get slow, and when to use TreeMap instead.

codersite.dev

November 9, 2026 at 7:58 AM

Silver Wings of Morning

@shatterling.bsky.social

I meant system and business logic documentation. System does XYZ, where an integral part is to always ensure that condition ABC is true for the core datastructures. We use Opus 5.5 and it regularly is not able to capture critical things from just code without being told. Or does that also hinder?

October 31, 2026 at 11:29 PM

GolangOSS

@golangoss.bsky.social

go-datastructures (⭐️ 7961)

A collection of useful, performant, and threadsafe Go datastructures.

#go

October 30, 2026 at 5:02 AM

GolangOSS

@golangoss.bsky.social

go-datastructures (⭐️ 7961)

A collection of useful, performant, and threadsafe Go datastructures.

#go

October 30, 2026 at 5:02 AM

Moises Gamio

@codersite.bsky.social

A sorted array searches fast but inserts slowly. A linked list inserts fast but searches slowly. A balanced binary search tree does both in O(log n). Build one in Java.

#Java #DataStructures

Binary Search Tree in Java: Insert, Search, Delete and Traversal (with GTIN Example)

Build a binary search tree in Java with a real product lookup by GTIN: insert, search, delete, in-order traversal, why unbalanced trees get slow, and when to use TreeMap instead.

codersite.dev

November 3, 2026 at 12:02 AM

Moises Gamio

@codersite.bsky.social

Arrays, strings, linked lists, recursion, sorting, stacks, hash tables, trees, graphs: 10 chapters, 48 real interview questions, all in Java.

#CodingInterview #DataStructures

Arrays, strings, linked lists, recursion, sorting, stacks, hash tables, trees, graphs: 10 chapters,

www.amazon.com

October 31, 2026 at 3:19 PM

Dr. Ganapathi Pulipaka

@gp-pulipaka.bsky.social

Data Structures and Algorithms in Python. #BigData #Analytics #DataScience #AI #MachineLearning #IoT #IIoT #RStats #TensorFlow #Java #JavaScript #ReactJS #CloudComputing #Serverless #DataScientist #Linux #Books #Programming #Coding #100DaysofCode
geni.us/Datastructures

October 25, 2026 at 3:26 PM

GolangOSS

@golangoss.bsky.social

go-datastructures (⭐️ 7963)

A collection of useful, performant, and threadsafe Go datastructures.

#go

October 25, 2026 at 1:24 AM

Moises Gamio

@codersite.bsky.social

A list where you needed a map turns a millisecond lookup into a full scan. Which Java data structure to use and why, with a Big-O cheat sheet.

#Java #DataStructures

Java Data Structures: Which One to Use and Why (with a Big-O Cheat Sheet)

Arrays, ArrayList, LinkedList, HashMap, TreeMap, stacks and queues in Java: what each one is good at, a Big-O cheat sheet, and the mistakes that cost performance.

codersite.dev

October 24, 2026 at 2:32 PM

abu-bakar05.bsky.social

@abu-bakar05.bsky.social

Mastering Trie representations, B-Trees, and memory-efficient data layouts for ultra-low latency processing. Galgotias University grounds engineers in the deep DSA concepts that power high-performance software systems! ⚡💻
#GalgotiasUniversity #DataStructures #DSA #SoftwareEngineering

October 21, 2026 at 5:56 PM