offcode 0.0.0-stage → 0.1.0

package/data/problems/single-threaded-cpu.json

@@ -0,0 +1 @@
+{"basic": false, "label": "202", "slug": "single-threaded-cpu", "id": 202, "title": "Single-Threaded CPU", "difficulty": "Medium", "category": "heap", "link": "https://leetcode.com/problems/single-threaded-cpu/", "examples": [{"input": "tasks = [[1,2],[2,4],[3,2],[4,1]]", "output": "[0,2,3,1]", "explanation": "The events go as follows: at time 1 task 0 is available, CPU processes it until time 3. At time 3 tasks 1 and 2 are available, CPU picks task 2 (shorter). At time 5 task 3 is available with tasks 1, CPU picks task 3 (shortest), then task 1."}, {"input": "tasks = [[7,10],[7,12],[7,5],[7,4],[7,2]]", "output": "[4,3,2,0,1]", "explanation": "All tasks are available at time 7. CPU picks them in order of processing time, breaking ties by index."}], "hints": ["Sort tasks by enqueue time, then simulate the CPU clock, pushing newly available tasks into a min-heap.", "The heap orders by (processingTime, index) so the CPU always picks the shortest available task.", "When the heap is empty, jump the clock forward to the next enqueue time."], "statement": "You receive `n` jobs numbered `0` through `n - 1`, packed as a 2D integer table `tasks` where `tasks[i] = [enqueueTimei, processingTimei]`: job `i` shows up at moment `enqueueTimei` and needs `processingTimei` units to finish.\n\nA single-thread processor handles at most one job at a time under these rules:\n\n- with nothing waiting while idle, it simply waits;\n- once idle with work waiting, it takes the waiting job with the briefest processing span, using the smaller label to break ties;\n- a begun job runs to completion with no pause;\n- finishing one job, it may begin the next immediately with no gap.\n\nList the labels in the sequence the processor handles them.\n\n**Constraints:**\n\n- `1 <= tasks.length <= 10^5`\n- `1 <= enqueueTimei, processingTimei <= 10^9`\n", "solution": "## Approach\n\nSort tasks by enqueue time while remembering original indices. Simulate the CPU clock: push every task whose enqueue time has arrived into a min-heap ordered by `(processingTime, index)`. When the heap is empty, jump the clock to the next enqueue time. Repeatedly pop the heap, advance the clock by the processing time, and record the index.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n log n) for sorting plus heap operations.\n- **Space Complexity:** O(n) for the sorted copy and heap.\n\n## Implementation\n\n```python\nfrom typing import List\nimport heapq\nclass Solution:\n    def getOrder(self, tasks: List[List[int]]) -> List[int]:\n        indexed = sorted([(t[0], t[1], i) for i, t in enumerate(tasks)])\n        heap = []\n        res, i, time = [], 0, 0\n        n = len(tasks)\n        while len(res) < n:\n            if not heap and time < indexed[i][0]:\n                time = indexed[i][0]\n            while i < n and indexed[i][0] <= time:\n                e, p, idx = indexed[i]\n                heapq.heappush(heap, (p, idx))\n                i += 1\n            p, idx = heapq.heappop(heap)\n            time += p\n            res.append(idx)\n        return res\n```\n", "starter": {"go": "package main\n\nfunc GetOrder(tasks [][]int) []int {\n    panic(\"TODO\")\n}", "python": "from typing import List\n\nclass Solution:\n    def getOrder(self, tasks: List[List[int]]) -> List[int]:\n        raise NotImplementedError\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    vector<int> getOrder(vector<vector<int>>& tasks) {\n        return {};\n    }\n};"}, "fn": "getOrder", "params": [{"name": "tasks", "type": "int_array_2d"}], "outputType": "int_array", "tests": [["[[1,2],[2,4],[3,2],[4,1]]"], ["[[7,10],[7,12],[7,5],[7,4],[7,2]]"], ["[[1,2]]"], ["[[5,2],[7,2],[6,4],[4,1]]"], ["[[1,1],[1,1],[1,1]]"], ["[[10,5],[1,2],[1,1]]"], ["[[1,3],[2,3],[3,3]]"], ["[[100,100],[100,1],[100,50]]"], ["[[1,10],[2,1],[3,1],[4,1],[5,1]]"], ["[[2,3],[1,2],[4,2]]"], ["[[1,5],[2,2],[3,1]]"], ["[[19,13],[16,9],[21,10],[32,25],[37,4],[49,24],[2,15],[38,41],[37,34],[33,6],[45,4],[18,18],[46,39],[12,24]]"], ["[[1,2],[2,4],[3,2],[4,1],[5,3],[6,2]]"], ["[[5,5],[5,4],[5,3],[5,2],[5,1]]"], ["@javascript:JSON.stringify(Array.from({length:2000},(_,i)=>[i+1,(i%10)+1]))"], ["[[1000000000,1000000000]]"], ["[[1,1],[2,1]]"], ["[[2,1],[1,1]]"], ["[[1,2],[1,2],[1,1]]"], ["[[1,4],[2,2],[2,2],[2,1]]"], ["[[5,1],[1,10],[2,1]]"], ["[[10,1],[20,1],[30,1]]"], ["[[3,5],[3,2],[3,8],[3,1]]"], ["[[1,100],[50,2],[51,1]]"], ["[[8,3],[2,6],[4,1],[9,2]]"], ["[[1000000000,1],[1,1000000000],[2,1]]"], ["[[6,4],[6,4],[5,5],[7,1]]"], ["[[1,7],[2,6],[3,5],[4,4],[5,3]]"], ["[[9,2],[9,1],[8,3],[20,1]]"], ["[[4,8],[1,2],[2,9],[3,1]]"]], "expected": [[0, 2, 3, 1], [4, 3, 2, 0, 1], [0], [3, 0, 1, 2], [0, 1, 2], [2, 1, 0], [0, 1, 2], [1, 2, 0], [0, 1, 2, 3, 4], [1, 0, 2], [0, 2, 1], [6, 1, 2, 9, 4, 10, 0, 11, 5, 13, 3, 8, 12, 7], [0, 2, 3, 5, 4, 1], [4, 3, 2, 1, 0], [0, 1, 2, 3, 10, 11, 12, 13, 20, 21, 22, 23, 30, 31, 32, 33, 40, 41, 42, 43, 50, 51, 52, 53, 60, 61, 62, 63, 70, 71, 72, 73, 80, 81, 82, 83, 90, 91, 92, 93, 100, 101, 102, 103, 110, 111, 112, 113, 120, 121, 122, 123, 130, 131, 132, 133, 140, 141, 142, 143, 150, 151, 152, 153, 160, 161, 162, 163, 170, 171, 172, 173, 180, 181, 182, 183, 190, 191, 192, 193, 200, 201, 202, 203, 210, 211, 212, 213, 220, 221, 222, 223, 230, 231, 232, 233, 240, 241, 242, 243, 250, 251, 252, 253, 260, 261, 262, 263, 270, 271, 272, 273, 280, 281, 282, 283, 290, 291, 292, 293, 300, 301, 302, 303, 310, 311, 312, 313, 320, 321, 322, 323, 330, 331, 332, 333, 340, 341, 342, 343, 350, 351, 352, 353, 360, 361, 362, 363, 370, 371, 372, 373, 380, 381, 382, 383, 390, 391, 392, 393, 400, 401, 402, 403, 410, 411, 412, 413, 420, 421, 422, 423, 430, 431, 432, 433, 440, 441, 442, 443, 450, 451, 452, 453, 460, 461, 462, 463, 470, 471, 472, 473, 480, 481, 482, 483, 490, 491, 492, 493, 500, 501, 502, 503, 510, 511, 512, 513, 520, 521, 522, 523, 530, 531, 532, 533, 540, 541, 542, 543, 550, 551, 552, 553, 560, 561, 562, 563, 570, 571, 572, 573, 580, 581, 582, 583, 590, 591, 592, 593, 600, 601, 602, 603, 610, 611, 612, 613, 620, 621, 622, 623, 630, 631, 632, 633, 640, 641, 642, 643, 650, 651, 652, 653, 660, 661, 662, 663, 670, 671, 672, 673, 680, 681, 682, 683, 690, 691, 692, 693, 700, 701, 702, 703, 710, 711, 712, 713, 720, 721, 722, 723, 730, 731, 732, 733, 740, 741, 742, 743, 750, 751, 752, 753, 760, 761, 762, 763, 770, 771, 772, 773, 780, 781, 782, 783, 790, 791, 792, 793, 800, 801, 802, 803, 810, 811, 812, 813, 820, 821, 822, 823, 830, 831, 832, 833, 840, 841, 842, 843, 850, 851, 852, 853, 860, 861, 862, 863, 870, 871, 872, 873, 880, 881, 882, 883, 890, 891, 892, 893, 900, 901, 902, 903, 910, 911, 912, 913, 920, 921, 922, 923, 930, 931, 932, 933, 940, 941, 942, 943, 950, 951, 952, 953, 960, 961, 962, 963, 970, 971, 972, 973, 980, 981, 982, 983, 990, 991, 992, 993, 1000, 1001, 1002, 1003, 1010, 1011, 1012, 1013, 1020, 1021, 1022, 1023, 1030, 1031, 1032, 1033, 1040, 1041, 1042, 1043, 1050, 1051, 1052, 1053, 1060, 1061, 1062, 1063, 1070, 1071, 1072, 1073, 1080, 1081, 1082, 1083, 1090, 1091, 1092, 1093, 1100, 1101, 1102, 1103, 1110, 1111, 1112, 1113, 1120, 1121, 1122, 1123, 1130, 1131, 1132, 1133, 1140, 1141, 1142, 1143, 1150, 1151, 1152, 1153, 1160, 1161, 1162, 1163, 1170, 1171, 1172, 1173, 1180, 1181, 1182, 1183, 1190, 1191, 1192, 1193, 1200, 1201, 1202, 1203, 1210, 1211, 1212, 1213, 1220, 1221, 1222, 1223, 1230, 1231, 1232, 1233, 1240, 1241, 1242, 1243, 1250, 1251, 1252, 1253, 1260, 1261, 1262, 1263, 1270, 1271, 1272, 1273, 1280, 1281, 1282, 1283, 1290, 1291, 1292, 1293, 1300, 1301, 1302, 1303, 1310, 1311, 1312, 1313, 1320, 1321, 1322, 1323, 1330, 1331, 1332, 1333, 1340, 1341, 1342, 1343, 1350, 1351, 1352, 1353, 1360, 1361, 1362, 1363, 1370, 1371, 1372, 1373, 1380, 1381, 1382, 1383, 1390, 1391, 1392, 1393, 1400, 1401, 1402, 1403, 1410, 1411, 1412, 1413, 1420, 1421, 1422, 1423, 1430, 1431, 1432, 1433, 1440, 1441, 1442, 1443, 1450, 1451, 1452, 1453, 1460, 1461, 1462, 1463, 1470, 1471, 1472, 1473, 1480, 1481, 1482, 1483, 1490, 1491, 1492, 1493, 1500, 1501, 1502, 1503, 1510, 1511, 1512, 1513, 1520, 1521, 1522, 1523, 1530, 1531, 1532, 1533, 1540, 1541, 1542, 1543, 1550, 1551, 1552, 1553, 1560, 1561, 1562, 1563, 1570, 1571, 1572, 1573, 1580, 1581, 1582, 1583, 1590, 1591, 1592, 1593, 1600, 1601, 1602, 1603, 1610, 1611, 1612, 1613, 1620, 1621, 1622, 1623, 1630, 1631, 1632, 1633, 1640, 1641, 1642, 1643, 1650, 1651, 1652, 1653, 1660, 1661, 1662, 1663, 1670, 1671, 1672, 1673, 1680, 1681, 1682, 1683, 1690, 1691, 1692, 1693, 1700, 1701, 1702, 1703, 1710, 1711, 1712, 1713, 1720, 1721, 1722, 1723, 1730, 1731, 1732, 1733, 1740, 1741, 1742, 1743, 1750, 1751, 1752, 1753, 1760, 1761, 1762, 1763, 1770, 1771, 1772, 1773, 1780, 1781, 1782, 1783, 1790, 1791, 1792, 1793, 1800, 1801, 1802, 1803, 1810, 1811, 1812, 1813, 1820, 1821, 1822, 1823, 1830, 1831, 1832, 1833, 1840, 1841, 1842, 1843, 1850, 1851, 1852, 1853, 1860, 1861, 1862, 1863, 1870, 1871, 1872, 1873, 1880, 1881, 1882, 1883, 1890, 1891, 1892, 1893, 1900, 1901, 1902, 1903, 1910, 1911, 1912, 1913, 1920, 1921, 1922, 1923, 1930, 1931, 1932, 1933, 1940, 1941, 1942, 1943, 1950, 1951, 1952, 1953, 1960, 1961, 1962, 1963, 1970, 1971, 1972, 1973, 1980, 1981, 1982, 1983, 1990, 1991, 1992, 1993, 4, 14, 24, 34, 44, 54, 64, 74, 84, 94, 104, 114, 124, 134, 144, 154, 164, 174, 184, 194, 204, 214, 224, 234, 244, 254, 264, 274, 284, 294, 304, 314, 324, 334, 344, 354, 364, 374, 384, 394, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 504, 514, 524, 534, 544, 554, 564, 574, 584, 594, 604, 614, 624, 634, 644, 654, 664, 674, 684, 694, 704, 714, 724, 734, 744, 754, 764, 774, 784, 794, 804, 814, 824, 834, 844, 854, 864, 874, 884, 894, 904, 914, 924, 934, 944, 954, 964, 974, 984, 994, 1004, 1014, 1024, 1034, 1044, 1054, 1064, 1074, 1084, 1094, 1104, 1114, 1124, 1134, 1144, 1154, 1164, 1174, 1184, 1194, 1204, 1214, 1224, 1234, 1244, 1254, 1264, 1274, 1284, 1294, 1304, 1314, 1324, 1334, 1344, 1354, 1364, 1374, 1384, 1394, 1404, 1414, 1424, 1434, 1444, 1454, 1464, 1474, 1484, 1494, 1504, 1514, 1524, 1534, 1544, 1554, 1564, 1574, 1584, 1594, 1604, 1614, 1624, 1634, 1644, 1654, 1664, 1674, 1684, 1694, 1704, 1714, 1724, 1734, 1744, 1754, 1764, 1774, 1784, 1794, 1804, 1814, 1824, 1834, 1844, 1854, 1864, 1874, 1884, 1894, 1904, 1914, 1924, 1934, 1944, 1954, 1964, 1974, 1984, 1994, 5, 15, 25, 35, 45, 55, 65, 75, 85, 95, 105, 115, 125, 135, 145, 155, 165, 175, 185, 195, 205, 215, 225, 235, 245, 255, 265, 275, 285, 295, 305, 315, 325, 335, 345, 355, 365, 375, 385, 395, 405, 415, 425, 435, 445, 455, 465, 475, 485, 495, 505, 515, 525, 535, 545, 555, 565, 575, 585, 595, 605, 615, 625, 635, 645, 655, 665, 675, 685, 695, 705, 715, 725, 735, 745, 755, 765, 775, 785, 795, 805, 815, 825, 835, 845, 855, 865, 875, 885, 895, 905, 915, 925, 935, 945, 955, 965, 975, 985, 995, 1005, 1015, 1025, 1035, 1045, 1055, 1065, 1075, 1085, 1095, 1105, 1115, 1125, 1135, 1145, 1155, 1165, 1175, 1185, 1195, 1205, 1215, 1225, 1235, 1245, 1255, 1265, 1275, 1285, 1295, 1305, 1315, 1325, 1335, 1345, 1355, 1365, 1375, 1385, 1395, 1405, 1415, 1425, 1435, 1445, 1455, 1465, 1475, 1485, 1495, 1505, 1515, 1525, 1535, 1545, 1555, 1565, 1575, 1585, 1595, 1605, 1615, 1625, 1635, 1645, 1655, 1665, 1675, 1685, 1695, 1705, 1715, 1725, 1735, 1745, 1755, 1765, 1775, 1785, 1795, 1805, 1815, 1825, 1835, 1845, 1855, 1865, 1875, 1885, 1895, 1905, 1915, 1925, 1935, 1945, 1955, 1965, 1975, 1985, 1995, 6, 16, 26, 36, 46, 56, 66, 76, 86, 96, 106, 116, 126, 136, 146, 156, 166, 176, 186, 196, 206, 216, 226, 236, 246, 256, 266, 276, 286, 296, 306, 316, 326, 336, 346, 356, 366, 376, 386, 396, 406, 416, 426, 436, 446, 456, 466, 476, 486, 496, 506, 516, 526, 536, 546, 556, 566, 576, 586, 596, 606, 616, 626, 636, 646, 656, 666, 676, 686, 696, 706, 716, 726, 736, 746, 756, 766, 776, 786, 796, 806, 816, 826, 836, 846, 856, 866, 876, 886, 896, 906, 916, 926, 936, 946, 956, 966, 976, 986, 996, 1006, 1016, 1026, 1036, 1046, 1056, 1066, 1076, 1086, 1096, 1106, 1116, 1126, 1136, 1146, 1156, 1166, 1176, 1186, 1196, 1206, 1216, 1226, 1236, 1246, 1256, 1266, 1276, 1286, 1296, 1306, 1316, 1326, 1336, 1346, 1356, 1366, 1376, 1386, 1396, 1406, 1416, 1426, 1436, 1446, 1456, 1466, 1476, 1486, 1496, 1506, 1516, 1526, 1536, 1546, 1556, 1566, 1576, 1586, 1596, 1606, 1616, 1626, 1636, 1646, 1656, 1666, 1676, 1686, 1696, 1706, 1716, 1726, 1736, 1746, 1756, 1766, 1776, 1786, 1796, 1806, 1816, 1826, 1836, 1846, 1856, 1866, 1876, 1886, 1896, 1906, 1916, 1926, 1936, 1946, 1956, 1966, 1976, 1986, 1996, 7, 17, 27, 37, 47, 57, 67, 77, 87, 97, 107, 117, 127, 137, 147, 157, 167, 177, 187, 197, 207, 217, 227, 237, 247, 257, 267, 277, 287, 297, 307, 317, 327, 337, 347, 357, 367, 377, 387, 397, 407, 417, 427, 437, 447, 457, 467, 477, 487, 497, 507, 517, 527, 537, 547, 557, 567, 577, 587, 597, 607, 617, 627, 637, 647, 657, 667, 677, 687, 697, 707, 717, 727, 737, 747, 757, 767, 777, 787, 797, 807, 817, 827, 837, 847, 857, 867, 877, 887, 897, 907, 917, 927, 937, 947, 957, 967, 977, 987, 997, 1007, 1017, 1027, 1037, 1047, 1057, 1067, 1077, 1087, 1097, 1107, 1117, 1127, 1137, 1147, 1157, 1167, 1177, 1187, 1197, 1207, 1217, 1227, 1237, 1247, 1257, 1267, 1277, 1287, 1297, 1307, 1317, 1327, 1337, 1347, 1357, 1367, 1377, 1387, 1397, 1407, 1417, 1427, 1437, 1447, 1457, 1467, 1477, 1487, 1497, 1507, 1517, 1527, 1537, 1547, 1557, 1567, 1577, 1587, 1597, 1607, 1617, 1627, 1637, 1647, 1657, 1667, 1677, 1687, 1697, 1707, 1717, 1727, 1737, 1747, 1757, 1767, 1777, 1787, 1797, 1807, 1817, 1827, 1837, 1847, 1857, 1867, 1877, 1887, 1897, 1907, 1917, 1927, 1937, 1947, 1957, 1967, 1977, 1987, 1997, 8, 18, 28, 38, 48, 58, 68, 78, 88, 98, 108, 118, 128, 138, 148, 158, 168, 178, 188, 198, 208, 218, 228, 238, 248, 258, 268, 278, 288, 298, 308, 318, 328, 338, 348, 358, 368, 378, 388, 398, 408, 418, 428, 438, 448, 458, 468, 478, 488, 498, 508, 518, 528, 538, 548, 558, 568, 578, 588, 598, 608, 618, 628, 638, 648, 658, 668, 678, 688, 698, 708, 718, 728, 738, 748, 758, 768, 778, 788, 798, 808, 818, 828, 838, 848, 858, 868, 878, 888, 898, 908, 918, 928, 938, 948, 958, 968, 978, 988, 998, 1008, 1018, 1028, 1038, 1048, 1058, 1068, 1078, 1088, 1098, 1108, 1118, 1128, 1138, 1148, 1158, 1168, 1178, 1188, 1198, 1208, 1218, 1228, 1238, 1248, 1258, 1268, 1278, 1288, 1298, 1308, 1318, 1328, 1338, 1348, 1358, 1368, 1378, 1388, 1398, 1408, 1418, 1428, 1438, 1448, 1458, 1468, 1478, 1488, 1498, 1508, 1518, 1528, 1538, 1548, 1558, 1568, 1578, 1588, 1598, 1608, 1618, 1628, 1638, 1648, 1658, 1668, 1678, 1688, 1698, 1708, 1718, 1728, 1738, 1748, 1758, 1768, 1778, 1788, 1798, 1808, 1818, 1828, 1838, 1848, 1858, 1868, 1878, 1888, 1898, 1908, 1918, 1928, 1938, 1948, 1958, 1968, 1978, 1988, 1998, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 109, 119, 129, 139, 149, 159, 169, 179, 189, 199, 209, 219, 229, 239, 249, 259, 269, 279, 289, 299, 309, 319, 329, 339, 349, 359, 369, 379, 389, 399, 409, 419, 429, 439, 449, 459, 469, 479, 489, 499, 509, 519, 529, 539, 549, 559, 569, 579, 589, 599, 609, 619, 629, 639, 649, 659, 669, 679, 689, 699, 709, 719, 729, 739, 749, 759, 769, 779, 789, 799, 809, 819, 829, 839, 849, 859, 869, 879, 889, 899, 909, 919, 929, 939, 949, 959, 969, 979, 989, 999, 1009, 1019, 1029, 1039, 1049, 1059, 1069, 1079, 1089, 1099, 1109, 1119, 1129, 1139, 1149, 1159, 1169, 1179, 1189, 1199, 1209, 1219, 1229, 1239, 1249, 1259, 1269, 1279, 1289, 1299, 1309, 1319, 1329, 1339, 1349, 1359, 1369, 1379, 1389, 1399, 1409, 1419, 1429, 1439, 1449, 1459, 1469, 1479, 1489, 1499, 1509, 1519, 1529, 1539, 1549, 1559, 1569, 1579, 1589, 1599, 1609, 1619, 1629, 1639, 1649, 1659, 1669, 1679, 1689, 1699, 1709, 1719, 1729, 1739, 1749, 1759, 1769, 1779, 1789, 1799, 1809, 1819, 1829, 1839, 1849, 1859, 1869, 1879, 1889, 1899, 1909, 1919, 1929, 1939, 1949, 1959, 1969, 1979, 1989, 1999], [0], [0, 1], [1, 0], [2, 0, 1], [0, 3, 1, 2], [1, 0, 2], [0, 1, 2], [3, 1, 0, 2], [0, 2, 1], [1, 2, 3, 0], [1, 0, 2], [2, 3, 0, 1], [0, 4, 3, 2, 1], [2, 1, 0, 3], [1, 3, 0, 2]], "loose": false}

package/data/problems/sliding-puzzle.json

@@ -0,0 +1 @@
+{"basic": false, "label": "773", "slug": "sliding-puzzle", "id": 773, "title": "Sliding Puzzle", "difficulty": "Hard", "category": "matrix", "link": "https://leetcode.com/problems/sliding-puzzle/", "examples": [{"input": "board = [[1,2,3],[4,0,5]]", "output": "1", "explanation": "One slide of 5 finishes the board."}, {"input": "board = [[1,2,3],[5,4,0]]", "output": "-1", "explanation": "This start is unsolvable."}, {"input": "board = [[4,1,2],[5,0,3]]", "output": "5", "explanation": "Five swaps along a shortest path."}], "hints": ["Flatten the board to a 6-character string and precompute where the empty slot can move (neighbors in the 2x3 layout).", "Run breadth-first search from the start string to 123450, tracking visited states and distance.", "Return the distance when the target is dequeued, or -1 when the queue empties."], "statement": "You are given a `2 x 3` board holding the tiles `1` through `5` plus one empty cell marked `0`. In a single move you may slide a tile that neighbors the empty cell horizontally or vertically into it (swapping `0` with an adjacent number).\n\nThe solved layout is `[[1,2,3],[4,5,0]]`. Starting from the given `board`, return the fewest moves that reach the solved layout, or `-1` when it cannot be reached.\n\n**Constraints:**\n- `board.length == 2`, `board[i].length == 3`\n- `0 <= board[i][j] <= 5`\n- Each value appears exactly once\n", "solution": "## Approach\n\nEncode the 2x3 board as a six-character string and list, for each empty-slot index, which positions it can swap with. Breadth-first search over these strings explores states in order of move count, starting from the input encoding and stopping at 123450. The first time the target leaves the queue its distance is optimal; exhausting the queue means it is unreachable.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(S) where S is at most 720 states (6 permutations), each expanding to at most 3 neighbors.\n- **Space Complexity:** O(S) for the queue and visited set.\n\n## Implementation\n\n```python\nfrom typing import List\nfrom collections import deque\nclass Solution:\n    def slidingPuzzle(self, board: List[List[int]]) -> int:\n        start = \"\".join(str(board[r][c]) for r in range(2) for c in range(3))\n        target = \"123450\"\n        if start == target:\n            return 0\n        nbr = {0: (1, 3), 1: (0, 2, 4), 2: (1, 5), 3: (0, 4), 4: (1, 3, 5), 5: (2, 4)}\n        q = deque([start])\n        seen = {start}\n        dist = 0\n        while q:\n            for _ in range(len(q)):\n                cur = q.popleft()\n                if cur == target:\n                    return dist\n                z = cur.index('0')\n                for nb in nbr[z]:\n                    a = list(cur)\n                    a[z], a[nb] = a[nb], a[z]\n                    nxt = \"\".join(a)\n                    if nxt not in seen:\n                        seen.add(nxt)\n                        q.append(nxt)\n            dist += 1\n        return -1\n```\n", "starter": {"go": "package main\n\nfunc SlidingPuzzle(board [][]int) int {\n    return -1\n}", "python": "from typing import List\nclass Solution:\n    def slidingPuzzle(self, board: List[List[int]]) -> int:\n        pass\n", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    int slidingPuzzle(vector<vector<int>>& board) {\n        return -1;\n    }\n};"}, "fn": "slidingPuzzle", "params": [{"name": "board", "type": "int_array_2d"}], "outputType": "int", "tests": [["[[1,2,3],[4,0,5]]"], ["[[1,2,3],[5,4,0]]"], ["[[4,1,2],[5,0,3]]"], ["[[1,2,3],[4,5,0]]"], ["[[0,1,2],[3,4,5]]"], ["[[1,0,3],[4,2,5]]"], ["[[3,2,4],[1,5,0]]"], ["[[1,2,0],[4,5,3]]"], ["[[4,3,2],[5,1,0]]"], ["[[2,1,3],[4,5,0]]"], ["[[1,5,2],[4,3,0]]"], ["[[0,2,3],[1,4,5]]"], ["[[5,4,3],[2,1,0]]"], ["[[1,2,3],[0,4,5]]"], ["[[2,3,5],[1,0,4]]"], ["[[3,1,2],[0,4,5]]"], ["[[4,5,0],[1,2,3]]"], ["[[0,4,1],[3,5,2]]"], ["[[1,3,0],[4,2,5]]"], ["[[2,0,3],[1,4,5]]"], ["[[5,1,3],[4,0,2]]"], ["[[3,0,2],[1,4,5]]"], ["[[1,4,2],[5,3,0]]"], ["[[0,5,4],[3,2,1]]"], ["[[2,4,3],[1,5,0]]"], ["[[4,0,5],[1,2,3]]"], ["[[3,1,0],[5,4,2]]"], ["[[1,0,2],[5,4,3]]"]], "expected": [1, -1, 5, 0, 15, 2, 14, 1, -1, -1, 4, 3, 14, 2, 7, 16, 21, -1, 3, 4, 15, -1, -1, 15, 6, 20, -1, -1], "loose": false}