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 |
|---|---|---|---|---|---|---|
cfe0752f1e5457ad21ef5bd373542a41d41d7cb6f5d6c2eb420a1b532bc5772b | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [10, 27, 62, 70, 98, 88] | 2025-10-13T00:00:00 | |
0dadd31eed947c7fe640765b40d37753648c66b2dcda8bafb5d05beef08b6556 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [5, 35, 53, 40, 35, 58, 91, 82, 100, 97] | 2025-10-13T00:00:00 | |
e8f9c3f54f3753c0aa557b1fcb8363b7d72e5da1e529725c1e5365b2f1f60d25 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [26, 48, 53, 60, 93, 96, 86, 77, 74] | 2025-10-13T00:00:00 | |
a9192ce038246d3bb9a775d10db8fa9c08917d81d467072c8dd6b0bb74696df9 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [9, 22, 23, 59, 37, 33, 55, 65, 64, 91] | 2025-10-13T00:00:00 | |
a7cae9d55bccc41afcfd3bd20901b46eb8bbecabd83aca7daa4f560130e4332a | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [2, 10, 7, 41, 46, 98, 56, 43, 83, 79] | 2025-10-13T00:00:00 | |
d10095a046a6edf584f7e9ceefee8790895b127a57b42df8c053d42e38863536 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [8, 16, 20, 72, 33, 31, 35, 83] | 2025-10-13T00:00:00 | |
ca43d20b2fffcf9ddad9c71fa4ffe9274b423f48b5ff6a8963b212a73ac1dc4b | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [55, 76, 64, 84, 81] | 2025-10-13T00:00:00 | |
a9ba634b6ae49ed39e6bb40670256c317022d104a040212c054285c38b7608a9 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [4, 31, 85, 41, 41, 88, 88, 44, 46, 67] | 2025-10-13T00:00:00 | |
c7c062a835b9ff7c90f8d0885cc2a881788cb8be2df2a5b76613c402378582c3 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 17, 48, 78, 37, 85, 59, 84] | 2025-10-13T00:00:00 | |
1b6c2aff789a3b07abd828b28ac2761ce674284897a0cb6103ce118507ebfbed | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [8, 9, 36, 11, 20, 75, 59, 20, 67, 30] | 2025-10-13T00:00:00 | |
59fb8618d7b74f593808e624a0cbb90616f54de44e44c1de804eee847c5f0aa7 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 17, 10, 64, 25, 42, 90, 87] | 2025-10-13T00:00:00 | |
2d048242834f6bf93c2fca8536285e72f24bb5d2cda5d341fa72870bf851a493 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 38, 5, 80, 98, 10, 13, 85] | 2025-10-13T00:00:00 | |
54b68c1e3899c9db396723e24cfc9a763ccff2496c92f08728844f9d8882708b | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [17, 18, 66, 25, 31, 83, 72, 46] | 2025-10-13T00:00:00 | |
4b8fc43ca41bbace935b730ba9d883b3f9d17354f89dbd28ca0eb6a1b582341c | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [18, 23, 19, 93, 49, 53] | 2025-10-13T00:00:00 | |
bef5638cf18b3dcac5c48c1b31ca1168a9e8b71fa45cc1bc5acff09197bf31da | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [18, 43, 50, 74, 94] | 2025-10-13T00:00:00 | |
6e18440c6a17a13e40918b907df8652aa089784a80e860f3cb162a29ee534292 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [5, 9, 40, 69, 94, 72] | 2025-10-13T00:00:00 | |
2fce1024da56b3b29bbfd757fa0d48d39a6ca108fdddca6e00bf3828982c2ec3 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [14, 16, 38, 31, 99, 82] | 2025-10-13T00:00:00 | |
b983d7c7f0362465a3db3ca7071f9864412b4e99a9ea7061a0625a6ccf296297 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 9, 45, 29, 77, 62, 76, 39] | 2025-10-13T00:00:00 | |
ad2310c13606e0fb9ea6725afa033f076e6fe726754fbb7443ee21cd248238b7 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 34, 40, 39, 64, 52] | 2025-10-13T00:00:00 | |
081611e4435f9caee8279da3c36478465825423eb2e08f4f1761c929c8e72136 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 20, 12, 72, 67, 91] | 2025-10-13T00:00:00 | |
b43571f613cc5d3ba52994c0628aaffb37cfbb29f0b9a96d9d65400cbf823d84 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 30, 11, 54, 69] | 2025-10-13T00:00:00 | |
bf9fbb7b446a51c4eb6f50c076e9f56981de515566642af5074c799e4e1fd2cf | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [32, 78, 48, 99, 95] | 2025-10-13T00:00:00 | |
39d0db39c0028a67764968fbffbeebf20599d8847065ef527a95cbb270f498ac | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [16, 22, 60, 58, 70] | 2025-10-13T00:00:00 | |
07e23760efdbc8ddb9e8a6874425f79a1514db91fe6938de278af341a145708a | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [10, 12, 13, 38, 14, 28, 50, 73, 81, 99] | 2025-10-13T00:00:00 | |
050e9ac9c067c84a12322bcb4da1eb1323bdb035ffe14a978598d38b53d3ef02 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [6, 10, 26, 47, 83, 43, 35, 83, 94, 83] | 2025-10-13T00:00:00 | |
048319c2ecdc387b9b430110f7e3350130adec14e3bcbeeb24f6b69e6708ac06 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [29, 41, 51, 44, 95, 78] | 2025-10-13T00:00:00 | |
8682382ee8e2a4cfaaaad8109dd2472fb4e870ab4d09ab80faa1762024afb4bf | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 56, 19, 61, 68, 64] | 2025-10-13T00:00:00 | |
6afdb95e06753c554c31dfd69d6e86e38c5e22a47305734ece6d7d544a6005c2 | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 43, 64, 68, 75, 66, 89] | 2025-10-13T00:00:00 | |
ec06b3051888b7156231c376fde2da49e2845646c94ecdfbba8025352f71ce2f | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 14, 23, 66, 35, 99, 76] | 2025-10-13T00:00:00 | |
82c37b4200ee759aca56531549e2caac4df6b2de50b69ef8fd05000b9663d6fe | heap | CodeEnforce | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [2, 16, 7, 71, 94, 79, 81, 77] | 2025-10-13T00:00:00 | |
932c2a545c5b6d9a82a8e6870afc7d54550386f38f094092403a19f46edb7823 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [10, 27, 62, 70, 98, 88] | 2025-10-13T00:00:00 | |
75cb096b77c227ed2effe9bfda8d57894943013e4b8dd2afe1dc6e63121af28f | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [5, 35, 53, 40, 35, 58, 91, 82, 100, 97] | 2025-10-13T00:00:00 | |
00e722fe5b02c744c6b63cdd17d1eb400ec0d3e4d657e91ad02df0b1a7ac1510 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [26, 48, 53, 60, 93, 96, 86, 77, 74] | 2025-10-13T00:00:00 | |
0876a573fb214aa7b33af1b53e1f03480d0e698797d2d176fab64fbb9c9d9cd3 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [9, 22, 23, 59, 37, 33, 55, 65, 64, 91] | 2025-10-13T00:00:00 | |
d175f51534f6d9b8bdb694ac15d15559a907af9ba45e1567ee5e949c2e240b5c | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [2, 10, 7, 41, 46, 98, 56, 43, 83, 79] | 2025-10-13T00:00:00 | |
7131419dc419c9e7da730209fffb1daf901bae3e06c4f234727159a74050506a | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [8, 16, 20, 72, 33, 31, 35, 83] | 2025-10-13T00:00:00 | |
e851caba28ef12e50071086476d59a882b479184e5e36a8eb25b4cf4fe8ed707 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [55, 76, 64, 84, 81] | 2025-10-13T00:00:00 | |
697e0865fef34c0f14a77e0f9dd1f8e7895cd4b210ab4aa61f8bb787e00e433a | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [4, 31, 85, 41, 41, 88, 88, 44, 46, 67] | 2025-10-13T00:00:00 | |
ad7919078460fb349cd479606d2a87bafe97792475688cf04e5509be9a504531 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 17, 48, 78, 37, 85, 59, 84] | 2025-10-13T00:00:00 | |
e1c32003914255254bf95f5e71bc5e9942904fb4e95b87b75971ceaabbd7e1a3 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [8, 9, 36, 11, 20, 75, 59, 20, 67, 30] | 2025-10-13T00:00:00 | |
7ce05f1f5d459533e494c8f3703614a33e8e1f9977edc7ce1527626450a03861 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 17, 10, 64, 25, 42, 90, 87] | 2025-10-13T00:00:00 | |
b9ae3a68c299f74062f0234c3464c586db7d7da4f16751d707fe091b3e975af7 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 38, 5, 80, 98, 10, 13, 85] | 2025-10-13T00:00:00 | |
a191396c874e07f650bd9f9cdded4a152ded092098abac9d64c3f6a224551e14 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [17, 18, 66, 25, 31, 83, 72, 46] | 2025-10-13T00:00:00 | |
88b3d268f3523ed1694fb6ca69be15147f2f9b0e319d6a7e0a11195f62831e3c | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [18, 23, 19, 93, 49, 53] | 2025-10-13T00:00:00 | |
0fa6e1bb5af142ff72dfb59ad220f6e4d3010fe0d2fc06c5f7506b4e8857966d | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [18, 43, 50, 74, 94] | 2025-10-13T00:00:00 | |
74bd7b23bfe4103683d30833af86bd0069bba4dd4c4008fe79eb56305af60243 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [5, 9, 40, 69, 94, 72] | 2025-10-13T00:00:00 | |
3954894f18d2cbf41304c012a1e1a17303ad6690783bcbaba13bf9a408a2ce04 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [14, 16, 38, 31, 99, 82] | 2025-10-13T00:00:00 | |
cf67d45a211e0da3cf91968af4f43344ddbcbfd648fbeab49dc6475ab7d65bb7 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 9, 45, 29, 77, 62, 76, 39] | 2025-10-13T00:00:00 | |
4863982fec7c7b4fae6eabd21cf15938049ed18c9a1c88e9670fec8550276a62 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 34, 40, 39, 64, 52] | 2025-10-13T00:00:00 | |
9d3efa3aae4e0ae7d08acf4fee01ea422fef97ea86d96bcd0470520d54c078c8 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 20, 12, 72, 67, 91] | 2025-10-13T00:00:00 | |
ff2af13a1867c7dde10ada3a68eeecf16654d2f27f36b89cab5b4cb0f8c63d0c | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 30, 11, 54, 69] | 2025-10-13T00:00:00 | |
f60944bcee24e56a73013df3950356e7dadf463582d7ea10f1cd86aa6cd2ae0d | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [32, 78, 48, 99, 95] | 2025-10-13T00:00:00 | |
45b20ffc914d80d35f02d42e5894e397732a188149cb95284fdf7a30095ea3db | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [16, 22, 60, 58, 70] | 2025-10-13T00:00:00 | |
8180c6163da1eaf7457cd07ce44a69d7f1e4bb143c6ccb6c3c443825971b2bb0 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [10, 12, 13, 38, 14, 28, 50, 73, 81, 99] | 2025-10-13T00:00:00 | |
b1ac6292377bb9a92ee2a212f04fe430bd187923000ee6a9b1a0df76aac351df | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [6, 10, 26, 47, 83, 43, 35, 83, 94, 83] | 2025-10-13T00:00:00 | |
e7b0c7b38dbf3d192d478fa2196e04c6a3bd3e7ac8325b9dd9a7aad524aa8ff5 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [29, 41, 51, 44, 95, 78] | 2025-10-13T00:00:00 | |
76cfb37b664a82d01d21a094b2351213cb2156f985e722468055488f4da93c01 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [7, 56, 19, 61, 68, 64] | 2025-10-13T00:00:00 | |
66c1a1fe71695224b015fb4c7540a2753dcb947a6dde971e8d1b215c46004239 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [0, 43, 64, 68, 75, 66, 89] | 2025-10-13T00:00:00 | |
2c1cf92b79a5a332fc415012081f8af7ba0f3c32901ded01b202e54a155dd231 | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [3, 14, 23, 66, 35, 99, 76] | 2025-10-13T00:00:00 | |
3b7cf3ca24efc264d3e6cd49894931a8b6b9a86f5d04b779aab745cd247aaebe | heap | CodeOnly | [
"A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children.\nA bottom-up heapify algorithm works by:\na. Starting from the last non-leaf node at index (n // 2) - 1, where n is the number of elements.\nb. Iterating bottom-up from this index to index 0, in d... | [2, 16, 7, 71, 94, 79, 81, 77] | 2025-10-13T00:00:00 | |
2dd687b63c0ef8746b83921f124105c99579065fde17e36dddedaab356294898 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [82, 90, 42, 77, 57, 40, 51] | 2025-10-13T00:00:00 | |
6793c61e0a7ec936d57e63376fd8be6b349228964bb960d16ef008277ed328dc | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [66, 19, 15] | 2025-10-13T00:00:00 | |
bd90b7d0e1753887ef34d2652f23bf73b5f24758d1420ed47bd5192489e3d357 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [71, 73, 16, 50, 13, 5] | 2025-10-13T00:00:00 | |
e2335828d5cf7c6652438778d923bdc5d89278d2d45f2238d2cfa4b568402beb | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [10, 18, 77] | 2025-10-13T00:00:00 | |
2f839a4096a844ee81d120593d4b36fe09394e9786ab4dfa835e604f10555907 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [58, 64, 38] | 2025-10-13T00:00:00 | |
2ad6c3eb5a3a3abc9831677061017f9294ec1f3ed840d3e01c915308f8a66592 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [57, 50, 11, 8, 67] | 2025-10-13T00:00:00 | |
9aa763d4522d2f2738d5a658c31e1d997e66e863684f8ef6a7f97fc09279f259 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [39] | 2025-10-13T00:00:00 | |
019cab203ae522a064b5472d36f7b8194841d32e2f49bf27aa349a2b058d18c9 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [70, 22, 80, 17] | 2025-10-13T00:00:00 | |
f4f2c716eb8103e7942bd38b21e068fe2e735d6f627b2de603bfddd13b6b53ef | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [98] | 2025-10-13T00:00:00 | |
b82bbe26bcb611a301a2a9b23c73e2d1894c109ebff7247d6acab946eb80564d | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [17, 36, 38, 6, 26] | 2025-10-13T00:00:00 | |
0811a58edb9d078670f20af48e107e5557bde33bfecb0cac94685004f2619128 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [17, 11, 10, 67] | 2025-10-13T00:00:00 | |
940e978c020185f4cf3f1608c5139686ed4600ff438e127407a862cd92314e89 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [58, 26] | 2025-10-13T00:00:00 | |
2aab8af4f223484a82b4d293d485b1e348c2b16042f95c6439518b94598387b1 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [82, 29, 15, 100, 39] | 2025-10-13T00:00:00 | |
fc63a61bad21cdfb304dbb3f31c162288394ce263d0d7505e3cf2e961ef012d3 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [97, 37, 36] | 2025-10-13T00:00:00 | |
c42e1e5ddd8d6cd1ae8c1b4dab861145b7bdaeb3bc7cba56ed90ecb6a2cfb93e | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [21, 23, 4, 75, 37, 34] | 2025-10-13T00:00:00 | |
c48f7d7354a68ad9734a65b88e740d7abfa734bd1e3a3c19fb72751411be9305 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [5, 12, 18, 66, 49] | 2025-10-13T00:00:00 | |
3a3aa5a58945845d7d4c02a310a5d6e639974a0208d94c20ab31662f1cf56e01 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [77, 18] | 2025-10-13T00:00:00 | |
c5e10f31d8074b310ba5cd4e067c4823ba269f66f07cf227c30cd89c8e89cdad | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [86, 98, 19, 4, 64] | 2025-10-13T00:00:00 | |
55e11cfa0bad3f1e34394d9e906fffd152caf15280716d76237e76c732a0ddb9 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [66, 75, 45, 4] | 2025-10-13T00:00:00 | |
45ad027104c10cbcfa8c7e0236ad0c3c7326799c308a3a41e4d3307565c2e752 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [] | 2025-10-13T00:00:00 | |
f0284cd61de02e0d21dd78e3014301bca5e8da0fb31603789435ed7ecc72a915 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [25, 77, 55, 47, 73, 65] | 2025-10-13T00:00:00 | |
d612fa50e1339d9b44eef8aa570ac068272cf19b4c6ca29f378691a4849c0ddc | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [34, 23] | 2025-10-13T00:00:00 | |
2d4c327f9d80b44063534bcd26b1f600abc131981f655d3875a870daccab42fe | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [54, 93] | 2025-10-13T00:00:00 | |
3055c740aeccfe356436ed5522021b34b86a80f4b3acfb30ef1de33d2eea9458 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [40, 9, 91, 95, 18] | 2025-10-13T00:00:00 | |
89f3dab64cdda73d6b36a1273c512b3b7f92c0db984d3d01acfd1172885ff722 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [49, 19] | 2025-10-13T00:00:00 | |
47d51039e66e273c15a032edd1b89e1ec79290ddec50bea367341df79d802b69 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [53, 89, 68, 24, 1, 45, 75, 52, 40, 65] | 2025-10-13T00:00:00 | |
7ed4a72121d62ca3aed95d75a2c5a43e4d68032ecc90089c57a70839267a08ba | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [46, 90, 58, 100] | 2025-10-13T00:00:00 | |
d278453c9f7d78e8dc13fe87ec2f659663d4acc992a090ef876bbe62dc9ae7f1 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [74, 12, 79, 81] | 2025-10-13T00:00:00 | |
f26cfa8d88625274b57ae9136970ea03d6b7d155a099a65ffda1ec584a09427c | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [11, 15, 10, 13] | 2025-10-13T00:00:00 | |
11e600bafceb29f12a5ba7f99c495c1f9ba39acb6118421deb1899b7911778f0 | queue | CodeMaybe | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [89, 90, 30, 75, 77, 79, 47, 69] | 2025-10-13T00:00:00 | |
ac735d92d3eb072aa846746288654e7e30f0d1b5a22622a8779148b1f6f34dc4 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [82, 90, 42, 77, 57, 40, 51] | 2025-10-13T00:00:00 | |
881ccd50676a1f5caa761ef23b7c80257b8916958caf6c29bc9621ef54b722e9 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [66, 19, 15] | 2025-10-13T00:00:00 | |
d83d73fc2f6b84f60817812579103b8c2b447542e38f582b87731823e25b29e3 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [71, 73, 16, 50, 13, 5] | 2025-10-13T00:00:00 | |
c762ce7ef887a41be09b4ab2197fad8e4307bed971c382a770b2f83c3cea839f | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [10, 18, 77] | 2025-10-13T00:00:00 | |
eeafef4893268c75b1b89b093c7bb5c2baafe467499419fc3569c0d5ca72a049 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [58, 64, 38] | 2025-10-13T00:00:00 | |
7fa0000c56734470076a23bd2702d8b4ab735945668c8809189b817be21f9d7a | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [57, 50, 11, 8, 67] | 2025-10-13T00:00:00 | |
acf5a8ce63393070afa4b734b6d487494f40e24d448f4a750984b587422ccac8 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [39] | 2025-10-13T00:00:00 | |
5cc8a92949135e19e7222f6500e479a93dabb6816766fd2760ca21508b04aa25 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [70, 22, 80, 17] | 2025-10-13T00:00:00 | |
988f6cd90db69aa03895ef6eb640541446c8b048cb5f2d9ead390fa78a07643d | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [98] | 2025-10-13T00:00:00 | |
2e4ce32e034bcdfdc2883351caa75105900f4373502b90a3d0ff8212dfaf4198 | queue | CodeEnforce | [
"A queue is a data structure in which items are added at one end and removed from the other, maintaining a first-in, first-out (FIFO) order. \nYou should create a queue. \n There are two types of operations: \n1. (enqueue, k) means an element k is appended to the queue as the last element. \n2. (dequeue) means the ... | [17, 36, 38, 6, 26] | 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.