explore freely · learn deeply

What do you want to build today?

A working desk for software people. Tutorials, field notes, honest comparisons, and the occasional good piece of gear — from engineers who actually ship.

Latest from the desk

Fresh reads,
right now.

The most recent articles published on funDesk — AI engineering, deep dives, and field notes.

All articles
AI & Engineering

Build smarter,
not noisier.

All AI articles
Tech radar · what's moving

The industry,
without the noise.

We scan 1,200+ sources, kill the hype, and publish what actually matters. Pick a beat to follow.

All beats
Learning tracks · pick one, stick with it

Don't read randomly.
Follow a path.

Browse all tracks
Programming · languages & systems

Write code
you're proud of.

All languages
Data Structures & Algorithms

Master the
fundamentals.

All topics

Dynamic Programming - DP

Optimizes problem-solving through subproblem breakdown, storing solutions to enhance efficiency.

DSA

String

Strings are sequences of characters, fundamental in programming for text representation, manipulation, and processing.

DSA

Trie

A trie is a tree-like data structure for storing and retrieving dynamic sets, often used for efficient string matching.

DSA

Stack

A stack is a linear data structure that follows the Last In, First Out (LIFO) principle for storing and retrieving elem…

DSA

Recursion

Recursion is a programming technique where a function calls itself to solve smaller instances of a problem, aiding in i…

DSA

Queue

A queue is a linear data structure that follows the First In, First Out (FIFO) principle for storing and retrieving ele…

DSA

Linked List - LL

A linked list is a linear data structure where elements are connected via pointers, allowing dynamic memory allocation …

DSA

Graph

A graph is a versatile data structure consisting of nodes and edges, representing relationships between entities in a n…

DSA

Fundesk DSA Curated Problems List

List of top data structure and algorithmic problems commonly asked in technical interviews.

DSA

Binary Tree

Binary Tree: Tree data structure where each node has at most two children, left and right, facilitating efficient searc…

DSA

Binary Search Tree - BST

Binary Search Tree: Binary tree with the property that for each node, values in its left subtree are less, and in the r…

DSA

Arrays

Arrays: Ordered, fixed-size data structures storing elements of the same type, accessed by index, crucial for efficient…

DSA

Bit Manipulation

Master bitwise operators (AND, OR, XOR, NOT) to solve complex algorithmic problems with high performance and low memory.

DSA

Arrays & Hashing

Master array manipulation, two pointers, sliding window, and hash map techniques.

DSA

Trees & Graphs

Binary trees, BSTs, graph traversal, shortest paths, and topological sort.

DSA

Stacks & Queues

LIFO, FIFO, monotonic stacks, priority queues, and BFS patterns.

DSA

Recursion & Backtracking

Solve constraint satisfaction problems with systematic exploration.

DSA

Sorting & Searching

QuickSort, MergeSort, binary search variants, and search algorithms.

DSA
Developer gear · we actually use this

A short shelf
of good things.

Full gear guide
The funDesk Weekly

One email. Friday morning. Never spam.

Five links worth your time, a tool we tested this week, and one unreasonably specific tip. Join 38,000 engineers who read it.

No spam. Unsubscribe anytime. We don't sell your data.

Stay Ahead

Only insights that save you time or money. No fluff, ever.