Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.

Last win: diggi55 vs. “Counting DNA Nucleotides”, 8 minutes ago
Problems: 285 (total), users: 86244, attempts: 1431765, correct: 792542
ID Title Solved By Correct Ratio
FIBO Fibonacci Numbers 5435
BINS Binary Search 2487
DEG Degree Array 2014
INS Insertion Sort 2120
DDEG Double-Degree Array 1586
MAJ Majority Element 1654
MER Merge Two Sorted Arrays 1731
2SUM 2SUM 1133
BFS Breadth-First Search 915
CC Connected Components 899
HEA Building a Heap 691
MS Merge Sort 1173
PAR 2-Way Partition 870
3SUM 3SUM 677
BIP Testing Bipartiteness 503
DAG Testing Acyclicity 520
DIJ Dijkstra's Algorithm 511
HS Heap Sort 561
INV Counting Inversions 655
PAR3 3-Way Partition 715
SQ Square in a Graph 363
BF Bellman-Ford Algorithm 383
CTE Shortest Cycle Through a Given Edge 285
MED Median 597
PS Partial Sort 480
TS Topological Sorting 418
HDAG Hamiltonian Path in DAG 288
NWC Negative Weight Cycle 299
QS Quick Sort 499
SCC Strongly Connected Components 295
2SAT 2-Satisfiability 169
GS General Sink 228
SC Semi-Connected Graph 224
SDAG Shortest Paths in DAG 248