Rosalind — Algorithmic Heights

The Algorithmic Heights track: sorting, heaps, graph search and shortest paths, written in BioLang rather than called from a builtin. See the problem list.

34 problems — 34 solved, 0 partial. 34 carry assertions that run on every commit; 0 need a network connection and are checked separately. Press Run on any block to execute it in your browser, or open the whole pack in the workbench.

Take it with you: download this page as a notebook (.bln — run it with bl notebook, or export it to HTML, PDF or Jupyter), every problem as a zip, or grab a single problem with the Download .bl link in its section.

Sections

Or read every problem on a single page — heavier to load, but one place to scroll, search and print.

Every problem

Problem Title Status Section Runs in Checked
FIBO Fibonacci Numbers solved Recursion browser + CLI verified by bl test
BINS Binary Search solved Searching browser + CLI verified by bl test
DEG Degree Array solved Graphs browser + CLI verified by bl test
INS Insertion Sort solved Sorting browser + CLI verified by bl test
DDEG Double-Degree Array solved Graphs browser + CLI verified by bl test
MAJ Majority Element solved Arrays browser + CLI verified by bl test
MER Merge Two Sorted Arrays solved Sorting browser + CLI verified by bl test
2SUM 2SUM solved Arrays browser + CLI verified by bl test
BFS Breadth-First Search solved Graphs browser + CLI verified by bl test
CC Connected Components solved Graphs browser + CLI verified by bl test
HEA Building a Heap solved Heaps browser + CLI verified by bl test
MS Merge Sort solved Sorting browser + CLI verified by bl test
PAR 2-Way Partition solved Sorting browser + CLI verified by bl test
3SUM 3SUM solved Arrays browser + CLI verified by bl test
BIP Testing Bipartiteness solved Graphs browser + CLI verified by bl test
DAG Testing Acyclicity solved Graphs browser + CLI verified by bl test
DIJ Dijkstra's Algorithm solved Graphs browser + CLI verified by bl test
HS Heap Sort solved Sorting browser + CLI verified by bl test
INV Counting Inversions solved Sorting browser + CLI verified by bl test
PAR3 3-Way Partition solved Sorting browser + CLI verified by bl test
SQ Square in a Graph solved Graphs browser + CLI verified by bl test
BF Bellman-Ford Algorithm solved Graphs browser + CLI verified by bl test
CTE Shortest Cycle Through a Given Edge solved Graphs browser + CLI verified by bl test
MED Median solved Searching browser + CLI verified by bl test
PS Partial Sort solved Sorting browser + CLI verified by bl test
TS Topological Sorting solved Graphs browser + CLI verified by bl test
HDAG Hamiltonian Path in DAG solved Graphs browser + CLI verified by bl test
NWC Negative Weight Cycle solved Graphs browser + CLI verified by bl test
QS Quick Sort solved Sorting browser + CLI verified by bl test
SCC Strongly Connected Components solved Graphs browser + CLI verified by bl test
2SAT 2-Satisfiability solved Graphs browser + CLI verified by bl test
GS General Sink solved Graphs browser + CLI verified by bl test
SC Semi-Connected Graph solved Graphs browser + CLI verified by bl test
SDAG Shortest Paths in DAG solved Graphs browser + CLI verified by bl test