question_id stringlengths 64 64 | task stringclasses 7
values | mode stringclasses 3
values | question listlengths 1 1 | ground_truth stringlengths 1 347 | release_date timestamp[ms]date 2025-10-13 00:00:00 2025-10-13 00:00:00 | removal_date stringclasses 1
value |
|---|---|---|---|---|---|---|
25883fc49417aa40a24e26c812148bac505d98a5014825fc217cdf69952db6cc | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[95.6, 20.77, 82.84, 14.93, 51.28], [93.34, 14.5, 74.56, 13.94, 90.65], [32.25, 28.24, 60.59, 33.38, 67.86], [82.53, 33.82, 57.58, 75.33, 82.71], [13.59, 68.9, 84.17, 42.55, 95.69], [15.44, 24.98, 86.99, 60.04, 26.2]] | 2025-10-13T00:00:00 | |
2b5bff6312a04aa2afd1f6634fed387b4a084ab5f03f707bedc0bb9eb9ed6cac | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[12.86, 49.93, 60.15, 2.87, 14.79], [36.9, 51.14, 66.28, 27.53, 13.8], [59.16, 23.53, 80.22, 86.73, 12.88], [98.09, 20.45, 55.37, 48.36, 35.33], [78.8, 67.04, 51.24, 81.67, 54.91], [14.77, 67.34, 20.22, 90.14, 21.71], [46.71, 27.71, 8.31, 89.59, 42.99], [92.82, 7.04, 12.98, 94.83, 62.19], [3.31, 20.08, 34.57, 46.89, ... | 2025-10-13T00:00:00 | |
769dd56f3e4e7d5dfb5e9731dca346b3bc1276981774d376caaf92e215fa3345 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[25.08, 94.68, 18.93, 17.93, 34.99], [0.28, 54.15, 10.69, 25.8, 41.69], [23.05, 67.04, 11.51, 89.63, 85.81]] | 2025-10-13T00:00:00 | |
dd83240bcc72182324219d9778ff0319a7f6b7c1f2f374bb1004050c0021154d | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[86.48, 85.53, 81.1, 26.14, 7.72]] | 2025-10-13T00:00:00 | |
2ead077904f1c200b467e345bf934e74ae226fe1aac55aa8a2ced4cb06778222 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[83.1, 36.09, 70.27, 86.01, 64.13], [74.63, 6.36, 64.69, 73.61, 39.88], [50.72, 22.87, 65.02, 97.13, 29.87], [92.64, 75.28, 97.74, 75.97, 92.28], [54.84, 76.23, 71.63, 46.72, 57.25], [46.28, 89.16, 55.14, 42.15, 66.83], [34.44, 75.46, 16.44, 82.39, 73.23], [19.13, 18.4, 16.87, 81.89, 66.43]] | 2025-10-13T00:00:00 | |
bd8e3c56d0299590b051809fada7fcb699a57ae9b444a4e9ec36cd1515970786 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.27, 81.58, 34.44, 4.48, 57.16], [78.34, 36.15, 58.78, 24.85, 80.01], [88.92, 38.98, 23.17, 53.44, 94.47], [14.62, 71.88, 34.54, 45.7, 97.59], [33.1, 90.86, 46.73, 96.73, 76.42]] | 2025-10-13T00:00:00 | |
e44897775c92a24f2bdeba3437bf482dc429403efb19f1fde03434193f67b889 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[56.69, 43.07, 9.41, 34.81, 62.15], [98.5, 66.33, 16.36, 39.49, 27.8], [38.47, 76.94, 41.36, 67.93, 58.19], [18.48, 69.56, 15.5, 69.16, 95.86], [95.57, 29.93, 56.11, 40.74, 13.87], [7.65, 72.99, 67.4, 80.19, 14.89], [97.45, 86.77, 90.31, 96.19, 62.12]] | 2025-10-13T00:00:00 | |
b89a8d1a0b7907490c0f7499a287e2a4b9574ccf37750759a61da33d9e8eae64 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[84.51, 16.1, 55.77, 36.81, 21.49], [66.02, 51.46, 27.91, 62.99, 47.92], [38.58, 42.82, 61.13, 73.64, 1.53], [81.49, 40.12, 20.32, 35.83, 86.2], [65.33, 54.22, 12.12, 90.87, 1.72], [25.4, 60.41, 8.37, 99.78, 83.23], [16.49, 46.2, 56.7, 45.19, 91.98], [34.88, 99.11, 56.58, 23.68, 65.87], [3.68, 56.75, 60.93, 0.69, 17.... | 2025-10-13T00:00:00 | |
0c4432bfaef8583900feddc4c7d0e4d2b8ac72cde481d6c27992f54cfacc22d5 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[39.93, 71.74, 28.08, 8.27, 96.98], [12.63, 62.62, 78.71, 0.74, 92.1], [2.54, 73.8, 67.26, 62.52, 63.76], [13.06, 37.57, 55.07, 60.83, 54.94], [31.36, 73.62, 90.74, 88.86, 94.83], [38.77, 88.03, 39.66, 87.35, 32.99], [56.39, 64.43, 57.69, 47.54, 12.24]] | 2025-10-13T00:00:00 | |
ae57953f12c6a5d5e41300e541d4fbb389eb25ad7f84d7e4b2de150304cdd375 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[42.04, 92.59, 27.39, 6.0, 31.05], [71.82, 78.1, 53.87, 31.17, 91.63], [62.01, 43.3, 44.19, 64.6, 91.79], [92.81, 43.65, 40.97, 61.32, 71.36], [53.94, 46.19, 95.42, 36.84, 64.7], [54.35, 11.1, 16.76, 81.72, 52.27], [67.89, 45.39, 84.98, 85.2, 43.05], [4.8, 8.96, 76.15, 45.97, 77.72]] | 2025-10-13T00:00:00 | |
888a875317142d0bc3fbaf8b90a92ec47624c1be894e4afa8a94a4d88c3e2071 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[28.01, 46.11, 12.17, 52.26, 40.92], [14.48, 37.86, 25.92, 61.62, 69.46], [61.3, 46.74, 29.71, 91.84, 8.34], [46.79, 61.77, 55.1, 13.41, 70.24], [64.02, 27.05, 30.19, 7.33, 5.26], [80.75, 81.33, 0.5, 33.01, 8.91], [7.16, 9.9, 98.63, 69.41, 44.87]] | 2025-10-13T00:00:00 | |
c9393dd268c03e5a015ec4f4e874cc31cd512806a3bfa14d168146fca3b89655 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[78.11, 60.58, 70.98, 8.91, 63.07], [44.14, 65.61, 44.03, 0.03, 26.03], [19.72, 67.21, 99.27, 20.95, 85.39]] | 2025-10-13T00:00:00 | |
c000cdc41d39131aecf974c8c782ab4f0cd7a242aac0145a2459dd5f059f5756 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[36.63, 19.93, 8.86, 65.32, 45.93], [38.96, 18.73, 6.67, 51.22, 66.76], [60.75, 5.01, 47.73, 32.96, 21.65], [79.7, 42.09, 10.32, 36.91, 91.48]] | 2025-10-13T00:00:00 | |
67130a741943189918cdd2cc280e52a34d305807a9e54ddbc501a16158f84069 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.39, 64.15, 12.86, 11.37, 65.33], [41.52, 34.91, 6.39, 45.47, 30.15], [85.35, 20.18, 21.8, 71.66, 47.07], [38.91, 54.03, 68.36, 62.48, 74.27], [23.34, 16.01, 49.79, 74.54, 44.93], [1.28, 82.83, 25.33, 62.47, 76.44], [1.82, 65.43, 54.21, 85.13, 93.9], [68.13, 12.53, 97.17, 47.39, 82.68], [84.7, 94.06, 63.47, 85.92,... | 2025-10-13T00:00:00 | |
a74a6955b44dab176fc3222ca32da4f6ec814c184e4f39f2359fb4e417ecc549 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[33.03, 40.52, 57.47, 50.64, 56.42], [19.17, 26.49, 20.26, 80.29, 50.2], [64.26, 43.92, 71.58, 37.14, 5.42], [60.2, 4.11, 33.24, 37.83, 17.6], [71.57, 73.3, 8.21, 46.55, 45.52], [72.64, 18.86, 21.51, 14.57, 82.08], [71.22, 40.99, 94.3, 3.09, 80.29], [56.97, 87.41, 8.64, 74.25, 82.04], [91.49, 59.77, 30.74, 88.06, 32.... | 2025-10-13T00:00:00 | |
84e7673828ab6d5db4e946ac3a659fa6240620c693fddad4a8e0de9cb01cb720 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[16.07, 0.03, 21.66, 36.8, 0.2], [37.61, 13.79, 67.59, 55.74, 50.62], [54.17, 59.69, 78.99, 27.86, 41.36], [62.64, 60.53, 7.32, 29.98, 40.33], [19.31, 99.09, 78.69, 12.13, 22.58], [76.68, 91.68, 35.38, 78.57, 14.67]] | 2025-10-13T00:00:00 | |
748d1d28cb7563c7cee19d9f149ad97036cd5c32132f73d95643538bb8ead2f5 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[49.16, 23.44, 6.76, 71.29, 81.31], [54.83, 63.43, 16.92, 55.43, 17.58], [16.01, 70.21, 23.98, 61.38, 25.55], [50.66, 34.2, 96.24, 51.98, 20.24], [25.73, 55.04, 84.82, 33.72, 90.44], [24.03, 91.73, 72.9, 93.2, 95.07]] | 2025-10-13T00:00:00 | |
1132e0b401db21608f81917879b566abd6415b48639d9706e12283f897768307 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.77, 31.38, 12.12, 32.36, 93.12], [78.97, 1.0, 19.89, 29.31, 94.34], [64.71, 89.52, 2.93, 34.49, 77.04], [35.52, 75.36, 26.83, 78.94, 45.08], [40.34, 18.18, 86.04, 90.71, 30.17]] | 2025-10-13T00:00:00 | |
f909843c6c6e5265cfc0341b907b49b8d743179b37274055553a6d1a34524bf3 | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[85.18, 88.49, 76.57, 3.22, 5.02]] | 2025-10-13T00:00:00 | |
87b1f1d3a140986313ea8429b81dc7096faffafbf590070ec7b0ef98442feccf | geom_graph | CodeMaybe | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[5.0, 50.63, 51.92, 26.52, 12.92], [2.07, 39.38, 38.02, 2.35, 23.82]] | 2025-10-13T00:00:00 | |
26b9325bab9f641df425ce6cb30692c5a9382abb3cb18da1b656868ff691aaad | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[63.7, 26.98, 4.1, 1.65, 81.33], [68.84, 38.89, 13.51, 72.15, 52.54], [91.28, 60.66, 72.95, 54.36, 93.51], [38.37, 99.72, 98.08, 68.55, 65.05], [81.59, 0.27, 85.74, 3.36, 72.97], [31.02, 48.58, 88.95, 93.4, 35.78], [17.57, 86.32, 54.15, 29.97, 42.27], [2.83, 12.43, 67.06, 64.72, 61.54]] | 2025-10-13T00:00:00 | |
9c402a6544f426f0e05d4c28ae16b8c2d0c7a8d7ccd08a2d0b740b6fc7f79657 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[51.18, 95.05, 14.42, 94.86, 31.18], [75.35, 53.81, 32.97, 78.84, 30.32], [42.33, 82.77, 40.92, 54.96, 2.76], [51.61, 11.59, 62.35, 77.67, 61.3], [91.73, 3.96, 52.86, 45.93, 6.23], [75.04, 28.04, 48.52, 98.07, 96.17], [45.35, 13.4, 40.31, 20.35, 26.23]] | 2025-10-13T00:00:00 | |
46b0f240023059cb4f3ad22c43ac0a0e1f33a61733a6a6c0c181b7559907206e | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[26.16, 29.85, 81.42, 9.19, 60.01], [34.6, 51.11, 89.12, 77.56, 31.81], [56.23, 15.01, 43.26, 66.93, 42.28], [63.32, 96.74, 68.31, 39.16, 18.73], [72.86, 18.79, 5.51, 27.5, 65.74], [92.42, 47.09, 69.38, 10.72, 10.45]] | 2025-10-13T00:00:00 | |
1163c1e524eb89ab97a759f1eef63cab3729357e6a3f56e1b31f2626917ed233 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[8.56, 23.68, 80.13, 58.22, 9.41], [43.31, 47.91, 15.97, 73.46, 11.37], [39.12, 51.67, 43.06, 58.68, 73.78], [95.63, 28.42, 64.85, 69.62, 29.27], [0.15, 97.35, 29.84, 31.4, 89.17]] | 2025-10-13T00:00:00 | |
ec5c32c371da689d0daa360e09a39305f353c00636cdb71b9ff20ca8f236d878 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[94.31, 51.13, 97.62, 8.08, 60.74], [70.49, 94.28, 66.57, 13.34, 49.79], [92.98, 49.17, 67.58, 47.6, 21.7], [49.36, 50.02, 95.86, 34.99, 22.38], [36.97, 96.89, 92.9, 17.77, 60.89], [52.21, 64.12, 93.91, 58.2, 26.78]] | 2025-10-13T00:00:00 | |
52428999b961012dda7572eaea306bb0c3e9b73b4f4107054e54a9a1de1c9c80 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[80.5, 80.79, 51.53, 28.58, 5.39], [84.42, 39.24, 49.3, 67.67, 6.08], [32.49, 80.62, 31.65, 14.9, 69.85], [70.75, 0.12, 50.34, 43.67, 20.33], [87.01, 22.73, 89.54, 87.22, 1.85], [44.85, 79.89, 23.55, 31.98, 79.99], [38.34, 40.85, 4.53, 4.88, 99.92], [55.56, 27.15, 87.97, 6.42, 67.92]] | 2025-10-13T00:00:00 | |
249d17efa12ad5d71647cebc11ed20d6e5fcabbd022047facdac176e926f9fb4 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[53.82, 34.33, 36.91, 37.45, 98.74], [62.75, 12.23, 18.63, 49.73, 75.95], [58.68, 31.91, 41.81, 88.7, 45.41], [53.99, 10.69, 86.62, 13.97, 43.97], [31.2, 88.13, 6.55, 86.67, 82.78], [78.52, 4.81, 20.74, 84.99, 43.25], [63.28, 67.43, 33.0, 67.99, 12.3], [53.92, 97.05, 27.6, 89.48, 36.19], [5.17, 85.02, 0.89, 97.88, 82... | 2025-10-13T00:00:00 | |
91f187bbefc50db4015ed171b9a6d899c18ce44b46c0a73e793e86e7f880a4a2 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[62.51, 89.72, 77.57, 22.52, 30.02], [51.49, 46.62, 91.72, 62.92, 51.41], [55.35, 99.55, 79.27, 62.22, 98.9], [87.36, 0.53, 82.12, 79.71, 46.79], [30.3, 27.84, 25.49, 44.51, 50.45], [49.69, 24.75, 1.18, 19.24, 69.2], [20.06, 36.95, 0.37, 83.0, 15.45], [21.53, 16.02, 61.25, 4.39, 3.57]] | 2025-10-13T00:00:00 | |
e4a7f45c536205d5bba5602963107bb70f475681a5de8425cda1a5462f95eba6 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[32.7, 98.73, 31.87, 78.85, 86.99], [18.16, 39.47, 39.33, 61.67, 45.23], [42.3, 25.59, 59.09, 60.43, 64.69], [39.11, 43.79, 37.27, 10.7, 47.9], [36.58, 46.02, 71.9, 86.7, 5.18], [24.14, 25.71, 18.47, 19.39, 81.38], [60.73, 22.31, 13.4, 32.93, 9.61], [91.14, 15.02, 37.14, 28.46, 1.68]] | 2025-10-13T00:00:00 | |
919ef5674017edfd454a9ce15ac1e7a136fa70c91e76b80fdc267c29c83eaf1a | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[87.02, 28.68, 60.31, 77.75, 71.61], [78.46, 31.56, 70.53, 29.92, 74.07], [91.28, 70.82, 55.45, 92.32, 8.97], [48.49, 6.52, 0.56, 83.06, 98.33], [37.01, 60.59, 47.77, 79.29, 19.51], [91.54, 86.04, 91.82, 2.66, 43.72]] | 2025-10-13T00:00:00 | |
d95845ca50d151980239a0cbcab5e4db4c4358fd63e8c7b17a760a28f6bd47a7 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[95.6, 20.77, 82.84, 14.93, 51.28], [93.34, 14.5, 74.56, 13.94, 90.65], [32.25, 28.24, 60.59, 33.38, 67.86], [82.53, 33.82, 57.58, 75.33, 82.71], [13.59, 68.9, 84.17, 42.55, 95.69], [15.44, 24.98, 86.99, 60.04, 26.2]] | 2025-10-13T00:00:00 | |
232823b2a42742a78e8985623b32ba7b24a0fe6738af7272067560708d3d8777 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[12.86, 49.93, 60.15, 2.87, 14.79], [36.9, 51.14, 66.28, 27.53, 13.8], [59.16, 23.53, 80.22, 86.73, 12.88], [98.09, 20.45, 55.37, 48.36, 35.33], [78.8, 67.04, 51.24, 81.67, 54.91], [14.77, 67.34, 20.22, 90.14, 21.71], [46.71, 27.71, 8.31, 89.59, 42.99], [92.82, 7.04, 12.98, 94.83, 62.19], [3.31, 20.08, 34.57, 46.89, ... | 2025-10-13T00:00:00 | |
145ba9ed4117ec24c8486ab9935ba0c7d8610df53d2a96948ce324d1e04d5ce8 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[25.08, 94.68, 18.93, 17.93, 34.99], [0.28, 54.15, 10.69, 25.8, 41.69], [23.05, 67.04, 11.51, 89.63, 85.81]] | 2025-10-13T00:00:00 | |
3140f10d68d4c57bac12b51fa403f88388def2b468d530cc641defe91cfbcc3a | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[86.48, 85.53, 81.1, 26.14, 7.72]] | 2025-10-13T00:00:00 | |
b88f2dfb8e54741a4457e6a6f8181f54bf8c495869f100819de4621ce4ac58a4 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[83.1, 36.09, 70.27, 86.01, 64.13], [74.63, 6.36, 64.69, 73.61, 39.88], [50.72, 22.87, 65.02, 97.13, 29.87], [92.64, 75.28, 97.74, 75.97, 92.28], [54.84, 76.23, 71.63, 46.72, 57.25], [46.28, 89.16, 55.14, 42.15, 66.83], [34.44, 75.46, 16.44, 82.39, 73.23], [19.13, 18.4, 16.87, 81.89, 66.43]] | 2025-10-13T00:00:00 | |
fd0fcd1d9d70a33351191e755cee3f21e490dc4ba399c09afb90edc6bb3e2ea3 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.27, 81.58, 34.44, 4.48, 57.16], [78.34, 36.15, 58.78, 24.85, 80.01], [88.92, 38.98, 23.17, 53.44, 94.47], [14.62, 71.88, 34.54, 45.7, 97.59], [33.1, 90.86, 46.73, 96.73, 76.42]] | 2025-10-13T00:00:00 | |
5751d2d868c680b765b17452fc8c6e3d0f6460775b3a06a28bbe16fe08889132 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[56.69, 43.07, 9.41, 34.81, 62.15], [98.5, 66.33, 16.36, 39.49, 27.8], [38.47, 76.94, 41.36, 67.93, 58.19], [18.48, 69.56, 15.5, 69.16, 95.86], [95.57, 29.93, 56.11, 40.74, 13.87], [7.65, 72.99, 67.4, 80.19, 14.89], [97.45, 86.77, 90.31, 96.19, 62.12]] | 2025-10-13T00:00:00 | |
6d751c15bbb6c6fa3fed33d1979f9ab71726b2d00abace2fff601f549e7f8dbb | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[84.51, 16.1, 55.77, 36.81, 21.49], [66.02, 51.46, 27.91, 62.99, 47.92], [38.58, 42.82, 61.13, 73.64, 1.53], [81.49, 40.12, 20.32, 35.83, 86.2], [65.33, 54.22, 12.12, 90.87, 1.72], [25.4, 60.41, 8.37, 99.78, 83.23], [16.49, 46.2, 56.7, 45.19, 91.98], [34.88, 99.11, 56.58, 23.68, 65.87], [3.68, 56.75, 60.93, 0.69, 17.... | 2025-10-13T00:00:00 | |
3f14ea857e36ad826bde97db6648dc15c1a5dfd860f0f97820a018c91bd0c3ef | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[39.93, 71.74, 28.08, 8.27, 96.98], [12.63, 62.62, 78.71, 0.74, 92.1], [2.54, 73.8, 67.26, 62.52, 63.76], [13.06, 37.57, 55.07, 60.83, 54.94], [31.36, 73.62, 90.74, 88.86, 94.83], [38.77, 88.03, 39.66, 87.35, 32.99], [56.39, 64.43, 57.69, 47.54, 12.24]] | 2025-10-13T00:00:00 | |
9c0117ae9dd02f49f424f2ce05c7d22a9ae6acf64dff147b725c8a73b968bb39 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[42.04, 92.59, 27.39, 6.0, 31.05], [71.82, 78.1, 53.87, 31.17, 91.63], [62.01, 43.3, 44.19, 64.6, 91.79], [92.81, 43.65, 40.97, 61.32, 71.36], [53.94, 46.19, 95.42, 36.84, 64.7], [54.35, 11.1, 16.76, 81.72, 52.27], [67.89, 45.39, 84.98, 85.2, 43.05], [4.8, 8.96, 76.15, 45.97, 77.72]] | 2025-10-13T00:00:00 | |
91c43c5bf03fe4fb3a19c9f828645cc5c9080029a1035f23e86e3b5e80d360bc | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[28.01, 46.11, 12.17, 52.26, 40.92], [14.48, 37.86, 25.92, 61.62, 69.46], [61.3, 46.74, 29.71, 91.84, 8.34], [46.79, 61.77, 55.1, 13.41, 70.24], [64.02, 27.05, 30.19, 7.33, 5.26], [80.75, 81.33, 0.5, 33.01, 8.91], [7.16, 9.9, 98.63, 69.41, 44.87]] | 2025-10-13T00:00:00 | |
f98fd54e6245c1a2b1991d532878e365bd2de3c17d2f2b71a02567ea210135bc | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[78.11, 60.58, 70.98, 8.91, 63.07], [44.14, 65.61, 44.03, 0.03, 26.03], [19.72, 67.21, 99.27, 20.95, 85.39]] | 2025-10-13T00:00:00 | |
534ba975064ee7a103237eddc455d29706319caf516e869d10c78d246b8c94ce | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[36.63, 19.93, 8.86, 65.32, 45.93], [38.96, 18.73, 6.67, 51.22, 66.76], [60.75, 5.01, 47.73, 32.96, 21.65], [79.7, 42.09, 10.32, 36.91, 91.48]] | 2025-10-13T00:00:00 | |
6e17c214c51af14439d5232f8e3161a0b13aa58b7f19d73568204b34622704f8 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.39, 64.15, 12.86, 11.37, 65.33], [41.52, 34.91, 6.39, 45.47, 30.15], [85.35, 20.18, 21.8, 71.66, 47.07], [38.91, 54.03, 68.36, 62.48, 74.27], [23.34, 16.01, 49.79, 74.54, 44.93], [1.28, 82.83, 25.33, 62.47, 76.44], [1.82, 65.43, 54.21, 85.13, 93.9], [68.13, 12.53, 97.17, 47.39, 82.68], [84.7, 94.06, 63.47, 85.92,... | 2025-10-13T00:00:00 | |
f3b421dc33cd8d04af751bdc48e9c9a577395a4d7bb593097ba29483338a756c | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[33.03, 40.52, 57.47, 50.64, 56.42], [19.17, 26.49, 20.26, 80.29, 50.2], [64.26, 43.92, 71.58, 37.14, 5.42], [60.2, 4.11, 33.24, 37.83, 17.6], [71.57, 73.3, 8.21, 46.55, 45.52], [72.64, 18.86, 21.51, 14.57, 82.08], [71.22, 40.99, 94.3, 3.09, 80.29], [56.97, 87.41, 8.64, 74.25, 82.04], [91.49, 59.77, 30.74, 88.06, 32.... | 2025-10-13T00:00:00 | |
40bf31da65ad2689e2749931d37ebf2e1d45e7991769eed6424c98e84c02be58 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[16.07, 0.03, 21.66, 36.8, 0.2], [37.61, 13.79, 67.59, 55.74, 50.62], [54.17, 59.69, 78.99, 27.86, 41.36], [62.64, 60.53, 7.32, 29.98, 40.33], [19.31, 99.09, 78.69, 12.13, 22.58], [76.68, 91.68, 35.38, 78.57, 14.67]] | 2025-10-13T00:00:00 | |
e555b007baa14078920492c490159d5d513f8aa148bff49984528e981a7f2646 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[49.16, 23.44, 6.76, 71.29, 81.31], [54.83, 63.43, 16.92, 55.43, 17.58], [16.01, 70.21, 23.98, 61.38, 25.55], [50.66, 34.2, 96.24, 51.98, 20.24], [25.73, 55.04, 84.82, 33.72, 90.44], [24.03, 91.73, 72.9, 93.2, 95.07]] | 2025-10-13T00:00:00 | |
f4d430a95529ba8c6525ec60a17ce92fda9d8c4ccb5498eb33d428ba86d7e6df | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.77, 31.38, 12.12, 32.36, 93.12], [78.97, 1.0, 19.89, 29.31, 94.34], [64.71, 89.52, 2.93, 34.49, 77.04], [35.52, 75.36, 26.83, 78.94, 45.08], [40.34, 18.18, 86.04, 90.71, 30.17]] | 2025-10-13T00:00:00 | |
787edd641c155905f6c728d13295d1fcd605bd840a708439b834add4216d4de3 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[85.18, 88.49, 76.57, 3.22, 5.02]] | 2025-10-13T00:00:00 | |
a64a81f8519144a0b06458f1cbf4c7efcbb9ec92a39aacf941a3761a2074dd21 | geom_graph | CodeEnforce | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[5.0, 50.63, 51.92, 26.52, 12.92], [2.07, 39.38, 38.02, 2.35, 23.82]] | 2025-10-13T00:00:00 | |
b089aa420b53782c4982866d6a12326ede30c956c0722d394a97feaea66fda97 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[63.7, 26.98, 4.1, 1.65, 81.33], [68.84, 38.89, 13.51, 72.15, 52.54], [91.28, 60.66, 72.95, 54.36, 93.51], [38.37, 99.72, 98.08, 68.55, 65.05], [81.59, 0.27, 85.74, 3.36, 72.97], [31.02, 48.58, 88.95, 93.4, 35.78], [17.57, 86.32, 54.15, 29.97, 42.27], [2.83, 12.43, 67.06, 64.72, 61.54]] | 2025-10-13T00:00:00 | |
f7afd96e07e05f5bb2dcc6c523b3a004bde6def1de9a82c1dba3b798b22288bf | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[51.18, 95.05, 14.42, 94.86, 31.18], [75.35, 53.81, 32.97, 78.84, 30.32], [42.33, 82.77, 40.92, 54.96, 2.76], [51.61, 11.59, 62.35, 77.67, 61.3], [91.73, 3.96, 52.86, 45.93, 6.23], [75.04, 28.04, 48.52, 98.07, 96.17], [45.35, 13.4, 40.31, 20.35, 26.23]] | 2025-10-13T00:00:00 | |
4e9641f6a0d53ec9b587e2e5c4702da013d6f253bea33e4f454dc97746fbebde | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[26.16, 29.85, 81.42, 9.19, 60.01], [34.6, 51.11, 89.12, 77.56, 31.81], [56.23, 15.01, 43.26, 66.93, 42.28], [63.32, 96.74, 68.31, 39.16, 18.73], [72.86, 18.79, 5.51, 27.5, 65.74], [92.42, 47.09, 69.38, 10.72, 10.45]] | 2025-10-13T00:00:00 | |
264ca7b64bf520e20b9b71232ebd9506ee9053c4d4acd9aa9f150573b3618d5d | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[8.56, 23.68, 80.13, 58.22, 9.41], [43.31, 47.91, 15.97, 73.46, 11.37], [39.12, 51.67, 43.06, 58.68, 73.78], [95.63, 28.42, 64.85, 69.62, 29.27], [0.15, 97.35, 29.84, 31.4, 89.17]] | 2025-10-13T00:00:00 | |
af8f66d8abc40352791d07dee64f7c4affd6b6a13321b0bdc6b2f7e5cc97275a | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[94.31, 51.13, 97.62, 8.08, 60.74], [70.49, 94.28, 66.57, 13.34, 49.79], [92.98, 49.17, 67.58, 47.6, 21.7], [49.36, 50.02, 95.86, 34.99, 22.38], [36.97, 96.89, 92.9, 17.77, 60.89], [52.21, 64.12, 93.91, 58.2, 26.78]] | 2025-10-13T00:00:00 | |
070f3dfd7a9e43cf3abf312d860677241da12e7547ca96154f51d8c769888d71 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[80.5, 80.79, 51.53, 28.58, 5.39], [84.42, 39.24, 49.3, 67.67, 6.08], [32.49, 80.62, 31.65, 14.9, 69.85], [70.75, 0.12, 50.34, 43.67, 20.33], [87.01, 22.73, 89.54, 87.22, 1.85], [44.85, 79.89, 23.55, 31.98, 79.99], [38.34, 40.85, 4.53, 4.88, 99.92], [55.56, 27.15, 87.97, 6.42, 67.92]] | 2025-10-13T00:00:00 | |
8fd063aef584742f067a3c5cb223d2127068fba95e2ec18254ab56201e5bfa8b | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[53.82, 34.33, 36.91, 37.45, 98.74], [62.75, 12.23, 18.63, 49.73, 75.95], [58.68, 31.91, 41.81, 88.7, 45.41], [53.99, 10.69, 86.62, 13.97, 43.97], [31.2, 88.13, 6.55, 86.67, 82.78], [78.52, 4.81, 20.74, 84.99, 43.25], [63.28, 67.43, 33.0, 67.99, 12.3], [53.92, 97.05, 27.6, 89.48, 36.19], [5.17, 85.02, 0.89, 97.88, 82... | 2025-10-13T00:00:00 | |
c61571e1693981a4514a6c2f2a552c94d5abd31a92dd0f45a2152e2c5db1aa0a | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[62.51, 89.72, 77.57, 22.52, 30.02], [51.49, 46.62, 91.72, 62.92, 51.41], [55.35, 99.55, 79.27, 62.22, 98.9], [87.36, 0.53, 82.12, 79.71, 46.79], [30.3, 27.84, 25.49, 44.51, 50.45], [49.69, 24.75, 1.18, 19.24, 69.2], [20.06, 36.95, 0.37, 83.0, 15.45], [21.53, 16.02, 61.25, 4.39, 3.57]] | 2025-10-13T00:00:00 | |
3b6faa386cb8d1dda4b6da4b68fb169772b367bffd85eb43b231b59b25da3956 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[32.7, 98.73, 31.87, 78.85, 86.99], [18.16, 39.47, 39.33, 61.67, 45.23], [42.3, 25.59, 59.09, 60.43, 64.69], [39.11, 43.79, 37.27, 10.7, 47.9], [36.58, 46.02, 71.9, 86.7, 5.18], [24.14, 25.71, 18.47, 19.39, 81.38], [60.73, 22.31, 13.4, 32.93, 9.61], [91.14, 15.02, 37.14, 28.46, 1.68]] | 2025-10-13T00:00:00 | |
eeaab26191fa37a86c013f7e7aeb14c81af6a20eeeb6ae39114aa31178bcc081 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[87.02, 28.68, 60.31, 77.75, 71.61], [78.46, 31.56, 70.53, 29.92, 74.07], [91.28, 70.82, 55.45, 92.32, 8.97], [48.49, 6.52, 0.56, 83.06, 98.33], [37.01, 60.59, 47.77, 79.29, 19.51], [91.54, 86.04, 91.82, 2.66, 43.72]] | 2025-10-13T00:00:00 | |
96c3c20532c7f0b96a77636cd68154b89e3f739f5efe18ab911a659ba63058a4 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[95.6, 20.77, 82.84, 14.93, 51.28], [93.34, 14.5, 74.56, 13.94, 90.65], [32.25, 28.24, 60.59, 33.38, 67.86], [82.53, 33.82, 57.58, 75.33, 82.71], [13.59, 68.9, 84.17, 42.55, 95.69], [15.44, 24.98, 86.99, 60.04, 26.2]] | 2025-10-13T00:00:00 | |
fec4019ddb52678b38f2eb0186f27e89fa0a9f246515a70037beb82e48d95622 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[12.86, 49.93, 60.15, 2.87, 14.79], [36.9, 51.14, 66.28, 27.53, 13.8], [59.16, 23.53, 80.22, 86.73, 12.88], [98.09, 20.45, 55.37, 48.36, 35.33], [78.8, 67.04, 51.24, 81.67, 54.91], [14.77, 67.34, 20.22, 90.14, 21.71], [46.71, 27.71, 8.31, 89.59, 42.99], [92.82, 7.04, 12.98, 94.83, 62.19], [3.31, 20.08, 34.57, 46.89, ... | 2025-10-13T00:00:00 | |
4c68f87e50966a6d7c2b309e4c0f9e2827392e10b6cb3d490a00145c17bfcbc8 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[25.08, 94.68, 18.93, 17.93, 34.99], [0.28, 54.15, 10.69, 25.8, 41.69], [23.05, 67.04, 11.51, 89.63, 85.81]] | 2025-10-13T00:00:00 | |
34a8a7b34fae86dc58c730138db215527768852dfb7749beaed73846e44e7f9d | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[86.48, 85.53, 81.1, 26.14, 7.72]] | 2025-10-13T00:00:00 | |
2c141bc9dfee8145ac56190e05ce3442e681318a3419938fe7dbea56a529d260 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[83.1, 36.09, 70.27, 86.01, 64.13], [74.63, 6.36, 64.69, 73.61, 39.88], [50.72, 22.87, 65.02, 97.13, 29.87], [92.64, 75.28, 97.74, 75.97, 92.28], [54.84, 76.23, 71.63, 46.72, 57.25], [46.28, 89.16, 55.14, 42.15, 66.83], [34.44, 75.46, 16.44, 82.39, 73.23], [19.13, 18.4, 16.87, 81.89, 66.43]] | 2025-10-13T00:00:00 | |
c3fadb2c7540fe5d9b3c6bcc263df0e9887295e7ccc8b0f8926f229f768f42bf | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.27, 81.58, 34.44, 4.48, 57.16], [78.34, 36.15, 58.78, 24.85, 80.01], [88.92, 38.98, 23.17, 53.44, 94.47], [14.62, 71.88, 34.54, 45.7, 97.59], [33.1, 90.86, 46.73, 96.73, 76.42]] | 2025-10-13T00:00:00 | |
cffeb7b403a0d02d4fa1a7c405fb4635d827784eeef6361b906e01539c31250d | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[56.69, 43.07, 9.41, 34.81, 62.15], [98.5, 66.33, 16.36, 39.49, 27.8], [38.47, 76.94, 41.36, 67.93, 58.19], [18.48, 69.56, 15.5, 69.16, 95.86], [95.57, 29.93, 56.11, 40.74, 13.87], [7.65, 72.99, 67.4, 80.19, 14.89], [97.45, 86.77, 90.31, 96.19, 62.12]] | 2025-10-13T00:00:00 | |
adbcb6ab69a785ef45c72b642def8998e8e7cbb69427691020613bc0b35366f2 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[84.51, 16.1, 55.77, 36.81, 21.49], [66.02, 51.46, 27.91, 62.99, 47.92], [38.58, 42.82, 61.13, 73.64, 1.53], [81.49, 40.12, 20.32, 35.83, 86.2], [65.33, 54.22, 12.12, 90.87, 1.72], [25.4, 60.41, 8.37, 99.78, 83.23], [16.49, 46.2, 56.7, 45.19, 91.98], [34.88, 99.11, 56.58, 23.68, 65.87], [3.68, 56.75, 60.93, 0.69, 17.... | 2025-10-13T00:00:00 | |
7020ee1f171353c3346a9082c7a974279ead2b121d43d8b0df03631ee30edf3c | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[39.93, 71.74, 28.08, 8.27, 96.98], [12.63, 62.62, 78.71, 0.74, 92.1], [2.54, 73.8, 67.26, 62.52, 63.76], [13.06, 37.57, 55.07, 60.83, 54.94], [31.36, 73.62, 90.74, 88.86, 94.83], [38.77, 88.03, 39.66, 87.35, 32.99], [56.39, 64.43, 57.69, 47.54, 12.24]] | 2025-10-13T00:00:00 | |
7a157b7b8138ce00b682115ec3e08117d0d20f5673a1d10e8a659a5d1881abc8 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[42.04, 92.59, 27.39, 6.0, 31.05], [71.82, 78.1, 53.87, 31.17, 91.63], [62.01, 43.3, 44.19, 64.6, 91.79], [92.81, 43.65, 40.97, 61.32, 71.36], [53.94, 46.19, 95.42, 36.84, 64.7], [54.35, 11.1, 16.76, 81.72, 52.27], [67.89, 45.39, 84.98, 85.2, 43.05], [4.8, 8.96, 76.15, 45.97, 77.72]] | 2025-10-13T00:00:00 | |
b747df608ed838f62836c31710e808745231a80aeac24f1efb412232d20a8e89 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[28.01, 46.11, 12.17, 52.26, 40.92], [14.48, 37.86, 25.92, 61.62, 69.46], [61.3, 46.74, 29.71, 91.84, 8.34], [46.79, 61.77, 55.1, 13.41, 70.24], [64.02, 27.05, 30.19, 7.33, 5.26], [80.75, 81.33, 0.5, 33.01, 8.91], [7.16, 9.9, 98.63, 69.41, 44.87]] | 2025-10-13T00:00:00 | |
4618c0ef421c2f61f1ee9ea4ce54225d47e18940cefd43cc73809d47c31b8a9e | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[78.11, 60.58, 70.98, 8.91, 63.07], [44.14, 65.61, 44.03, 0.03, 26.03], [19.72, 67.21, 99.27, 20.95, 85.39]] | 2025-10-13T00:00:00 | |
2b3684766f52ec52968e8b84ee98e0dd9ab76a9b7ccee95b5613536db95c19bf | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[36.63, 19.93, 8.86, 65.32, 45.93], [38.96, 18.73, 6.67, 51.22, 66.76], [60.75, 5.01, 47.73, 32.96, 21.65], [79.7, 42.09, 10.32, 36.91, 91.48]] | 2025-10-13T00:00:00 | |
d73cb3791db18d3e0f0f1761abaa3f1e75066efa0544b45bb788fc499f1d7d97 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.39, 64.15, 12.86, 11.37, 65.33], [41.52, 34.91, 6.39, 45.47, 30.15], [85.35, 20.18, 21.8, 71.66, 47.07], [38.91, 54.03, 68.36, 62.48, 74.27], [23.34, 16.01, 49.79, 74.54, 44.93], [1.28, 82.83, 25.33, 62.47, 76.44], [1.82, 65.43, 54.21, 85.13, 93.9], [68.13, 12.53, 97.17, 47.39, 82.68], [84.7, 94.06, 63.47, 85.92,... | 2025-10-13T00:00:00 | |
bbb1d79f5670ef02bfc0f1f323dc62a696d0953834ed75491617823269fae0ef | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[33.03, 40.52, 57.47, 50.64, 56.42], [19.17, 26.49, 20.26, 80.29, 50.2], [64.26, 43.92, 71.58, 37.14, 5.42], [60.2, 4.11, 33.24, 37.83, 17.6], [71.57, 73.3, 8.21, 46.55, 45.52], [72.64, 18.86, 21.51, 14.57, 82.08], [71.22, 40.99, 94.3, 3.09, 80.29], [56.97, 87.41, 8.64, 74.25, 82.04], [91.49, 59.77, 30.74, 88.06, 32.... | 2025-10-13T00:00:00 | |
c870eca594418b5b24d33e239f82e0e8325e1a14e6590f512bd07c0aaa7de981 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[16.07, 0.03, 21.66, 36.8, 0.2], [37.61, 13.79, 67.59, 55.74, 50.62], [54.17, 59.69, 78.99, 27.86, 41.36], [62.64, 60.53, 7.32, 29.98, 40.33], [19.31, 99.09, 78.69, 12.13, 22.58], [76.68, 91.68, 35.38, 78.57, 14.67]] | 2025-10-13T00:00:00 | |
166cf6f4739c217a8c9a0a22ba70d7b5c776ea468d611b0178496c49ac17d918 | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[49.16, 23.44, 6.76, 71.29, 81.31], [54.83, 63.43, 16.92, 55.43, 17.58], [16.01, 70.21, 23.98, 61.38, 25.55], [50.66, 34.2, 96.24, 51.98, 20.24], [25.73, 55.04, 84.82, 33.72, 90.44], [24.03, 91.73, 72.9, 93.2, 95.07]] | 2025-10-13T00:00:00 | |
91720940f4d0dfb1a809a8d4a2073a183f199b8e0821fe6df5c0536cb2c5e14a | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[69.77, 31.38, 12.12, 32.36, 93.12], [78.97, 1.0, 19.89, 29.31, 94.34], [64.71, 89.52, 2.93, 34.49, 77.04], [35.52, 75.36, 26.83, 78.94, 45.08], [40.34, 18.18, 86.04, 90.71, 30.17]] | 2025-10-13T00:00:00 | |
469a24406dff5eafb5551d08c8614ef1e879348e4e3f351d9f760387358dd3af | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[85.18, 88.49, 76.57, 3.22, 5.02]] | 2025-10-13T00:00:00 | |
4284716f1e0daf3135d11b201da55eaa4c6b4cbdde0d0f9b1276ee0de02f304b | geom_graph | CodeOnly | [
"A random geometric graph consists of nodes and edges. Each edge connects two nodes. \nTo create a random geometric graph from input points, we calculate the euclidean distance between each pair of points. \nIf the distance is less than a given threshold, we add an edge between those two points, \nand assign edge w... | [[5.0, 50.63, 51.92, 26.52, 12.92], [2.07, 39.38, 38.02, 2.35, 23.82]] | 2025-10-13T00:00:00 | |
139c5ed8f5c3210da0199796a470060d861c8408478cd19bb9830f16fd3df9ef | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[91, 1]], [], [[53, 64], [83, 51]], [], [[45, 88]], [], [], [], [[49, 45]] | 2025-10-13T00:00:00 | |
f667ed1b16cf6b76d5211854e3ef1818fdcbf2298d24ace6831d689c4c489d43 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [], [[63, 74]], [[34, 24]], [], [], [], [[68, 10]], [[9, 59], [59, 5]] | 2025-10-13T00:00:00 | |
903872fe6bc05d6053fb5e52e9ea33a557f38f587d47eb972ada6b4d6fd9ebf5 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [], [[3, 15], [83, 81]], [], [], [], [], [[18, 31]], [[9, 88]] | 2025-10-13T00:00:00 | |
0fab94be0f70a387cffff3cb6faea3d7cfc8e0940d9634c8ca57a615c17b6a3d | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[80, 22], [10, 54]], [], [[52, 10]], [[63, 63]], [], [], [], [], [], [[49, 33]] | 2025-10-13T00:00:00 | |
de515f445568820d712ee427fb8a32ef2da1d597d7288057629abab42fbedb8d | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[70, 39], [20, 41]], [], [[62, 88]], [], [[44, 33]], [], [], [], [], [] | 2025-10-13T00:00:00 | |
38847fd6beb2ddb87f8d89c5c4d60520bc1180e0c5226016f405cf0748350117 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [], [[43, 64], [63, 43]], [], [], [[86, 7]], [[97, 75]], [], [[99, 58]] | 2025-10-13T00:00:00 | |
83e4187ccdcf08db731d76b3d3b4178912263b98bd0d7eae59853dd89ce9d709 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[20, 38], [60, 13]], [], [], [], [], [], [[56, 11]], [[97, 16]], [], [] | 2025-10-13T00:00:00 | |
964f55c4f1aeef325484b76c85e6fe04e52b84774b19b5f69213d7a476341783 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[60, 5], [0, 66]], [[1, 89], [51, 95], [31, 6]], [], [], [], [[75, 44], [15, 74]], [], [], [], [[69, 1], [9, 89]] | 2025-10-13T00:00:00 | |
19dc651813ccc1d606b24a62dd079bdde04f7995d63aa5caa63f264926eee24a | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[21, 13], [51, 69]], [], [], [], [[75, 4]], [], [[47, 9]], [], [[49, 38]] | 2025-10-13T00:00:00 | |
0127c95dafcf972a8de6ae6f4e5e0732117fff6582df4aa4483c06ef994bedae | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[30, 45]], [[71, 97]], [], [], [[4, 98], [94, 34]], [], [], [], [], [] | 2025-10-13T00:00:00 | |
924cda287cb5d965ae4adb5dea305aa1caffbc91c3bfaab138bf3c5cd76b69d7 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [[72, 40]], [], [], [[95, 46]], [], [], [], [[99, 23]] | 2025-10-13T00:00:00 | |
17db585442e7b45d2d0b193ba61fdb0693677d9e92fc02a1bbbb549b4cdbb132 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [], [], [], [], [[76, 75]], [], [], [[9, 36]] | 2025-10-13T00:00:00 | |
ba39b4bf5773a9e4bd604c56ea7d6c0a66cc231edcd7b570acd8b3c9ba5b4ad1 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[91, 54]], [], [], [], [[15, 90]], [], [[97, 2]], [], [] | 2025-10-13T00:00:00 | |
2b5f0a8a383608ab429257aab3303cc67f92b2d8844cbb2abc5e54a52fc0f153 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[91, 42]], [], [], [], [], [[26, 3]], [], [], [] | 2025-10-13T00:00:00 | |
4bc0ea65b50548b89384509ba4a26d964149879440556cd76742d4f984f41502 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[81, 31]], [[92, 41]], [], [], [[15, 52]], [], [[47, 20]], [[8, 49]], [] | 2025-10-13T00:00:00 | |
0bf3d73e5b642b6ff624aeaaf3f12ec4dde8fbfd4c553e6f04391f3dd2ff4914 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[60, 75]], [], [], [], [[94, 13], [24, 22]], [[65, 63], [25, 24]], [[66, 38]], [], [[48, 19]], [] | 2025-10-13T00:00:00 | |
2f92b75a42ae54552534d911cc600a0c1c2a7408cc6202247b9e48b64cccffec | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[20, 71]], [], [], [[93, 92]], [], [], [], [], [], [] | 2025-10-13T00:00:00 | |
69c6e4b43d93fc967ec0d096bdf63d99da53f210374c4a431dd13eafbcb4824e | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [[81, 85], [51, 90]], [], [], [[74, 76], [14, 74]], [], [], [], [], [] | 2025-10-13T00:00:00 | |
dd235fc5cf84b159c6dd9503a25e9e7cd31b9ce57be191ad8dfc55f7740666f2 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [], [], [], [[13, 85]], [], [], [], [], [[18, 98], [8, 17]], [] | 2025-10-13T00:00:00 | |
fbd7fd51be5fed40ab6fdaab634f95abdb5c5cfacb78a828e122d606b1cc54c4 | hashmap | CodeMaybe | [
"A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key). \n1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, ... | [[60, 93]], [[51, 42]], [[32, 5]], [[33, 74], [93, 51], [83, 21]], [], [], [], [], [[38, 82], [28, 46]], [[19, 36]] | 2025-10-13T00:00:00 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.