A PHP Error was encountered

Severity: Notice

Message: Undefined index: markdown

Filename: models/Languages.php

Line Number: 60

Backtrace:

File: /var/www/stikked/htdocs/application/models/Languages.php
Line: 60
Function: _error_handler

File: /var/www/stikked/htdocs/application/models/Pastes.php
Line: 516
Function: code_to_description

File: /var/www/stikked/htdocs/application/controllers/Main.php
Line: 551
Function: getPaste

File: /var/www/stikked/htdocs/index.php
Line: 315
Function: require_once

# Array Partition (LeetCode 561): Interview Notes ## Problem Given 2n integers, pair them into n pairs (a1,b1)... such that sum of min(ai,bi) is maximized. ## Approach Sort ascending and sum every even-index element (0-based). Adjacent pairing after sort maximizes the sum of mins. ## Complexity O(n log n) time, O(1) or O(n) space depending on sort. ## Interview tip Prove the adjacent pairing claim with a swap argument. Rehearse proofs with [real-time AI interview assistant for live interviews](https://www.linkjob.ai/). *Disclosure: I work on Linkjob AI.*