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: serenkateford vs. “Counting DNA Nucleotides”, 8 minutes ago
Problems: 285 (total), users: 76307, attempts: 1256372, correct: 696798
ID Title Solved By Correct Ratio
FIBO Fibonacci Numbers 4845
BINS Binary Search 2240
DEG Degree Array 1816
INS Insertion Sort 1898
DDEG Double-Degree Array 1431
MAJ Majority Element 1478
MER Merge Two Sorted Arrays 1549
2SUM 2SUM 1008
BFS Breadth-First Search 840
CC Connected Components 820
HEA Building a Heap 639
MS Merge Sort 1045
PAR 2-Way Partition 777
3SUM 3SUM 601
BIP Testing Bipartiteness 469
DAG Testing Acyclicity 472
DIJ Dijkstra's Algorithm 464
HS Heap Sort 518
INV Counting Inversions 578
PAR3 3-Way Partition 632
SQ Square in a Graph 329
BF Bellman-Ford Algorithm 352
CTE Shortest Cycle Through a Given Edge 248
MED Median 523
PS Partial Sort 440
TS Topological Sorting 372
HDAG Hamiltonian Path in DAG 251
NWC Negative Weight Cycle 271
QS Quick Sort 449
SCC Strongly Connected Components 263
2SAT 2-Satisfiability 150
GS General Sink 204
SC Semi-Connected Graph 198
SDAG Shortest Paths in DAG 224