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: SnowEagle vs. “Finding a Motif in DNA”, just now
Problems: 285 (total), users: 46032, attempts: 781871, correct: 441565
ID Title Solved By Correct Ratio
FIBO Fibonacci Numbers 3040
BINS Binary Search 1467
DEG Degree Array 1201
INS Insertion Sort 1275
DDEG Double-Degree Array 968
MAJ Majority Element 993
MER Merge Two Sorted Arrays 1038
2SUM 2SUM 700
BFS Breadth-First Search 573
CC Connected Components 567
HEA Building a Heap 459
MS Merge Sort 707
PAR 2-Way Partition 532
3SUM 3SUM 408
BIP Testing Bipartiteness 344
DAG Testing Acyclicity 333
DIJ Dijkstra's Algorithm 316
HS Heap Sort 374
INV Counting Inversions 395
PAR3 3-Way Partition 428
SQ Square in a Graph 236
BF Bellman-Ford Algorithm 243
CTE Shortest Cycle Through a Given Edge 175
MED Median 361
PS Partial Sort 308
TS Topological Sorting 268
HDAG Hamiltonian Path in DAG 184
NWC Negative Weight Cycle 191
QS Quick Sort 322
SCC Strongly Connected Components 196
2SAT 2-Satisfiability 110
GS General Sink 152
SC Semi-Connected Graph 146
SDAG Shortest Paths in DAG 159