A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2
const size_t BUFFER_SIZE = 0x6fafffff;
alignas(std::max_align_t) char buffer[BUFFER_SIZE];
size_t buffer_pos = 0;
void* operator new(size_t size) {
constexpr std::size_t alignment = alignof(std::max_align_t);
size_t padding = (alignment - (buffer_pos % alignment)) % alignment;
size_t total_size = size + padding;
char* aligned_ptr = &buffer[buffer_pos + padding];
buffer_pos += total_size;
return aligned_ptr;
}
void operator delete(void* ptr, unsigned long) {}
void operator delete(void* ptr) {}
void operator delete[](void* ptr) {}| 0004-median-of-two-sorted-arrays |
| 0074-search-a-2d-matrix |
| 0240-search-a-2d-matrix-ii |
| 0268-missing-number |
| 0441-arranging-coins |
| 1004-max-consecutive-ones-iii |
| 1901-find-a-peak-element-ii |
| 0004-median-of-two-sorted-arrays |
| 0023-merge-k-sorted-lists |
| 0148-sort-list |
| 0215-kth-largest-element-in-an-array |
| 0240-search-a-2d-matrix-ii |
| 0347-top-k-frequent-elements |
| 0037-sudoku-solver |
| 0074-search-a-2d-matrix |
| 0079-word-search |
| 0085-maximal-rectangle |
| 0240-search-a-2d-matrix-ii |
| 1901-find-a-peak-element-ii |
| 0045-jump-game-ii |
| 0055-jump-game |
| 0455-assign-cookies |
| 0621-task-scheduler |
| 0846-hand-of-straights |
| 0860-lemonade-change |
| 1903-largest-odd-number-in-string |
| 0014-longest-common-prefix |
| 0796-rotate-string |
| 0347-top-k-frequent-elements |
| 0451-sort-characters-by-frequency |
| 0347-top-k-frequent-elements |
| 0451-sort-characters-by-frequency |
| 0621-task-scheduler |
| 0002-add-two-numbers |
| 0025-reverse-nodes-in-k-group |
| 0050-powx-n |
| 0206-reverse-linked-list |
| 0231-power-of-two |
| 0234-palindrome-linked-list |
| 1922-count-good-numbers |
| 0022-generate-parentheses |
| 0042-trapping-rain-water |
| 0045-jump-game-ii |
| 0055-jump-game |
| 0070-climbing-stairs |
| 0085-maximal-rectangle |
| 0907-sum-of-subarray-minimums |
| 0070-climbing-stairs |
| 0258-add-digits |
| 0735-asteroid-collision |
| 0204-count-primes |
| 0258-add-digits |
| 0023-merge-k-sorted-lists |
| 0148-sort-list |
| 0029-divide-two-integers |
| 0078-subsets |
| 0090-subsets-ii |
| 0231-power-of-two |
| 0268-missing-number |
| 0461-hamming-distance |
| 2220-minimum-bit-flips-to-convert-number |
| 0079-word-search |
| 0204-count-primes |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0239-sliding-window-maximum |
| 0020-valid-parentheses |
| 0042-trapping-rain-water |
| 0084-largest-rectangle-in-histogram |
| 0085-maximal-rectangle |
| 0901-online-stock-span |
| 0907-sum-of-subarray-minimums |
| 0084-largest-rectangle-in-histogram |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0295-find-median-from-data-stream |
| 0703-kth-largest-element-in-a-stream |
| 0901-online-stock-span |
| 0460-lfu-cache |
| 0930-binary-subarrays-with-sum |
| 1004-max-consecutive-ones-iii |
| 1248-count-number-of-nice-subarrays |
| 1423-maximum-points-you-can-obtain-from-cards |
| 0215-kth-largest-element-in-an-array |
| 0347-top-k-frequent-elements |
| 0023-merge-k-sorted-lists |
| 0703-kth-largest-element-in-a-stream |
| 0703-kth-largest-element-in-a-stream |
| 0703-kth-largest-element-in-a-stream |
| 0455-assign-cookies |