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: billstam12 vs. “Counting Point Mutations”, just now
Problems: 285 (total), users: 59822, attempts: 998470, correct: 559111
ID Title Solved By Correct Ratio
FIBO Fibonacci Numbers 3937
BINS Binary Search 1873
DEG Degree Array 1526
INS Insertion Sort 1604
DDEG Double-Degree Array 1214
MAJ Majority Element 1240
MER Merge Two Sorted Arrays 1300
2SUM 2SUM 864
BFS Breadth-First Search 722
CC Connected Components 702
HEA Building a Heap 566
MS Merge Sort 878
PAR 2-Way Partition 666
3SUM 3SUM 507
BIP Testing Bipartiteness 410
DAG Testing Acyclicity 404
DIJ Dijkstra's Algorithm 388
HS Heap Sort 459
INV Counting Inversions 493
PAR3 3-Way Partition 534
SQ Square in a Graph 286
BF Bellman-Ford Algorithm 296
CTE Shortest Cycle Through a Given Edge 210
MED Median 442
PS Partial Sort 386
TS Topological Sorting 320
HDAG Hamiltonian Path in DAG 219
NWC Negative Weight Cycle 233
QS Quick Sort 394
SCC Strongly Connected Components 229
2SAT 2-Satisfiability 131
GS General Sink 179
SC Semi-Connected Graph 173
SDAG Shortest Paths in DAG 190