From 7a589a0da65e4ed94d5b3b29d7d4b84bff4ec296 Mon Sep 17 00:00:00 2001
From: SamirPaulb <77569653+SamirPaulb@users.noreply.github.com>
Date: Thu, 8 Feb 2024 23:47:24 +0530
Subject: [PATCH] modified leetcode posts for terminal shortcode hugo
---
content/posts/leetcode/0007-reverse-integer.md | 2 +-
content/posts/leetcode/0041-first-missing-positive.md | 2 +-
content/posts/leetcode/0045-jump-game-ii.md | 2 +-
content/posts/leetcode/0104-maximum-depth-of-binary-tree.md | 2 +-
.../0109-convert-sorted-list-to-binary-search-tree.md | 2 +-
content/posts/leetcode/0111-minimum-depth-of-binary-tree.md | 2 +-
content/posts/leetcode/0129-sum-root-to-leaf-numbers.md | 2 +-
content/posts/leetcode/0136-single-number.md | 2 +-
content/posts/leetcode/0137-single-number-ii.md | 2 +-
content/posts/leetcode/0175-combine-two-tables.md | 1 -
content/posts/leetcode/0176-second-highest-salary.md | 3 ---
content/posts/leetcode/0177-nth-highest-salary.md | 1 -
content/posts/leetcode/0178-rank-scores.md | 2 --
content/posts/leetcode/0180-consecutive-numbers.md | 3 ---
.../0181-employees-earning-more-than-their-managers.md | 2 --
content/posts/leetcode/0182-duplicate-emails.md | 2 --
content/posts/leetcode/0183-customers-who-never-order.md | 2 --
content/posts/leetcode/0184-department-highest-salary.md | 2 --
content/posts/leetcode/0185-department-top-three-salaries.md | 2 --
content/posts/leetcode/0191-number-of-1-bits.md | 2 +-
content/posts/leetcode/0196-delete-duplicate-emails.md | 3 ---
content/posts/leetcode/0197-rising-temperature.md | 2 --
content/posts/leetcode/0202-happy-number.md | 2 +-
content/posts/leetcode/0217-contains-duplicate.md | 2 +-
content/posts/leetcode/0237-delete-node-in-a-linked-list.md | 2 +-
content/posts/leetcode/0242-valid-anagram.md | 4 ++--
content/posts/leetcode/0262-trips-and-users.md | 1 -
content/posts/leetcode/0283-move-zeroes.md | 2 +-
content/posts/leetcode/0303-range-sum-query---immutable.md | 2 +-
content/posts/leetcode/0343-integer-break.md | 2 +-
content/posts/leetcode/0367-valid-perfect-square.md | 1 -
content/posts/leetcode/0389-find-the-difference.md | 4 ++--
content/posts/leetcode/0392-is-subsequence.md | 2 +-
content/posts/leetcode/0404-sum-of-left-leaves.md | 2 +-
content/posts/leetcode/0511-game-play-analysis-i.md | 1 -
content/posts/leetcode/0512-game-play-analysis-ii.md | 2 --
content/posts/leetcode/0534-game-play-analysis-iii.md | 3 ---
.../posts/leetcode/0540-single-element-in-a-sorted-array.md | 2 +-
content/posts/leetcode/0543-diameter-of-binary-tree.md | 2 +-
content/posts/leetcode/0550-game-play-analysis-iv.md | 2 --
content/posts/leetcode/0566-reshape-the-matrix.md | 2 +-
content/posts/leetcode/0569-median-employee-salary.md | 1 -
.../leetcode/0570-managers-with-at-least-5-direct-reports.md | 1 -
.../leetcode/0571-find-median-given-frequency-of-numbers.md | 1 -
content/posts/leetcode/0574-winning-candidate.md | 2 --
content/posts/leetcode/0577-employee-bonus.md | 1 -
.../posts/leetcode/0578-get-highest-answer-rate-question.md | 2 --
.../leetcode/0579-find-cumulative-salary-of-an-employee.md | 2 --
.../leetcode/0580-count-student-number-in-departments.md | 1 -
content/posts/leetcode/0584-find-customer-referee.md | 1 -
content/posts/leetcode/0585-investments-in-2016.md | 1 -
.../0586-customer-placing-the-largest-number-of-orders.md | 2 --
content/posts/leetcode/0589-n-ary-tree-preorder-traversal.md | 2 +-
content/posts/leetcode/0595-big-countries.md | 2 --
content/posts/leetcode/0596-classes-more-than-5-students.md | 1 -
.../0597-friend-requests-i-overall-acceptance-rate.md | 1 -
content/posts/leetcode/0601-human-traffic-of-stadium.md | 1 -
.../0602-friend-requests-ii-who-has-the-most-friends.md | 1 -
content/posts/leetcode/0603-consecutive-available-seats.md | 3 ---
content/posts/leetcode/0607-sales-person.md | 1 -
content/posts/leetcode/0608-tree-node.md | 1 -
content/posts/leetcode/0610-triangle-judgement.md | 1 -
content/posts/leetcode/0612-shortest-distance-in-a-plane.md | 1 -
content/posts/leetcode/0613-shortest-distance-in-a-line.md | 2 --
content/posts/leetcode/0614-second-degree-follower.md | 1 -
.../leetcode/0615-average-salary-departments-vs-company.md | 2 --
content/posts/leetcode/0618-students-report-by-geography.md | 1 -
content/posts/leetcode/0619-biggest-single-number.md | 2 --
content/posts/leetcode/0620-not-boring-movies.md | 1 -
content/posts/leetcode/0626-exchange-seats.md | 4 ----
content/posts/leetcode/0627-swap-salary.md | 2 --
content/posts/leetcode/0654-maximum-binary-tree.md | 2 +-
content/posts/leetcode/0669-trim-a-binary-search-tree.md | 2 +-
content/posts/leetcode/0687-longest-univalue-path.md | 2 +-
content/posts/leetcode/0709-to-lower-case.md | 2 +-
content/posts/leetcode/0769-max-chunks-to-make-sorted.md | 2 +-
content/posts/leetcode/0771-jewels-and-stones.md | 2 +-
content/posts/leetcode/0856-score-of-parentheses.md | 1 -
content/posts/leetcode/0876-middle-of-the-linked-list.md | 2 +-
content/posts/leetcode/0940-distinct-subsequences-ii.md | 2 +-
content/posts/leetcode/0953-verifying-an-alien-dictionary.md | 2 +-
content/posts/leetcode/0976-largest-perimeter-triangle.md | 2 +-
content/posts/leetcode/0998-maximum-binary-tree-ii.md | 2 +-
.../leetcode/1038-binary-search-tree-to-greater-sum-tree.md | 4 ++--
.../posts/leetcode/1045-customers-who-bought-all-products.md | 1 -
.../leetcode/1047-remove-all-adjacent-duplicates-in-string.md | 2 +-
...ctors-and-directors-who-cooperated-at-least-three-times.md | 1 -
content/posts/leetcode/1068-product-sales-analysis-i.md | 1 -
content/posts/leetcode/1069-product-sales-analysis-ii.md | 1 -
content/posts/leetcode/1070-product-sales-analysis-iii.md | 2 --
content/posts/leetcode/1075-project-employees-i.md | 1 -
content/posts/leetcode/1076-project-employees-ii.md | 2 --
content/posts/leetcode/1077-project-employees-iii.md | 1 -
content/posts/leetcode/1082-sales-analysis-i.md | 2 --
content/posts/leetcode/1083-sales-analysis-ii.md | 1 -
content/posts/leetcode/1084-sales-analysis-iii.md | 1 -
content/posts/leetcode/1089-duplicate-zeros.md | 2 +-
content/posts/leetcode/1097-game-play-analysis-v.md | 1 -
content/posts/leetcode/1098-unpopular-books.md | 1 -
content/posts/leetcode/1107-new-users-daily-count.md | 1 -
content/posts/leetcode/1112-highest-grade-for-each-student.md | 2 --
content/posts/leetcode/1113-reported-posts.md | 1 -
content/posts/leetcode/1126-active-businesses.md | 2 --
content/posts/leetcode/1127-user-purchase-platform.md | 1 -
content/posts/leetcode/1132-reported-posts-ii.md | 1 -
.../leetcode/1141-user-activity-for-the-past-30-days-i.md | 1 -
.../leetcode/1142-user-activity-for-the-past-30-days-ii.md | 2 --
content/posts/leetcode/1143-longest-common-subsequence.md | 2 +-
content/posts/leetcode/1148-article-views-i.md | 1 -
content/posts/leetcode/1149-article-views-ii.md | 1 -
content/posts/leetcode/1158-market-analysis-i.md | 2 --
content/posts/leetcode/1159-market-analysis-ii.md | 1 -
content/posts/leetcode/1164-product-price-at-a-given-date.md | 2 --
content/posts/leetcode/1173-immediate-food-delivery-i.md | 1 -
content/posts/leetcode/1174-immediate-food-delivery-ii.md | 2 --
content/posts/leetcode/1179-reformat-department-table.md | 1 -
content/posts/leetcode/1193-monthly-transactions-i.md | 1 -
content/posts/leetcode/1194-tournament-winners.md | 1 -
content/posts/leetcode/1204-last-person-to-fit-in-the-bus.md | 2 --
content/posts/leetcode/1205-monthly-transactions-ii.md | 1 -
content/posts/leetcode/1211-queries-quality-and-percentage.md | 1 -
.../posts/leetcode/1212-team-scores-in-football-tournament.md | 1 -
content/posts/leetcode/1220-count-vowels-permutation.md | 2 --
content/posts/leetcode/1225-report-contiguous-dates.md | 1 -
content/posts/leetcode/1241-number-of-comments-per-post.md | 1 -
content/posts/leetcode/1251-average-selling-price.md | 1 -
content/posts/leetcode/1264-page-recommendations.md | 2 --
.../posts/leetcode/1266-minimum-time-visiting-all-points.md | 2 +-
.../leetcode/1270-all-people-report-to-the-given-manager.md | 1 -
content/posts/leetcode/1280-students-and-examinations.md | 1 -
...81-subtract-the-product-and-sum-of-digits-of-an-integer.md | 2 +-
...1285-find-the-start-and-end-number-of-continuous-ranges.md | 2 --
.../1290-convert-binary-number-in-a-linked-list-to-integer.md | 2 +-
content/posts/leetcode/1294-weather-type-in-each-country.md | 1 -
content/posts/leetcode/1302-deepest-leaves-sum.md | 2 +-
content/posts/leetcode/1303-find-the-team-size.md | 2 --
.../leetcode/1308-running-total-for-different-genders.md | 1 -
.../1309-decrypt-string-from-alphabet-to-integer-mapping.md | 2 +-
.../posts/leetcode/1313-decompress-run-length-encoded-list.md | 2 +-
content/posts/leetcode/1321-restaurant-growth.md | 2 --
content/posts/leetcode/1322-ads-performance.md | 1 -
content/posts/leetcode/1323-maximum-69-number.md | 2 +-
.../leetcode/1327-list-the-products-ordered-in-a-period.md | 1 -
.../posts/leetcode/1336-number-of-transactions-per-visit.md | 1 -
content/posts/leetcode/1341-movie-rating.md | 1 -
.../posts/leetcode/1350-students-with-invalid-departments.md | 2 --
content/posts/leetcode/1355-activity-participants.md | 1 -
.../leetcode/1356-sort-integers-by-the-number-of-1-bits.md | 2 +-
.../leetcode/1364-number-of-trusted-contacts-of-a-customer.md | 1 -
.../leetcode/1369-get-the-second-most-recent-activity.md | 1 -
.../1378-replace-employee-id-with-the-unique-identifier.md | 1 -
content/posts/leetcode/1384-total-sales-amount-by-year.md | 1 -
content/posts/leetcode/1393-capital-gainloss.md | 1 -
.../1398-customers-who-bought-products-a-and-b-but-not-c.md | 1 -
content/posts/leetcode/1407-top-travellers.md | 1 -
.../leetcode/1412-find-the-quiet-students-in-all-exams.md | 1 -
content/posts/leetcode/1421-npv-queries.md | 1 -
.../leetcode/1423-maximum-points-you-can-obtain-from-cards.md | 2 +-
.../leetcode/1431-kids-with-the-greatest-number-of-candies.md | 2 +-
content/posts/leetcode/1435-create-a-session-bar-chart.md | 1 -
content/posts/leetcode/1436-destination-city.md | 2 +-
content/posts/leetcode/1440-evaluate-boolean-expression.md | 1 -
.../leetcode/1441-build-an-array-with-stack-operations.md | 2 +-
content/posts/leetcode/1445-apples-&-oranges.md | 1 -
.../1450-number-of-students-doing-homework-at-a-given-time.md | 2 +-
content/posts/leetcode/1454-active-users.md | 1 -
content/posts/leetcode/1459-rectangles-area.md | 1 -
.../1460-make-two-arrays-equal-by-reversing-subarrays.md | 2 +-
.../1464-maximum-product-of-two-elements-in-an-array.md | 2 +-
content/posts/leetcode/1468-calculate-salaries.md | 1 -
content/posts/leetcode/1470-shuffle-the-array.md | 2 +-
content/posts/leetcode/1479-sales-by-day-of-the-week.md | 1 -
.../posts/leetcode/1484-group-sold-products-by-the-date.md | 1 -
...average-salary-excluding-the-minimum-and-maximum-salary.md | 2 +-
.../leetcode/1495-friendly-movies-streamed-last-month.md | 1 -
.../posts/leetcode/1501-countries-you-can-safely-invest-in.md | 2 --
.../1502-can-make-arithmetic-progression-from-sequence.md | 2 +-
content/posts/leetcode/1511-customer-order-frequency.md | 1 -
content/posts/leetcode/1512-number-of-good-pairs.md | 4 ++--
content/posts/leetcode/1517-find-users-with-valid-e-mails.md | 1 -
.../leetcode/1523-count-odd-numbers-in-an-interval-range.md | 2 +-
content/posts/leetcode/1527-patients-with-a-condition.md | 1 -
content/posts/leetcode/1532-the-most-recent-three-orders.md | 1 -
content/posts/leetcode/1543-fix-product-name-format.md | 1 -
.../leetcode/1549-the-most-recent-orders-for-each-product.md | 1 -
content/posts/leetcode/1555-bank-account-summary.md | 1 -
.../leetcode/1561-maximum-number-of-coins-you-can-get.md | 2 +-
.../leetcode/1565-unique-orders-and-customers-per-month.md | 1 -
content/posts/leetcode/1571-warehouse-manager.md | 1 -
content/posts/leetcode/1572-matrix-diagonal-sum.md | 2 +-
...-customer-who-visited-but-did-not-make-any-transactions.md | 2 --
.../leetcode/1582-special-positions-in-a-binary-matrix.md | 2 +-
content/posts/leetcode/1587-bank-account-summary-ii.md | 1 -
.../posts/leetcode/1588-sum-of-all-odd-length-subarrays.md | 2 +-
...-the-most-frequently-ordered-products-for-each-customer.md | 1 -
content/posts/leetcode/1598-crawler-log-folder.md | 2 +-
content/posts/leetcode/1603-design-parking-system.md | 2 +-
content/posts/leetcode/1607-sellers-with-no-sales.md | 1 -
content/posts/leetcode/1613-find-the-missing-ids.md | 1 -
.../1623-all-valid-triplets-that-can-represent-a-country.md | 1 -
.../1624-largest-substring-between-two-equal-characters.md | 2 +-
.../leetcode/1633-percentage-of-users-attended-a-contest.md | 1 -
content/posts/leetcode/1635-hopper-company-queries-i.md | 1 -
content/posts/leetcode/1645-hopper-company-queries-ii.md | 1 -
content/posts/leetcode/1651-hopper-company-queries-iii.md | 1 -
.../leetcode/1658-minimum-operations-to-reduce-x-to-zero.md | 2 +-
.../leetcode/1661-average-time-of-process-per-machine.md | 2 --
.../1662-check-if-two-string-arrays-are-equivalent.md | 2 +-
content/posts/leetcode/1667-fix-names-in-a-table.md | 2 --
content/posts/leetcode/1668-maximum-repeating-substring.md | 2 +-
content/posts/leetcode/1672-richest-customer-wealth.md | 4 ++--
content/posts/leetcode/1677-product's-worth-over-invoices.md | 1 -
content/posts/leetcode/1678-goal-parser-interpretation.md | 2 +-
content/posts/leetcode/1683-invalid-tweets.md | 1 -
.../leetcode/1684-count-the-number-of-consistent-strings.md | 4 ++--
...partitioning-into-minimum-number-of-deci-binary-numbers.md | 2 +-
content/posts/leetcode/1693-daily-leads-and-partners.md | 1 -
.../leetcode/1699-number-of-calls-between-two-persons.md | 2 --
.../leetcode/1700-number-of-students-unable-to-eat-lunch.md | 2 +-
content/posts/leetcode/1709-biggest-window-between-visits.md | 1 -
content/posts/leetcode/1715-count-apples-and-oranges.md | 1 -
content/posts/leetcode/1729-find-followers-count.md | 1 -
...1-the-number-of-employees-which-report-to-each-employee.md | 1 -
content/posts/leetcode/1732-find-the-highest-altitude.md | 2 +-
.../leetcode/1741-find-total-time-spent-by-each-employee.md | 1 -
content/posts/leetcode/1747-leetflex-banned-accounts.md | 1 -
...50-minimum-length-of-string-after-deleting-similar-ends.md | 2 +-
.../leetcode/1752-check-if-array-is-sorted-and-rotated.md | 2 +-
content/posts/leetcode/1754-largest-merge-of-two-strings.md | 2 +-
.../posts/leetcode/1757-recyclable-and-low-fat-products.md | 1 -
.../1758-minimum-changes-to-make-alternating-binary-string.md | 2 +-
.../leetcode/1759-count-number-of-homogenous-substrings.md | 2 +-
.../leetcode/1767-find-the-subtasks-that-did-not-execute.md | 1 -
content/posts/leetcode/1768-merge-strings-alternately.md | 2 +-
...imum-number-of-operations-to-move-all-balls-to-each-box.md | 4 ++--
content/posts/leetcode/1773-count-items-matching-a-rule.md | 2 +-
content/posts/leetcode/1777-product's-price-for-each-store.md | 1 -
...-find-nearest-point-that-has-the-same-x-or-y-coordinate.md | 2 +-
content/posts/leetcode/1783-grand-slam-titles.md | 2 --
.../1785-minimum-elements-to-add-to-form-a-given-sum.md | 2 +-
.../leetcode/1789-primary-department-for-each-employee.md | 1 -
.../1790-check-if-one-string-swap-can-make-strings-equal.md | 2 +-
content/posts/leetcode/1795-rearrange-products-table.md | 1 -
.../posts/leetcode/1796-second-largest-digit-in-a-string.md | 2 +-
content/posts/leetcode/1800-maximum-ascending-subarray-sum.md | 2 +-
content/posts/leetcode/1809-ad-free-sessions.md | 1 -
content/posts/leetcode/1811-find-interview-candidates.md | 1 -
.../leetcode/1812-determine-color-of-a-chessboard-square.md | 2 +-
.../1821-find-customers-with-positive-revenue-this-year.md | 1 -
.../posts/leetcode/1822-sign-of-the-product-of-an-array.md | 2 +-
.../1827-minimum-operations-to-make-the-array-increasing.md | 2 +-
.../1828-queries-on-number-of-points-inside-a-circle.md | 2 +-
content/posts/leetcode/1831-maximum-transaction-each-day.md | 1 -
.../posts/leetcode/1832-check-if-the-sentence-is-pangram.md | 4 ++--
content/posts/leetcode/1837-sum-of-digits-in-base-k.md | 2 +-
content/posts/leetcode/1841-league-statistics.md | 1 -
content/posts/leetcode/1843-suspicious-bank-accounts.md | 2 --
.../posts/leetcode/1844-replace-all-digits-with-characters.md | 2 +-
content/posts/leetcode/1853-convert-date-format.md | 1 -
.../1867-orders-with-maximum-quantity-above-average.md | 1 -
content/posts/leetcode/1873-calculate-special-bonus.md | 1 -
.../posts/leetcode/1875-group-employees-of-the-same-salary.md | 1 -
.../1880-check-if-word-equals-summation-of-two-words.md | 2 +-
content/posts/leetcode/1890-the-latest-login-in-2020.md | 1 -
content/posts/leetcode/1892-page-recommendations-ii.md | 1 -
content/posts/leetcode/1907-count-salary-categories.md | 2 --
.../posts/leetcode/1917-leetcodify-friends-recommendations.md | 1 -
content/posts/leetcode/1919-leetcodify-similar-friends.md | 1 -
content/posts/leetcode/1920-build-array-from-permutation.md | 2 +-
content/posts/leetcode/1929-concatenation-of-array.md | 2 +-
content/posts/leetcode/1934-confirmation-rate.md | 1 -
.../1939-users-that-actively-request-confirmation-messages.md | 1 -
.../leetcode/1944-number-of-visible-people-in-a-queue.md | 2 +-
content/posts/leetcode/1949-strong-friendship.md | 1 -
...l-the-pairs-with-the-maximum-number-of-common-followers.md | 1 -
.../posts/leetcode/1965-employees-with-missing-information.md | 1 -
.../leetcode/1972-first-and-last-call-on-the-same-day.md | 1 -
.../leetcode/1978-employees-whose-manager-left-the-company.md | 2 --
.../posts/leetcode/1988-find-cutoff-score-for-each-school.md | 1 -
.../posts/leetcode/1990-count-the-number-of-experiments.md | 1 -
...4-the-number-of-seniors-and-juniors-to-join-the-company.md | 1 -
...he-number-of-seniors-and-juniors-to-join-the-company-ii.md | 1 -
...011-final-value-of-variable-after-performing-operations.md | 2 +-
.../leetcode/2020-number-of-accounts-that-did-not-stream.md | 1 -
content/posts/leetcode/2026-low-quality-problems.md | 1 -
.../posts/leetcode/2027-minimum-moves-to-convert-string.md | 2 +-
.../leetcode/2037-minimum-number-of-moves-to-seat-everyone.md | 2 +-
.../leetcode/2041-accepted-candidates-from-the-interviews.md | 1 -
.../2042-check-if-numbers-are-ascending-in-a-sentence.md | 2 +-
.../leetcode/2051-the-category-of-each-member-in-the-store.md | 1 -
content/posts/leetcode/2066-account-balance.md | 1 -
content/posts/leetcode/2072-the-winner-university.md | 1 -
content/posts/leetcode/2079-watering-plants.md | 2 +-
content/posts/leetcode/2082-the-number-of-rich-customers.md | 1 -
...084-drop-type-1-orders-for-customers-with-type-0-orders.md | 2 --
content/posts/leetcode/2103-rings-and-rods.md | 2 +-
.../2108-find-first-palindromic-string-in-the-array.md | 2 +-
.../posts/leetcode/2112-the-airport-with-the-most-traffic.md | 1 -
.../2114-maximum-number-of-words-found-in-sentences.md | 2 +-
content/posts/leetcode/2118-build-the-equation.md | 1 -
...-execution-of-all-suffix-instructions-staying-in-a-grid.md | 2 +-
.../posts/leetcode/2125-number-of-laser-beams-in-a-bank.md | 2 +-
.../leetcode/2142-the-number-of-passengers-in-each-bus-i.md | 1 -
.../leetcode/2153-the-number-of-passengers-in-each-bus-ii.md | 1 -
.../posts/leetcode/2159-order-two-columns-independently.md | 1 -
...minimum-sum-of-four-digit-number-after-splitting-digits.md | 2 +-
content/posts/leetcode/2173-longest-winning-streak.md | 1 -
content/posts/leetcode/2175-the-change-in-global-rankings.md | 1 -
.../2176-count-equal-and-divisible-pairs-in-an-array.md | 2 +-
content/posts/leetcode/2181-merge-nodes-in-between-zeros.md | 2 +-
.../posts/leetcode/2185-counting-words-with-a-given-prefix.md | 2 +-
content/posts/leetcode/2199-finding-the-topic-of-each-post.md | 1 -
...2205-the-number-of-users-that-are-eligible-for-discount.md | 1 -
.../leetcode/2220-minimum-bit-flips-to-convert-number.md | 2 +-
.../2228-users-with-two-purchases-within-seven-days.md | 1 -
.../leetcode/2230-the-users-that-are-eligible-for-discount.md | 1 -
content/posts/leetcode/2235-add-two-integers.md | 2 +-
content/posts/leetcode/2236-root-equals-sum-of-children.md | 2 +-
.../leetcode/2238-number-of-times-a-driver-was-a-passenger.md | 1 -
content/posts/leetcode/2252-dynamic-pivoting-of-a-table.md | 1 -
content/posts/leetcode/2253-dynamic-unpivoting-of-a-table.md | 1 -
...3-check-if-number-has-equal-digit-count-and-digit-value.md | 2 +-
.../2287-rearrange-characters-to-make-target-string.md | 2 +-
...ucts-with-three-or-more-orders-in-two-consecutive-years.md | 2 --
content/posts/leetcode/2293-min-max-game.md | 2 +-
content/posts/leetcode/2298-tasks-count-in-the-weekend.md | 1 -
content/posts/leetcode/2299-strong-password-checker-ii.md | 2 +-
content/posts/leetcode/2308-arrange-table-by-gender.md | 2 --
...e-first-day-of-the-maximum-recorded-degree-in-each-city.md | 1 -
content/posts/leetcode/2315-count-asterisks.md | 2 +-
content/posts/leetcode/2319-check-if-matrix-is-x-matrix.md | 2 +-
content/posts/leetcode/2324-product-sales-analysis-iv.md | 1 -
content/posts/leetcode/2325-decode-the-message.md | 2 +-
content/posts/leetcode/2329-product-sales-analysis-v.md | 1 -
content/posts/leetcode/2331-evaluate-boolean-binary-tree.md | 2 +-
content/posts/leetcode/2339-all-the-matches-of-the-league.md | 1 -
.../posts/leetcode/2341-maximum-number-of-pairs-in-array.md | 2 +-
.../posts/leetcode/2346-compute-the-rank-as-a-percentage.md | 1 -
content/posts/leetcode/2347-best-poker-hand.md | 2 +-
content/posts/leetcode/2351-first-letter-to-appear-twice.md | 4 ++--
.../2356-number-of-unique-subjects-taught-by-each-teacher.md | 1 -
.../2357-make-array-zero-by-subtracting-equal-amounts.md | 2 +-
content/posts/leetcode/2362-generate-the-invoice.md | 1 -
content/posts/leetcode/2363-merge-similar-items.md | 2 +-
.../2372-calculate-the-influence-of-each-salesperson.md | 1 -
content/posts/leetcode/2377-sort-the-olympic-table.md | 1 -
...2379-minimum-recolors-to-get-k-consecutive-black-blocks.md | 2 +-
.../2383-minimum-hours-of-training-to-win-a-competition.md | 2 +-
...388-change-null-values-in-a-table-to-the-previous-value.md | 2 --
content/posts/leetcode/2394-employees-with-deductions.md | 1 -
content/posts/leetcode/2395-find-subarrays-with-equal-sum.md | 2 +-
content/posts/leetcode/2396-strictly-palindromic-number.md | 2 +-
.../leetcode/2399-check-distances-between-same-letters.md | 2 +-
content/posts/leetcode/2413-smallest-even-multiple.md | 2 +-
...length-of-the-longest-alphabetical-continuous-substring.md | 2 +-
.../2432-the-employee-that-worked-on-the-longest-task.md | 2 +-
.../leetcode/2433-find-the-original-array-of-prefix-xor.md | 2 +-
content/posts/leetcode/2443-sum-of-number-and-its-reverse.md | 2 +-
.../posts/leetcode/2444-count-subarrays-with-fixed-bounds.md | 2 +-
...erage-value-of-even-numbers-that-are-divisible-by-three.md | 2 +-
content/posts/leetcode/2469-convert-the-temperature.md | 2 +-
.../2474-customers-with-strictly-increasing-purchases.md | 1 -
content/posts/leetcode/2480-form-a-chemical-bond.md | 1 -
...482-difference-between-ones-and-zeros-in-row-and-column.md | 2 +-
.../2494-merge-overlapping-events-in-the-same-hall.md | 1 -
.../leetcode/2496-maximum-value-of-a-string-in-an-array.md | 2 +-
.../leetcode/2504-concatenate-the-name-and-the-profession.md | 1 -
...-shortest-distance-to-target-string-in-a-circular-array.md | 2 +-
.../leetcode/2520-count-the-digits-that-divide-a-number.md | 2 +-
...-maximum-count-of-positive-integer-and-negative-integer.md | 4 ++--
...ifference-between-element-sum-and-digit-sum-of-an-array.md | 2 +-
content/posts/leetcode/2540-minimum-common-value.md | 2 +-
.../2541-minimum-operations-to-make-array-equal-ii.md | 2 +-
content/posts/leetcode/2544-alternating-digit-sum.md | 2 +-
.../2546-apply-bitwise-operations-to-make-strings-equal.md | 2 +-
.../posts/leetcode/2553-separate-the-digits-in-an-array.md | 2 +-
...554-maximum-number-of-integers-to-choose-from-a-range-i.md | 2 +-
.../posts/leetcode/2562-find-the-array-concatenation-value.md | 2 +-
.../leetcode/2566-maximum-difference-by-remapping-a-digit.md | 2 +-
.../leetcode/2567-minimum-score-by-changing-two-elements.md | 2 +-
content/posts/leetcode/2574-left-and-right-sum-differences.md | 2 +-
.../leetcode/2575-find-the-divisibility-array-of-a-string.md | 2 +-
content/posts/leetcode/2668-find-latest-salaries.md | 1 -
.../2669-count-artist-occurrences-on-spotify-ranking-list.md | 1 -
content/posts/leetcode/2686-immediate-food-delivery-iii.md | 1 -
content/posts/leetcode/2687-bikes-last-time-used.md | 1 -
content/posts/leetcode/2688-find-active-users.md | 1 -
.../2701-consecutive-transactions-with-increasing-amounts.md | 1 -
content/posts/leetcode/2720-popularity-percentage.md | 1 -
content/posts/leetcode/2738-count-occurrences-in-text.md | 1 -
...with-maximum-number-of-transactions-on-consecutive-days.md | 1 -
.../leetcode/2783-flight-occupancy-and-waitlist-analysis.md | 1 -
content/posts/leetcode/2793-status-of-flight-tickets.md | 1 -
content/posts/leetcode/2820-election-results.md | 1 -
content/posts/leetcode/2837-total-traveled-distance.md | 1 -
content/posts/leetcode/2853-highest-salaries-difference.md | 1 -
content/posts/leetcode/2854-rolling-average-steps.md | 1 -
.../leetcode/2893-calculate-orders-within-each-interval.md | 2 --
content/posts/leetcode/2922-market-analysis-iii.md | 1 -
content/posts/leetcode/2978-symmetric-coordinates.md | 1 -
.../leetcode/2984-find-peak-calling-hours-for-each-city.md | 1 -
content/posts/leetcode/2985-calculate-compressed-mean.md | 1 -
content/posts/leetcode/2986-find-third-transaction.md | 1 -
content/posts/leetcode/2987-find-expensive-cities.md | 1 -
.../posts/leetcode/2988-manager-of-the-largest-department.md | 1 -
content/posts/leetcode/2989-class-performance.md | 1 -
content/posts/leetcode/2990-loan-types.md | 1 -
content/posts/leetcode/2991-top-three-wineries.md | 1 -
content/posts/leetcode/2993-friday-purchases-i.md | 1 -
content/posts/leetcode/2994-friday-purchases-ii.md | 1 -
content/posts/leetcode/2995-viewers-turned-streamers.md | 1 -
411 files changed, 169 insertions(+), 482 deletions(-)
diff --git a/content/posts/leetcode/0007-reverse-integer.md b/content/posts/leetcode/0007-reverse-integer.md
index b83356176..dbcdf6604 100644
--- a/content/posts/leetcode/0007-reverse-integer.md
+++ b/content/posts/leetcode/0007-reverse-integer.md
@@ -197,8 +197,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int reverse(int x) {
int ans = 0;
for (; x != 0; x /= 10) {
diff --git a/content/posts/leetcode/0041-first-missing-positive.md b/content/posts/leetcode/0041-first-missing-positive.md
index 55ad5c127..209066719 100644
--- a/content/posts/leetcode/0041-first-missing-positive.md
+++ b/content/posts/leetcode/0041-first-missing-positive.md
@@ -240,8 +240,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int firstMissingPositive(int* nums, int numsSize) {
int Max = nums[0], i, *Count;
diff --git a/content/posts/leetcode/0045-jump-game-ii.md b/content/posts/leetcode/0045-jump-game-ii.md
index 0dd638812..4f43bbb7a 100644
--- a/content/posts/leetcode/0045-jump-game-ii.md
+++ b/content/posts/leetcode/0045-jump-game-ii.md
@@ -197,8 +197,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) a < b ? a : b
int jump(int* nums, int numsSize) {
int dp[numsSize];
diff --git a/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md b/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md
index beb108fc0..c98d350ee 100644
--- a/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md
+++ b/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md
@@ -233,8 +233,8 @@ var maxDepth = function (root) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md b/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md
index f2921fbe3..7a32592e3 100644
--- a/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md
+++ b/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md
@@ -382,8 +382,8 @@ var sortedListToBST = function (head) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for singly-linked list.
* struct ListNode {
diff --git a/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md b/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md
index 492b91e08..60102ca62 100644
--- a/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md
+++ b/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md
@@ -273,8 +273,8 @@ var minDepth = function (root) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md b/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md
index 4f394d265..9fd3e8ad5 100644
--- a/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md
+++ b/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md
@@ -290,8 +290,8 @@ var sumNumbers = function (root) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0136-single-number.md b/content/posts/leetcode/0136-single-number.md
index 67c539896..80006ce4a 100644
--- a/content/posts/leetcode/0136-single-number.md
+++ b/content/posts/leetcode/0136-single-number.md
@@ -148,8 +148,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int singleNumber(int* nums, int numsSize) {
int ans = 0;
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/0137-single-number-ii.md b/content/posts/leetcode/0137-single-number-ii.md
index b27c4a037..1b007ac78 100644
--- a/content/posts/leetcode/0137-single-number-ii.md
+++ b/content/posts/leetcode/0137-single-number-ii.md
@@ -153,8 +153,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int singleNumber(int* nums, int numsSize) {
int ans = 0;
for (int i = 0; i < 32; i++) {
diff --git a/content/posts/leetcode/0175-combine-two-tables.md b/content/posts/leetcode/0175-combine-two-tables.md
index 3868e997e..2d945327e 100644
--- a/content/posts/leetcode/0175-combine-two-tables.md
+++ b/content/posts/leetcode/0175-combine-two-tables.md
@@ -110,7 +110,6 @@ def combine_two_tables(person: pd.DataFrame, address: pd.DataFrame) -> pd.DataFr
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT firstName, lastName, city, state
FROM
diff --git a/content/posts/leetcode/0176-second-highest-salary.md b/content/posts/leetcode/0176-second-highest-salary.md
index 17c28f708..157c91393 100644
--- a/content/posts/leetcode/0176-second-highest-salary.md
+++ b/content/posts/leetcode/0176-second-highest-salary.md
@@ -109,7 +109,6 @@ def second_highest_salary(employee: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
(
@@ -128,7 +127,6 @@ SELECT
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT MAX(salary) AS SecondHighestSalary
FROM Employee
@@ -143,7 +141,6 @@ WHERE salary < (SELECT MAX(salary) FROM Employee);
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH T AS (SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) AS rk FROM Employee)
SELECT (SELECT DISTINCT salary FROM T WHERE rk = 2) AS SecondHighestSalary;
diff --git a/content/posts/leetcode/0177-nth-highest-salary.md b/content/posts/leetcode/0177-nth-highest-salary.md
index e749d3866..8dd23cb4d 100644
--- a/content/posts/leetcode/0177-nth-highest-salary.md
+++ b/content/posts/leetcode/0177-nth-highest-salary.md
@@ -101,7 +101,6 @@ def nth_highest_salary(employee: pd.DataFrame, N: int) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INT
BEGIN
SET N = N - 1;
diff --git a/content/posts/leetcode/0178-rank-scores.md b/content/posts/leetcode/0178-rank-scores.md
index af1318962..764c076a1 100644
--- a/content/posts/leetcode/0178-rank-scores.md
+++ b/content/posts/leetcode/0178-rank-scores.md
@@ -98,7 +98,6 @@ def order_scores(scores: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
score,
@@ -114,7 +113,6 @@ FROM Scores;
```sql
-{{< /terminal >}}
SELECT
Score,
CONVERT(rk, SIGNED) `Rank`
diff --git a/content/posts/leetcode/0180-consecutive-numbers.md b/content/posts/leetcode/0180-consecutive-numbers.md
index b0ba4d05b..799c97703 100644
--- a/content/posts/leetcode/0180-consecutive-numbers.md
+++ b/content/posts/leetcode/0180-consecutive-numbers.md
@@ -95,7 +95,6 @@ def consecutive_numbers(logs: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT l2.num AS ConsecutiveNums
FROM
@@ -116,7 +115,6 @@ We can also group the numbers by using the `IF` function to determine whether th
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -139,7 +137,6 @@ WHERE a = num AND b = num;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md b/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md
index d219906ab..2677f3d55 100644
--- a/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md
+++ b/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md
@@ -85,7 +85,6 @@ def find_employees(employee: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
SELECT Name AS Employee
FROM Employee AS Curr
WHERE
@@ -104,7 +103,6 @@ WHERE
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
e1.name AS Employee
diff --git a/content/posts/leetcode/0182-duplicate-emails.md b/content/posts/leetcode/0182-duplicate-emails.md
index 7706ba82c..3309a7715 100644
--- a/content/posts/leetcode/0182-duplicate-emails.md
+++ b/content/posts/leetcode/0182-duplicate-emails.md
@@ -85,7 +85,6 @@ def duplicate_emails(person: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT email
FROM Person
@@ -103,7 +102,6 @@ We can use a self-join to join the `Person` table with itself, and then filter o
```sql
-{{< /terminal >}}
SELECT DISTINCT p1.email
FROM
person AS p1,
diff --git a/content/posts/leetcode/0183-customers-who-never-order.md b/content/posts/leetcode/0183-customers-who-never-order.md
index 88064c53a..994451c0b 100644
--- a/content/posts/leetcode/0183-customers-who-never-order.md
+++ b/content/posts/leetcode/0183-customers-who-never-order.md
@@ -111,7 +111,6 @@ def find_customers(customers: pd.DataFrame, orders: pd.DataFrame) -> pd.DataFram
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name AS Customers
FROM Customers
@@ -132,7 +131,6 @@ Use `LEFT JOIN` to join the tables and return the data where `CustomerId` is `NU
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name AS Customers
FROM
diff --git a/content/posts/leetcode/0184-department-highest-salary.md b/content/posts/leetcode/0184-department-highest-salary.md
index 377eb978f..f6c6af83b 100644
--- a/content/posts/leetcode/0184-department-highest-salary.md
+++ b/content/posts/leetcode/0184-department-highest-salary.md
@@ -100,7 +100,6 @@ We can use an equi-join to join the `Employee` table and the `Department` table
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT d.name AS department, e.name AS employee, salary
FROM
@@ -124,7 +123,6 @@ We can use an equi-join to join the `Employee` table and the `Department` table
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0185-department-top-three-salaries.md b/content/posts/leetcode/0185-department-top-three-salaries.md
index 86c79fca8..6d650c332 100644
--- a/content/posts/leetcode/0185-department-top-three-salaries.md
+++ b/content/posts/leetcode/0185-department-top-three-salaries.md
@@ -139,7 +139,6 @@ def top_three_salaries(
{{< /terminal >}}
```sql
-{{< /terminal >}}
SELECT
Department.NAME AS Department,
Employee.NAME AS Employee,
@@ -165,7 +164,6 @@ WHERE
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0191-number-of-1-bits.md b/content/posts/leetcode/0191-number-of-1-bits.md
index 1fda8f90a..4810727b7 100644
--- a/content/posts/leetcode/0191-number-of-1-bits.md
+++ b/content/posts/leetcode/0191-number-of-1-bits.md
@@ -166,8 +166,8 @@ var hammingWeight = function (n) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int hammingWeight(uint32_t n) {
int ans = 0;
while (n) {
diff --git a/content/posts/leetcode/0196-delete-duplicate-emails.md b/content/posts/leetcode/0196-delete-duplicate-emails.md
index 73ec62735..66feeffed 100644
--- a/content/posts/leetcode/0196-delete-duplicate-emails.md
+++ b/content/posts/leetcode/0196-delete-duplicate-emails.md
@@ -88,7 +88,6 @@ def delete_duplicate_emails(person: pd.DataFrame) -> None:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
DELETE FROM Person
WHERE id NOT IN (SELECT MIN(id) FROM (SELECT * FROM Person) AS p GROUP BY email);
@@ -102,7 +101,6 @@ WHERE id NOT IN (SELECT MIN(id) FROM (SELECT * FROM Person) AS p GROUP BY email)
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
DELETE FROM Person
WHERE
@@ -130,7 +128,6 @@ WHERE
```sql
-{{< /terminal >}}
DELETE p2
FROM
person AS p1
diff --git a/content/posts/leetcode/0197-rising-temperature.md b/content/posts/leetcode/0197-rising-temperature.md
index 0c0b8bc2b..4e7331b6d 100644
--- a/content/posts/leetcode/0197-rising-temperature.md
+++ b/content/posts/leetcode/0197-rising-temperature.md
@@ -89,7 +89,6 @@ def rising_temperature(weather: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT w1.id
FROM
@@ -106,7 +105,6 @@ FROM
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT w1.id
FROM
diff --git a/content/posts/leetcode/0202-happy-number.md b/content/posts/leetcode/0202-happy-number.md
index 581f653c2..cf483b44e 100644
--- a/content/posts/leetcode/0202-happy-number.md
+++ b/content/posts/leetcode/0202-happy-number.md
@@ -191,8 +191,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int getNext(int n) {
int res = 0;
while (n) {
diff --git a/content/posts/leetcode/0217-contains-duplicate.md b/content/posts/leetcode/0217-contains-duplicate.md
index 6aa278216..b0c49a664 100644
--- a/content/posts/leetcode/0217-contains-duplicate.md
+++ b/content/posts/leetcode/0217-contains-duplicate.md
@@ -178,8 +178,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/0237-delete-node-in-a-linked-list.md b/content/posts/leetcode/0237-delete-node-in-a-linked-list.md
index dbec40c06..803b94de4 100644
--- a/content/posts/leetcode/0237-delete-node-in-a-linked-list.md
+++ b/content/posts/leetcode/0237-delete-node-in-a-linked-list.md
@@ -217,8 +217,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for singly-linked list.
* struct ListNode {
diff --git a/content/posts/leetcode/0242-valid-anagram.md b/content/posts/leetcode/0242-valid-anagram.md
index f61a0f8f2..6f7f64f85 100644
--- a/content/posts/leetcode/0242-valid-anagram.md
+++ b/content/posts/leetcode/0242-valid-anagram.md
@@ -211,8 +211,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(char*) a - *(char*) b;
}
@@ -265,8 +265,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool isAnagram(char* s, char* t) {
int n = strlen(s);
int m = strlen(t);
diff --git a/content/posts/leetcode/0262-trips-and-users.md b/content/posts/leetcode/0262-trips-and-users.md
index 9b2d4a3b5..6b91a7296 100644
--- a/content/posts/leetcode/0262-trips-and-users.md
+++ b/content/posts/leetcode/0262-trips-and-users.md
@@ -178,7 +178,6 @@ def trips_and_users(trips: pd.DataFrame, users: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
request_at AS Day,
diff --git a/content/posts/leetcode/0283-move-zeroes.md b/content/posts/leetcode/0283-move-zeroes.md
index 9c15fdeb0..bb00b4ffc 100644
--- a/content/posts/leetcode/0283-move-zeroes.md
+++ b/content/posts/leetcode/0283-move-zeroes.md
@@ -171,8 +171,8 @@ var moveZeroes = function (nums) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
void moveZeroes(int* nums, int numsSize) {
int i = 0;
for (int j = 0; j < numsSize; j++) {
diff --git a/content/posts/leetcode/0303-range-sum-query---immutable.md b/content/posts/leetcode/0303-range-sum-query---immutable.md
index 749a737e7..c4e9470ef 100644
--- a/content/posts/leetcode/0303-range-sum-query---immutable.md
+++ b/content/posts/leetcode/0303-range-sum-query---immutable.md
@@ -284,8 +284,8 @@ class NumArray {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
typedef struct {
int* s;
} NumArray;
diff --git a/content/posts/leetcode/0343-integer-break.md b/content/posts/leetcode/0343-integer-break.md
index 4248dd479..33ad93ec6 100644
--- a/content/posts/leetcode/0343-integer-break.md
+++ b/content/posts/leetcode/0343-integer-break.md
@@ -143,8 +143,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int integerBreak(int n) {
if (n < 4) {
return n - 1;
diff --git a/content/posts/leetcode/0367-valid-perfect-square.md b/content/posts/leetcode/0367-valid-perfect-square.md
index af5859f78..0d4cdeecf 100644
--- a/content/posts/leetcode/0367-valid-perfect-square.md
+++ b/content/posts/leetcode/0367-valid-perfect-square.md
@@ -178,7 +178,6 @@ impl Solution {
This is a math problem：
```bash
-{{< /terminal >}}
1 = 1
4 = 1 + 3
9 = 1 + 3 + 5
diff --git a/content/posts/leetcode/0389-find-the-difference.md b/content/posts/leetcode/0389-find-the-difference.md
index 7204a8c2e..120528b4a 100644
--- a/content/posts/leetcode/0389-find-the-difference.md
+++ b/content/posts/leetcode/0389-find-the-difference.md
@@ -174,8 +174,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char findTheDifference(char* s, char* t) {
int n = strlen(s);
int cnt[26] = {0};
@@ -291,8 +291,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char findTheDifference(char* s, char* t) {
int n = strlen(s);
char ans = 0;
diff --git a/content/posts/leetcode/0392-is-subsequence.md b/content/posts/leetcode/0392-is-subsequence.md
index 862f1b84c..9eba152d9 100644
--- a/content/posts/leetcode/0392-is-subsequence.md
+++ b/content/posts/leetcode/0392-is-subsequence.md
@@ -172,8 +172,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool isSubsequence(char* s, char* t) {
int m = strlen(s);
int n = strlen(t);
diff --git a/content/posts/leetcode/0404-sum-of-left-leaves.md b/content/posts/leetcode/0404-sum-of-left-leaves.md
index 277a545c8..c32eaad41 100644
--- a/content/posts/leetcode/0404-sum-of-left-leaves.md
+++ b/content/posts/leetcode/0404-sum-of-left-leaves.md
@@ -211,8 +211,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0511-game-play-analysis-i.md b/content/posts/leetcode/0511-game-play-analysis-i.md
index 9c6198b79..89cb40896 100644
--- a/content/posts/leetcode/0511-game-play-analysis-i.md
+++ b/content/posts/leetcode/0511-game-play-analysis-i.md
@@ -91,7 +91,6 @@ def game_analysis(activity: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT player_id, MIN(event_date) AS first_login
FROM Activity
diff --git a/content/posts/leetcode/0512-game-play-analysis-ii.md b/content/posts/leetcode/0512-game-play-analysis-ii.md
index 34bde38a1..3d3384b72 100644
--- a/content/posts/leetcode/0512-game-play-analysis-ii.md
+++ b/content/posts/leetcode/0512-game-play-analysis-ii.md
@@ -77,7 +77,6 @@ We can use `GROUP BY` and `MIN` functions to find the first login date for each
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
player_id,
@@ -103,7 +102,6 @@ We can use the window function `rank()`, which assigns a rank to each login date
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0534-game-play-analysis-iii.md b/content/posts/leetcode/0534-game-play-analysis-iii.md
index 82e61d650..da3bb1e55 100644
--- a/content/posts/leetcode/0534-game-play-analysis-iii.md
+++ b/content/posts/leetcode/0534-game-play-analysis-iii.md
@@ -83,7 +83,6 @@ We can use the window function `SUM() OVER()` to group by `player_id`, sort by `
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
player_id,
@@ -105,7 +104,6 @@ We can also use a self-join to join the `Activity` table with itself on the cond
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
t1.player_id,
@@ -126,7 +124,6 @@ GROUP BY 1, 2;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
t1.player_id,
diff --git a/content/posts/leetcode/0540-single-element-in-a-sorted-array.md b/content/posts/leetcode/0540-single-element-in-a-sorted-array.md
index 1d0a6729e..8f37b01e1 100644
--- a/content/posts/leetcode/0540-single-element-in-a-sorted-array.md
+++ b/content/posts/leetcode/0540-single-element-in-a-sorted-array.md
@@ -158,8 +158,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int singleNonDuplicate(int* nums, int numsSize) {
int left = 0;
int right = numsSize - 1;
diff --git a/content/posts/leetcode/0543-diameter-of-binary-tree.md b/content/posts/leetcode/0543-diameter-of-binary-tree.md
index 46a01097c..5ffdecef7 100644
--- a/content/posts/leetcode/0543-diameter-of-binary-tree.md
+++ b/content/posts/leetcode/0543-diameter-of-binary-tree.md
@@ -256,8 +256,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0550-game-play-analysis-iv.md b/content/posts/leetcode/0550-game-play-analysis-iv.md
index 59b48994b..6a91ad02a 100644
--- a/content/posts/leetcode/0550-game-play-analysis-iv.md
+++ b/content/posts/leetcode/0550-game-play-analysis-iv.md
@@ -92,7 +92,6 @@ def gameplay_analysis(activity: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT ROUND(AVG(b.event_date IS NOT NULL), 2) AS fraction
FROM
@@ -115,7 +114,6 @@ We can use the `LEAD` window function to get the next login date of each player.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0566-reshape-the-matrix.md b/content/posts/leetcode/0566-reshape-the-matrix.md
index f661979b7..1a59f2795 100644
--- a/content/posts/leetcode/0566-reshape-the-matrix.md
+++ b/content/posts/leetcode/0566-reshape-the-matrix.md
@@ -183,8 +183,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
diff --git a/content/posts/leetcode/0569-median-employee-salary.md b/content/posts/leetcode/0569-median-employee-salary.md
index db69f3949..264c4ea36 100644
--- a/content/posts/leetcode/0569-median-employee-salary.md
+++ b/content/posts/leetcode/0569-median-employee-salary.md
@@ -123,7 +123,6 @@ For company C, the rows sorted are as follows:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/0570-managers-with-at-least-5-direct-reports.md b/content/posts/leetcode/0570-managers-with-at-least-5-direct-reports.md
index c77bf9b22..3cea611db 100644
--- a/content/posts/leetcode/0570-managers-with-at-least-5-direct-reports.md
+++ b/content/posts/leetcode/0570-managers-with-at-least-5-direct-reports.md
@@ -103,7 +103,6 @@ def find_managers(employee: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name
FROM
diff --git a/content/posts/leetcode/0571-find-median-given-frequency-of-numbers.md b/content/posts/leetcode/0571-find-median-given-frequency-of-numbers.md
index 6b30353bd..006e9109a 100644
--- a/content/posts/leetcode/0571-find-median-given-frequency-of-numbers.md
+++ b/content/posts/leetcode/0571-find-median-given-frequency-of-numbers.md
@@ -71,7 +71,6 @@ If we decompress the Numbers table, we will get [0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/0574-winning-candidate.md b/content/posts/leetcode/0574-winning-candidate.md
index ccc57d776..e8fa3b3a8 100644
--- a/content/posts/leetcode/0574-winning-candidate.md
+++ b/content/posts/leetcode/0574-winning-candidate.md
@@ -99,7 +99,6 @@ The winner is candidate B.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
Name
@@ -123,7 +122,6 @@ FROM
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name
FROM
diff --git a/content/posts/leetcode/0577-employee-bonus.md b/content/posts/leetcode/0577-employee-bonus.md
index f6a03fef0..f8ecc1f50 100644
--- a/content/posts/leetcode/0577-employee-bonus.md
+++ b/content/posts/leetcode/0577-employee-bonus.md
@@ -98,7 +98,6 @@ We can use a left join to join the `Employee` table and the `Bonus` table on `em
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name, bonus
FROM
diff --git a/content/posts/leetcode/0578-get-highest-answer-rate-question.md b/content/posts/leetcode/0578-get-highest-answer-rate-question.md
index dd65fbe93..41d322f7c 100644
--- a/content/posts/leetcode/0578-get-highest-answer-rate-question.md
+++ b/content/posts/leetcode/0578-get-highest-answer-rate-question.md
@@ -79,7 +79,6 @@ Question 285 has the highest answer rate.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT question_id AS survey_log
FROM SurveyLog
@@ -96,7 +95,6 @@ LIMIT 1;
```sql
-{{< /terminal >}}
WITH
T AS (
SELECT
diff --git a/content/posts/leetcode/0579-find-cumulative-salary-of-an-employee.md b/content/posts/leetcode/0579-find-cumulative-salary-of-an-employee.md
index 8f90d9387..055b5d40e 100644
--- a/content/posts/leetcode/0579-find-cumulative-salary-of-an-employee.md
+++ b/content/posts/leetcode/0579-find-cumulative-salary-of-an-employee.md
@@ -128,7 +128,6 @@ So the cumulative salary summary for this employee is:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
id,
@@ -158,7 +157,6 @@ ORDER BY id, month DESC;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0580-count-student-number-in-departments.md b/content/posts/leetcode/0580-count-student-number-in-departments.md
index d5633d676..e71c45e95 100644
--- a/content/posts/leetcode/0580-count-student-number-in-departments.md
+++ b/content/posts/leetcode/0580-count-student-number-in-departments.md
@@ -98,7 +98,6 @@ We can use a left join to join the `Department` table and the `Student` table on
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT dept_name, COUNT(student_id) AS student_number
FROM
diff --git a/content/posts/leetcode/0584-find-customer-referee.md b/content/posts/leetcode/0584-find-customer-referee.md
index 7750233f9..46466c4b8 100644
--- a/content/posts/leetcode/0584-find-customer-referee.md
+++ b/content/posts/leetcode/0584-find-customer-referee.md
@@ -77,7 +77,6 @@ We can directly filter out the customer names whose `referee_id` is not `2`. Not
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name
FROM Customer
diff --git a/content/posts/leetcode/0585-investments-in-2016.md b/content/posts/leetcode/0585-investments-in-2016.md
index 257d9ca38..d0159fdfd 100644
--- a/content/posts/leetcode/0585-investments-in-2016.md
+++ b/content/posts/leetcode/0585-investments-in-2016.md
@@ -87,7 +87,6 @@ So, the result is the sum of tiv_2016 of the first and last record, which is 45.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0586-customer-placing-the-largest-number-of-orders.md b/content/posts/leetcode/0586-customer-placing-the-largest-number-of-orders.md
index 0d1733551..d7d5a4053 100644
--- a/content/posts/leetcode/0586-customer-placing-the-largest-number-of-orders.md
+++ b/content/posts/leetcode/0586-customer-placing-the-largest-number-of-orders.md
@@ -77,7 +77,6 @@ We can use `GROUP BY` to group the data by `customer_number`, and then sort the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
customer_number
@@ -95,7 +94,6 @@ LIMIT 1;
```sql
-{{< /terminal >}}
/* Write your T-SQL query statement below */
SELECT TOP 1
customer_number
diff --git a/content/posts/leetcode/0589-n-ary-tree-preorder-traversal.md b/content/posts/leetcode/0589-n-ary-tree-preorder-traversal.md
index d17cc0775..49519b1a6 100644
--- a/content/posts/leetcode/0589-n-ary-tree-preorder-traversal.md
+++ b/content/posts/leetcode/0589-n-ary-tree-preorder-traversal.md
@@ -234,8 +234,8 @@ function preorder(root: Node | null): number[] {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a Node.
* struct Node {
diff --git a/content/posts/leetcode/0595-big-countries.md b/content/posts/leetcode/0595-big-countries.md
index e74d3b519..321d3166d 100644
--- a/content/posts/leetcode/0595-big-countries.md
+++ b/content/posts/leetcode/0595-big-countries.md
@@ -81,7 +81,6 @@ World table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name, population, area
FROM World
@@ -96,7 +95,6 @@ WHERE area >= 3000000 OR population >= 25000000;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name, population, area
FROM World
diff --git a/content/posts/leetcode/0596-classes-more-than-5-students.md b/content/posts/leetcode/0596-classes-more-than-5-students.md
index 533216e1a..54ab8f1f1 100644
--- a/content/posts/leetcode/0596-classes-more-than-5-students.md
+++ b/content/posts/leetcode/0596-classes-more-than-5-students.md
@@ -81,7 +81,6 @@ We can use the `GROUP BY` statement to group by class and then use the `HAVING`
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT class
FROM Courses
diff --git a/content/posts/leetcode/0597-friend-requests-i-overall-acceptance-rate.md b/content/posts/leetcode/0597-friend-requests-i-overall-acceptance-rate.md
index 46359199d..368f4686d 100644
--- a/content/posts/leetcode/0597-friend-requests-i-overall-acceptance-rate.md
+++ b/content/posts/leetcode/0597-friend-requests-i-overall-acceptance-rate.md
@@ -113,7 +113,6 @@ There are 4 unique accepted requests, and there are 5 requests in total. So the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
ROUND(
diff --git a/content/posts/leetcode/0601-human-traffic-of-stadium.md b/content/posts/leetcode/0601-human-traffic-of-stadium.md
index 6e1155d72..f37c8e02d 100644
--- a/content/posts/leetcode/0601-human-traffic-of-stadium.md
+++ b/content/posts/leetcode/0601-human-traffic-of-stadium.md
@@ -81,7 +81,6 @@ The rows with ids 2 and 3 are not included because we need at least three consec
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/0602-friend-requests-ii-who-has-the-most-friends.md b/content/posts/leetcode/0602-friend-requests-ii-who-has-the-most-friends.md
index 820ccedd4..9a8ee61af 100644
--- a/content/posts/leetcode/0602-friend-requests-ii-who-has-the-most-friends.md
+++ b/content/posts/leetcode/0602-friend-requests-ii-who-has-the-most-friends.md
@@ -75,7 +75,6 @@ The person with id 3 is a friend of people 1, 2, and 4, so he has three friends
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0603-consecutive-available-seats.md b/content/posts/leetcode/0603-consecutive-available-seats.md
index 97c1ce901..82a201499 100644
--- a/content/posts/leetcode/0603-consecutive-available-seats.md
+++ b/content/posts/leetcode/0603-consecutive-available-seats.md
@@ -76,7 +76,6 @@ We can use a self-join to join the `Seat` table with itself, and then filter out
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT a.seat_id
FROM
@@ -95,7 +94,6 @@ We can use the `LAG` and `LEAD` functions (or `SUM() OVER(ROWS BETWEEN 1 PRECEDI
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -118,7 +116,6 @@ WHERE a = 2 OR b = 2;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0607-sales-person.md b/content/posts/leetcode/0607-sales-person.md
index 4c1c94061..4e8836f9c 100644
--- a/content/posts/leetcode/0607-sales-person.md
+++ b/content/posts/leetcode/0607-sales-person.md
@@ -133,7 +133,6 @@ We can use a left join to join the `SalesPerson` table with the `Orders` table o
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT s.name
FROM
diff --git a/content/posts/leetcode/0608-tree-node.md b/content/posts/leetcode/0608-tree-node.md
index 8cefe4e59..752838189 100644
--- a/content/posts/leetcode/0608-tree-node.md
+++ b/content/posts/leetcode/0608-tree-node.md
@@ -112,7 +112,6 @@ We can use the `CASE WHEN` conditional statement to determine the type of each n
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
id,
diff --git a/content/posts/leetcode/0610-triangle-judgement.md b/content/posts/leetcode/0610-triangle-judgement.md
index ea4a90cc0..b3feec5b8 100644
--- a/content/posts/leetcode/0610-triangle-judgement.md
+++ b/content/posts/leetcode/0610-triangle-judgement.md
@@ -71,7 +71,6 @@ The condition for whether three sides can form a triangle is that the sum of any
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
*,
diff --git a/content/posts/leetcode/0612-shortest-distance-in-a-plane.md b/content/posts/leetcode/0612-shortest-distance-in-a-plane.md
index b1fcfe403..11785795d 100644
--- a/content/posts/leetcode/0612-shortest-distance-in-a-plane.md
+++ b/content/posts/leetcode/0612-shortest-distance-in-a-plane.md
@@ -69,7 +69,6 @@ Point2D table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT ROUND(SQRT(POW(p1.x - p2.x, 2) + POW(p1.y - p2.y, 2)), 2) AS shortest
FROM
diff --git a/content/posts/leetcode/0613-shortest-distance-in-a-line.md b/content/posts/leetcode/0613-shortest-distance-in-a-line.md
index 1128d9d3e..4623783d9 100644
--- a/content/posts/leetcode/0613-shortest-distance-in-a-line.md
+++ b/content/posts/leetcode/0613-shortest-distance-in-a-line.md
@@ -71,7 +71,6 @@ We can use a self-join to join each point in the table with the larger points, a
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT MIN(p2.x - p1.x) AS shortest
FROM
@@ -89,7 +88,6 @@ We can use a window function to sort the points in the table by their $x$ values
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT x - LAG(x) OVER (ORDER BY x) AS shortest
FROM Point
diff --git a/content/posts/leetcode/0614-second-degree-follower.md b/content/posts/leetcode/0614-second-degree-follower.md
index f89da47ea..76e573416 100644
--- a/content/posts/leetcode/0614-second-degree-follower.md
+++ b/content/posts/leetcode/0614-second-degree-follower.md
@@ -82,7 +82,6 @@ User Alice has 1 follower. Alice is not a second-degree follower because she doe
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0615-average-salary-departments-vs-company.md b/content/posts/leetcode/0615-average-salary-departments-vs-company.md
index 049b99424..5dbb2e9f0 100644
--- a/content/posts/leetcode/0615-average-salary-departments-vs-company.md
+++ b/content/posts/leetcode/0615-average-salary-departments-vs-company.md
@@ -106,7 +106,6 @@ With he same formula for the average salary comparison in February, the result i
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
@@ -138,7 +137,6 @@ FROM t;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/0618-students-report-by-geography.md b/content/posts/leetcode/0618-students-report-by-geography.md
index a5fcad81b..eea6c46ff 100644
--- a/content/posts/leetcode/0618-students-report-by-geography.md
+++ b/content/posts/leetcode/0618-students-report-by-geography.md
@@ -75,7 +75,6 @@ Student table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/0619-biggest-single-number.md b/content/posts/leetcode/0619-biggest-single-number.md
index 54c946052..19621df7a 100644
--- a/content/posts/leetcode/0619-biggest-single-number.md
+++ b/content/posts/leetcode/0619-biggest-single-number.md
@@ -101,7 +101,6 @@ We can first group the `MyNumbers` table by `num` and count the number of occurr
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT MAX(num) AS num
FROM
@@ -123,7 +122,6 @@ Similar to Solution 1, we can first group the `MyNumbers` table by `num` and cou
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
CASE
diff --git a/content/posts/leetcode/0620-not-boring-movies.md b/content/posts/leetcode/0620-not-boring-movies.md
index d036ef226..171e101cd 100644
--- a/content/posts/leetcode/0620-not-boring-movies.md
+++ b/content/posts/leetcode/0620-not-boring-movies.md
@@ -78,7 +78,6 @@ We can use the `WHERE` clause to filter out the records where `description` is n
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT *
FROM Cinema
diff --git a/content/posts/leetcode/0626-exchange-seats.md b/content/posts/leetcode/0626-exchange-seats.md
index 5872ddffb..a81498ed0 100644
--- a/content/posts/leetcode/0626-exchange-seats.md
+++ b/content/posts/leetcode/0626-exchange-seats.md
@@ -77,7 +77,6 @@ Note that if the number of students is odd, there is no need to change the last
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT s1.id, COALESCE(s2.student, s1.student) AS student
FROM
@@ -94,7 +93,6 @@ ORDER BY 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
id + (
@@ -118,7 +116,6 @@ ORDER BY 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
RANK() OVER (ORDER BY (id - 1) ^ 1) AS id,
@@ -134,7 +131,6 @@ FROM Seat;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
CASE
diff --git a/content/posts/leetcode/0627-swap-salary.md b/content/posts/leetcode/0627-swap-salary.md
index 5a7a8de6a..f96e842eb 100644
--- a/content/posts/leetcode/0627-swap-salary.md
+++ b/content/posts/leetcode/0627-swap-salary.md
@@ -78,7 +78,6 @@ Salary table:
```sql
-{{< /terminal >}}
UPDATE salary
SET sex = CASE sex
WHEN 'm' THEN 'f'
@@ -94,7 +93,6 @@ END;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
UPDATE Salary
SET sex = IF(sex = 'f', 'm', 'f');
diff --git a/content/posts/leetcode/0654-maximum-binary-tree.md b/content/posts/leetcode/0654-maximum-binary-tree.md
index c2d01cf39..d2a98cdf6 100644
--- a/content/posts/leetcode/0654-maximum-binary-tree.md
+++ b/content/posts/leetcode/0654-maximum-binary-tree.md
@@ -289,8 +289,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0669-trim-a-binary-search-tree.md b/content/posts/leetcode/0669-trim-a-binary-search-tree.md
index 8ad7f0a7a..48d3066b2 100644
--- a/content/posts/leetcode/0669-trim-a-binary-search-tree.md
+++ b/content/posts/leetcode/0669-trim-a-binary-search-tree.md
@@ -290,8 +290,8 @@ var trimBST = function (root, low, high) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0687-longest-univalue-path.md b/content/posts/leetcode/0687-longest-univalue-path.md
index 6b3645258..f875fbc5f 100644
--- a/content/posts/leetcode/0687-longest-univalue-path.md
+++ b/content/posts/leetcode/0687-longest-univalue-path.md
@@ -321,8 +321,8 @@ var longestUnivaluePath = function (root) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/0709-to-lower-case.md b/content/posts/leetcode/0709-to-lower-case.md
index 5de136e99..74bc28371 100644
--- a/content/posts/leetcode/0709-to-lower-case.md
+++ b/content/posts/leetcode/0709-to-lower-case.md
@@ -129,8 +129,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* toLowerCase(char* s) {
int n = strlen(s);
for (int i = 0; i < n; i++) {
diff --git a/content/posts/leetcode/0769-max-chunks-to-make-sorted.md b/content/posts/leetcode/0769-max-chunks-to-make-sorted.md
index 0e83227ae..f5346b9e9 100644
--- a/content/posts/leetcode/0769-max-chunks-to-make-sorted.md
+++ b/content/posts/leetcode/0769-max-chunks-to-make-sorted.md
@@ -158,8 +158,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int maxChunksToSorted(int* arr, int arrSize) {
diff --git a/content/posts/leetcode/0771-jewels-and-stones.md b/content/posts/leetcode/0771-jewels-and-stones.md
index bf9ab1e2b..dcc189b54 100644
--- a/content/posts/leetcode/0771-jewels-and-stones.md
+++ b/content/posts/leetcode/0771-jewels-and-stones.md
@@ -148,8 +148,8 @@ var numJewelsInStones = function (jewels, stones) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int numJewelsInStones(char* jewels, char* stones) {
int set[128] = {0};
for (int i = 0; jewels[i]; i++) {
diff --git a/content/posts/leetcode/0856-score-of-parentheses.md b/content/posts/leetcode/0856-score-of-parentheses.md
index 3f816b57d..78e4bf2b9 100644
--- a/content/posts/leetcode/0856-score-of-parentheses.md
+++ b/content/posts/leetcode/0856-score-of-parentheses.md
@@ -71,7 +71,6 @@ We use $d$ to maintain the current depth of parentheses. For each `(`, we increa
Let's take `(()(()))` as an example. We first find the two closed parentheses `()` inside, and then add the corresponding $2^d$ to the score. In fact, we are calculating the score of `(()) + ((()))`.
```bash
-{{< /terminal >}}
( ( ) ( ( ) ) )
^ ^ ^ ^
diff --git a/content/posts/leetcode/0876-middle-of-the-linked-list.md b/content/posts/leetcode/0876-middle-of-the-linked-list.md
index bf195356d..99b0e7eb2 100644
--- a/content/posts/leetcode/0876-middle-of-the-linked-list.md
+++ b/content/posts/leetcode/0876-middle-of-the-linked-list.md
@@ -234,8 +234,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for singly-linked list.
* struct ListNode {
diff --git a/content/posts/leetcode/0940-distinct-subsequences-ii.md b/content/posts/leetcode/0940-distinct-subsequences-ii.md
index 409400bf1..a617c7db1 100644
--- a/content/posts/leetcode/0940-distinct-subsequences-ii.md
+++ b/content/posts/leetcode/0940-distinct-subsequences-ii.md
@@ -183,8 +183,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int distinctSubseqII(char* s) {
int mod = 1e9 + 7;
int n = strlen(s);
diff --git a/content/posts/leetcode/0953-verifying-an-alien-dictionary.md b/content/posts/leetcode/0953-verifying-an-alien-dictionary.md
index f21a0e76a..18d928dce 100644
--- a/content/posts/leetcode/0953-verifying-an-alien-dictionary.md
+++ b/content/posts/leetcode/0953-verifying-an-alien-dictionary.md
@@ -240,8 +240,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
bool isAlienSorted(char** words, int wordsSize, char* order) {
diff --git a/content/posts/leetcode/0976-largest-perimeter-triangle.md b/content/posts/leetcode/0976-largest-perimeter-triangle.md
index ef70ab1d6..1a17ca621 100644
--- a/content/posts/leetcode/0976-largest-perimeter-triangle.md
+++ b/content/posts/leetcode/0976-largest-perimeter-triangle.md
@@ -150,8 +150,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) b - *(int*) a;
}
diff --git a/content/posts/leetcode/0998-maximum-binary-tree-ii.md b/content/posts/leetcode/0998-maximum-binary-tree-ii.md
index c23516698..823d12414 100644
--- a/content/posts/leetcode/0998-maximum-binary-tree-ii.md
+++ b/content/posts/leetcode/0998-maximum-binary-tree-ii.md
@@ -252,8 +252,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/1038-binary-search-tree-to-greater-sum-tree.md b/content/posts/leetcode/1038-binary-search-tree-to-greater-sum-tree.md
index bd0b4fdd1..1301cfecc 100644
--- a/content/posts/leetcode/1038-binary-search-tree-to-greater-sum-tree.md
+++ b/content/posts/leetcode/1038-binary-search-tree-to-greater-sum-tree.md
@@ -291,8 +291,8 @@ var bstToGst = function (root) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
@@ -535,8 +535,8 @@ function bstToGst(root: TreeNode | null): TreeNode | null {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/1045-customers-who-bought-all-products.md b/content/posts/leetcode/1045-customers-who-bought-all-products.md
index 97325f3bf..6d21eb171 100644
--- a/content/posts/leetcode/1045-customers-who-bought-all-products.md
+++ b/content/posts/leetcode/1045-customers-who-bought-all-products.md
@@ -96,7 +96,6 @@ We can group the `Customer` table by `customer_id`, and then use the `HAVING` cl
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT customer_id
FROM Customer
diff --git a/content/posts/leetcode/1047-remove-all-adjacent-duplicates-in-string.md b/content/posts/leetcode/1047-remove-all-adjacent-duplicates-in-string.md
index 48814e25b..38b90b97f 100644
--- a/content/posts/leetcode/1047-remove-all-adjacent-duplicates-in-string.md
+++ b/content/posts/leetcode/1047-remove-all-adjacent-duplicates-in-string.md
@@ -161,8 +161,8 @@ var removeDuplicates = function (s) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* removeDuplicates(char* s) {
int n = strlen(s);
char* stack = malloc(sizeof(char) * (n + 1));
diff --git a/content/posts/leetcode/1050-actors-and-directors-who-cooperated-at-least-three-times.md b/content/posts/leetcode/1050-actors-and-directors-who-cooperated-at-least-three-times.md
index 33c934f3d..f8a03300c 100644
--- a/content/posts/leetcode/1050-actors-and-directors-who-cooperated-at-least-three-times.md
+++ b/content/posts/leetcode/1050-actors-and-directors-who-cooperated-at-least-three-times.md
@@ -75,7 +75,6 @@ We can use the `GROUP BY` statement to group the data by the `actor_id` and `dir
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT actor_id, director_id
FROM ActorDirector
diff --git a/content/posts/leetcode/1068-product-sales-analysis-i.md b/content/posts/leetcode/1068-product-sales-analysis-i.md
index d3478a896..4eecd7459 100644
--- a/content/posts/leetcode/1068-product-sales-analysis-i.md
+++ b/content/posts/leetcode/1068-product-sales-analysis-i.md
@@ -102,7 +102,6 @@ From sale_id = 7, we can conclude that Apple was sold for 9000 in the year 2011.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT product_name, year, price
FROM
diff --git a/content/posts/leetcode/1069-product-sales-analysis-ii.md b/content/posts/leetcode/1069-product-sales-analysis-ii.md
index 913abca6d..5b602c690 100644
--- a/content/posts/leetcode/1069-product-sales-analysis-ii.md
+++ b/content/posts/leetcode/1069-product-sales-analysis-ii.md
@@ -97,7 +97,6 @@ Product table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT product_id, SUM(quantity) AS total_quantity
FROM Sales
diff --git a/content/posts/leetcode/1070-product-sales-analysis-iii.md b/content/posts/leetcode/1070-product-sales-analysis-iii.md
index 62a17f2ec..1c7369bbb 100644
--- a/content/posts/leetcode/1070-product-sales-analysis-iii.md
+++ b/content/posts/leetcode/1070-product-sales-analysis-iii.md
@@ -97,7 +97,6 @@ Product table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
product_id,
@@ -123,7 +122,6 @@ WHERE
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1075-project-employees-i.md b/content/posts/leetcode/1075-project-employees-i.md
index 8c7c2ccda..88594166b 100644
--- a/content/posts/leetcode/1075-project-employees-i.md
+++ b/content/posts/leetcode/1075-project-employees-i.md
@@ -98,7 +98,6 @@ Employee table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement
SELECT project_id, ROUND(AVG(experience_years), 2) AS average_years
FROM
diff --git a/content/posts/leetcode/1076-project-employees-ii.md b/content/posts/leetcode/1076-project-employees-ii.md
index e3cf2576f..6de9db064 100644
--- a/content/posts/leetcode/1076-project-employees-ii.md
+++ b/content/posts/leetcode/1076-project-employees-ii.md
@@ -97,7 +97,6 @@ Employee table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT project_id
FROM Project
@@ -118,7 +117,6 @@ HAVING
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1077-project-employees-iii.md b/content/posts/leetcode/1077-project-employees-iii.md
index 8d0c8ac54..a3256ece3 100644
--- a/content/posts/leetcode/1077-project-employees-iii.md
+++ b/content/posts/leetcode/1077-project-employees-iii.md
@@ -101,7 +101,6 @@ We can first perform an inner join between the `Project` table and the `Employee
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1082-sales-analysis-i.md b/content/posts/leetcode/1082-sales-analysis-i.md
index 0f01e5595..a19d33ab6 100644
--- a/content/posts/leetcode/1082-sales-analysis-i.md
+++ b/content/posts/leetcode/1082-sales-analysis-i.md
@@ -98,7 +98,6 @@ Sales table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT seller_id
FROM Sales
@@ -119,7 +118,6 @@ HAVING
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1083-sales-analysis-ii.md b/content/posts/leetcode/1083-sales-analysis-ii.md
index 6545947d8..870df0708 100644
--- a/content/posts/leetcode/1083-sales-analysis-ii.md
+++ b/content/posts/leetcode/1083-sales-analysis-ii.md
@@ -99,7 +99,6 @@ Sales table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT buyer_id
FROM
diff --git a/content/posts/leetcode/1084-sales-analysis-iii.md b/content/posts/leetcode/1084-sales-analysis-iii.md
index e72f01883..39988ce41 100644
--- a/content/posts/leetcode/1084-sales-analysis-iii.md
+++ b/content/posts/leetcode/1084-sales-analysis-iii.md
@@ -101,7 +101,6 @@ We return only product 1 as it is the product that was only sold in the spring o
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT product_id, product_name
FROM
diff --git a/content/posts/leetcode/1089-duplicate-zeros.md b/content/posts/leetcode/1089-duplicate-zeros.md
index ae7d30d21..92421d566 100644
--- a/content/posts/leetcode/1089-duplicate-zeros.md
+++ b/content/posts/leetcode/1089-duplicate-zeros.md
@@ -193,8 +193,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
void duplicateZeros(int* arr, int arrSize) {
int i = 0;
int j = 0;
diff --git a/content/posts/leetcode/1097-game-play-analysis-v.md b/content/posts/leetcode/1097-game-play-analysis-v.md
index c7768f0c9..61bc885c9 100644
--- a/content/posts/leetcode/1097-game-play-analysis-v.md
+++ b/content/posts/leetcode/1097-game-play-analysis-v.md
@@ -81,7 +81,6 @@ Player 2 installed the game on 2017-06-25 but didn't log back in on 2017-06-
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1098-unpopular-books.md b/content/posts/leetcode/1098-unpopular-books.md
index 484e614ac..640bafba2 100644
--- a/content/posts/leetcode/1098-unpopular-books.md
+++ b/content/posts/leetcode/1098-unpopular-books.md
@@ -101,7 +101,6 @@ Orders table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT book_id, name
FROM
diff --git a/content/posts/leetcode/1107-new-users-daily-count.md b/content/posts/leetcode/1107-new-users-daily-count.md
index 6bf7bc996..3316f8bc8 100644
--- a/content/posts/leetcode/1107-new-users-daily-count.md
+++ b/content/posts/leetcode/1107-new-users-daily-count.md
@@ -85,7 +85,6 @@ The user with id 5 first logged in on 2019-03-01 so he's not counted on 2019
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1112-highest-grade-for-each-student.md b/content/posts/leetcode/1112-highest-grade-for-each-student.md
index 1753c5b09..b87f8fae3 100644
--- a/content/posts/leetcode/1112-highest-grade-for-each-student.md
+++ b/content/posts/leetcode/1112-highest-grade-for-each-student.md
@@ -77,7 +77,6 @@ We can use the `RANK() OVER()` window function to sort the grades of each studen
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -105,7 +104,6 @@ We can first query the highest grade of each student, and then query the minimum
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT student_id, MIN(course_id) AS course_id, grade
FROM Enrollments
diff --git a/content/posts/leetcode/1113-reported-posts.md b/content/posts/leetcode/1113-reported-posts.md
index 4f55a402b..6d32c9b9f 100644
--- a/content/posts/leetcode/1113-reported-posts.md
+++ b/content/posts/leetcode/1113-reported-posts.md
@@ -85,7 +85,6 @@ Actions table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT extra AS report_reason, COUNT(DISTINCT post_id) AS report_count
FROM Actions
diff --git a/content/posts/leetcode/1126-active-businesses.md b/content/posts/leetcode/1126-active-businesses.md
index bc2eb9439..d7e961499 100644
--- a/content/posts/leetcode/1126-active-businesses.md
+++ b/content/posts/leetcode/1126-active-businesses.md
@@ -81,7 +81,6 @@ The business with id=1 has 7 'reviews' events (more than 5) and 11 '
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT business_id
FROM
@@ -107,7 +106,6 @@ HAVING COUNT(1) > 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1127-user-purchase-platform.md b/content/posts/leetcode/1127-user-purchase-platform.md
index 6218b6906..c841485b4 100644
--- a/content/posts/leetcode/1127-user-purchase-platform.md
+++ b/content/posts/leetcode/1127-user-purchase-platform.md
@@ -82,7 +82,6 @@ On 2019-07-02, user 2 purchased using mobile only, user 3 purch
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/1132-reported-posts-ii.md b/content/posts/leetcode/1132-reported-posts-ii.md
index 6abfc19b3..d2a902e4c 100644
--- a/content/posts/leetcode/1132-reported-posts-ii.md
+++ b/content/posts/leetcode/1132-reported-posts-ii.md
@@ -107,7 +107,6 @@ Note that the output is only one number and that we do not care about the remove
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1141-user-activity-for-the-past-30-days-i.md b/content/posts/leetcode/1141-user-activity-for-the-past-30-days-i.md
index 636660978..154b258b7 100644
--- a/content/posts/leetcode/1141-user-activity-for-the-past-30-days-i.md
+++ b/content/posts/leetcode/1141-user-activity-for-the-past-30-days-i.md
@@ -82,7 +82,6 @@ Activity table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT activity_date AS day, COUNT(DISTINCT user_id) AS active_users
FROM Activity
diff --git a/content/posts/leetcode/1142-user-activity-for-the-past-30-days-ii.md b/content/posts/leetcode/1142-user-activity-for-the-past-30-days-ii.md
index 0e327e0e1..061f3ca3a 100644
--- a/content/posts/leetcode/1142-user-activity-for-the-past-30-days-ii.md
+++ b/content/posts/leetcode/1142-user-activity-for-the-past-30-days-ii.md
@@ -82,7 +82,6 @@ Activity table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -104,7 +103,6 @@ FROM T;
```sql
-{{< /terminal >}}
SELECT
IFNULL(
ROUND(COUNT(DISTINCT session_id) / COUNT(DISTINCT user_id), 2),
diff --git a/content/posts/leetcode/1143-longest-common-subsequence.md b/content/posts/leetcode/1143-longest-common-subsequence.md
index f59b92b2a..b7054ebca 100644
--- a/content/posts/leetcode/1143-longest-common-subsequence.md
+++ b/content/posts/leetcode/1143-longest-common-subsequence.md
@@ -252,8 +252,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="Kotlin Code" >}}
```kotlin
-{{< /terminal >}}
class Solution {
fun longestCommonSubsequence(text1: String, text2: String): Int {
val m = text1.length
diff --git a/content/posts/leetcode/1148-article-views-i.md b/content/posts/leetcode/1148-article-views-i.md
index f24c930b1..7d16052de 100644
--- a/content/posts/leetcode/1148-article-views-i.md
+++ b/content/posts/leetcode/1148-article-views-i.md
@@ -76,7 +76,6 @@ Views table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT author_id AS id
FROM Views
diff --git a/content/posts/leetcode/1149-article-views-ii.md b/content/posts/leetcode/1149-article-views-ii.md
index 52feb6159..d2d33f3f1 100644
--- a/content/posts/leetcode/1149-article-views-ii.md
+++ b/content/posts/leetcode/1149-article-views-ii.md
@@ -76,7 +76,6 @@ Views table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT viewer_id AS id
FROM Views
diff --git a/content/posts/leetcode/1158-market-analysis-i.md b/content/posts/leetcode/1158-market-analysis-i.md
index b51b98498..5d0ba0a0e 100644
--- a/content/posts/leetcode/1158-market-analysis-i.md
+++ b/content/posts/leetcode/1158-market-analysis-i.md
@@ -126,7 +126,6 @@ Items table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
u.user_id AS buyer_id,
@@ -146,7 +145,6 @@ GROUP BY user_id;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
user_id AS buyer_id,
diff --git a/content/posts/leetcode/1159-market-analysis-ii.md b/content/posts/leetcode/1159-market-analysis-ii.md
index e09f7735d..dc5b5cd10 100644
--- a/content/posts/leetcode/1159-market-analysis-ii.md
+++ b/content/posts/leetcode/1159-market-analysis-ii.md
@@ -130,7 +130,6 @@ The answer for the user with id 4 is no because the brand of their second sold i
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
u.user_id AS seller_id,
diff --git a/content/posts/leetcode/1164-product-price-at-a-given-date.md b/content/posts/leetcode/1164-product-price-at-a-given-date.md
index e236dd564..df505a04c 100644
--- a/content/posts/leetcode/1164-product-price-at-a-given-date.md
+++ b/content/posts/leetcode/1164-product-price-at-a-given-date.md
@@ -75,7 +75,6 @@ We can use a subquery to find the price of the last price change for each produc
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (SELECT DISTINCT product_id FROM Products),
@@ -104,7 +103,6 @@ FROM
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/1173-immediate-food-delivery-i.md b/content/posts/leetcode/1173-immediate-food-delivery-i.md
index b8a4fa2a3..7b43df618 100644
--- a/content/posts/leetcode/1173-immediate-food-delivery-i.md
+++ b/content/posts/leetcode/1173-immediate-food-delivery-i.md
@@ -76,7 +76,6 @@ We can use the `sum` function to count the number of instant orders, and then di
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
ROUND(SUM(order_date = customer_pref_delivery_date) / COUNT(1) * 100, 2) AS immediate_percentage
diff --git a/content/posts/leetcode/1174-immediate-food-delivery-ii.md b/content/posts/leetcode/1174-immediate-food-delivery-ii.md
index 264522b28..585ee29a8 100644
--- a/content/posts/leetcode/1174-immediate-food-delivery-ii.md
+++ b/content/posts/leetcode/1174-immediate-food-delivery-ii.md
@@ -84,7 +84,6 @@ We can use a subquery to first find the first order of each user, and then calcu
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
ROUND(AVG(order_date = customer_pref_delivery_date) * 100, 2) AS immediate_percentage
@@ -107,7 +106,6 @@ We can use the `RANK()` window function to rank the orders of each user in ascen
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1179-reformat-department-table.md b/content/posts/leetcode/1179-reformat-department-table.md
index 1ae81db16..2356d23f2 100644
--- a/content/posts/leetcode/1179-reformat-department-table.md
+++ b/content/posts/leetcode/1179-reformat-department-table.md
@@ -76,7 +76,6 @@ Note that the result table has 13 columns (1 for the department id + 12 for the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
id,
diff --git a/content/posts/leetcode/1193-monthly-transactions-i.md b/content/posts/leetcode/1193-monthly-transactions-i.md
index 9b121053d..b441aa985 100644
--- a/content/posts/leetcode/1193-monthly-transactions-i.md
+++ b/content/posts/leetcode/1193-monthly-transactions-i.md
@@ -77,7 +77,6 @@ We can first group by month and country, and then use the `COUNT` and `SUM` func
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
DATE_FORMAT(trans_date, '%Y-%m') AS month,
diff --git a/content/posts/leetcode/1194-tournament-winners.md b/content/posts/leetcode/1194-tournament-winners.md
index 99f62aa89..59bb4d24c 100644
--- a/content/posts/leetcode/1194-tournament-winners.md
+++ b/content/posts/leetcode/1194-tournament-winners.md
@@ -106,7 +106,6 @@ Matches table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
s AS (
diff --git a/content/posts/leetcode/1204-last-person-to-fit-in-the-bus.md b/content/posts/leetcode/1204-last-person-to-fit-in-the-bus.md
index 721aa3c50..cb0180b6b 100644
--- a/content/posts/leetcode/1204-last-person-to-fit-in-the-bus.md
+++ b/content/posts/leetcode/1204-last-person-to-fit-in-the-bus.md
@@ -87,7 +87,6 @@ Queue table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT a.person_name
FROM
@@ -108,7 +107,6 @@ LIMIT 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1205-monthly-transactions-ii.md b/content/posts/leetcode/1205-monthly-transactions-ii.md
index 076663a31..496140caf 100644
--- a/content/posts/leetcode/1205-monthly-transactions-ii.md
+++ b/content/posts/leetcode/1205-monthly-transactions-ii.md
@@ -99,7 +99,6 @@ Chargebacks table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1211-queries-quality-and-percentage.md b/content/posts/leetcode/1211-queries-quality-and-percentage.md
index 18a999b6c..fa9563bb2 100644
--- a/content/posts/leetcode/1211-queries-quality-and-percentage.md
+++ b/content/posts/leetcode/1211-queries-quality-and-percentage.md
@@ -98,7 +98,6 @@ We can group the query results by `query_name`, and then use the `AVG` and `ROUN
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
query_name,
diff --git a/content/posts/leetcode/1212-team-scores-in-football-tournament.md b/content/posts/leetcode/1212-team-scores-in-football-tournament.md
index 04618553e..90cbd3128 100644
--- a/content/posts/leetcode/1212-team-scores-in-football-tournament.md
+++ b/content/posts/leetcode/1212-team-scores-in-football-tournament.md
@@ -120,7 +120,6 @@ Finally, we sort the result by points in descending order, and if the points are
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
team_id,
diff --git a/content/posts/leetcode/1220-count-vowels-permutation.md b/content/posts/leetcode/1220-count-vowels-permutation.md
index 940dcf8b8..d35e75d64 100644
--- a/content/posts/leetcode/1220-count-vowels-permutation.md
+++ b/content/posts/leetcode/1220-count-vowels-permutation.md
@@ -69,7 +69,6 @@ math: true
Based on the problem description, we can list the possible subsequent vowels for each vowel:
```bash
-{{< /terminal >}}
a [e]
e [a|i]
i [a|e|o|u]
@@ -81,7 +80,6 @@ u [a]
From this, we can deduce the possible preceding vowels for each vowel:
```bash
-{{< /terminal >}}
[e|i|u] a
[a|i] e
[e|o] i
diff --git a/content/posts/leetcode/1225-report-contiguous-dates.md b/content/posts/leetcode/1225-report-contiguous-dates.md
index daabfcc03..1e772cf4e 100644
--- a/content/posts/leetcode/1225-report-contiguous-dates.md
+++ b/content/posts/leetcode/1225-report-contiguous-dates.md
@@ -106,7 +106,6 @@ We can merge the two tables into one table with a field `st` representing the st
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1241-number-of-comments-per-post.md b/content/posts/leetcode/1241-number-of-comments-per-post.md
index 27c777829..4f6923129 100644
--- a/content/posts/leetcode/1241-number-of-comments-per-post.md
+++ b/content/posts/leetcode/1241-number-of-comments-per-post.md
@@ -89,7 +89,6 @@ The comment with id 6 is a comment on a deleted post with id 7 so we ignored it.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1251-average-selling-price.md b/content/posts/leetcode/1251-average-selling-price.md
index 3bcb0ba52..33a7f09ea 100644
--- a/content/posts/leetcode/1251-average-selling-price.md
+++ b/content/posts/leetcode/1251-average-selling-price.md
@@ -104,7 +104,6 @@ We can use a left join to join the `Prices` table and the `UnitsSold` table on `
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
p.product_id,
diff --git a/content/posts/leetcode/1264-page-recommendations.md b/content/posts/leetcode/1264-page-recommendations.md
index 7e6e6d624..34d0044c0 100644
--- a/content/posts/leetcode/1264-page-recommendations.md
+++ b/content/posts/leetcode/1264-page-recommendations.md
@@ -112,7 +112,6 @@ First, we query all users who are friends with `user_id = 1` and record them in
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -135,7 +134,6 @@ WHERE page_id NOT IN (SELECT page_id FROM Likes WHERE user_id = 1);
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT page_id AS recommended_page
FROM Likes
diff --git a/content/posts/leetcode/1266-minimum-time-visiting-all-points.md b/content/posts/leetcode/1266-minimum-time-visiting-all-points.md
index dbf1d3bbf..788e6af68 100644
--- a/content/posts/leetcode/1266-minimum-time-visiting-all-points.md
+++ b/content/posts/leetcode/1266-minimum-time-visiting-all-points.md
@@ -173,8 +173,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int minTimeToVisitAllPoints(int** points, int pointsSize, int* pointsColSize) {
diff --git a/content/posts/leetcode/1270-all-people-report-to-the-given-manager.md b/content/posts/leetcode/1270-all-people-report-to-the-given-manager.md
index f9ec9f14c..90d8a6d5f 100644
--- a/content/posts/leetcode/1270-all-people-report-to-the-given-manager.md
+++ b/content/posts/leetcode/1270-all-people-report-to-the-given-manager.md
@@ -90,7 +90,6 @@ Specifically, we first use a join to find the `manager_id` of the superior manag
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT e1.employee_id
FROM
diff --git a/content/posts/leetcode/1280-students-and-examinations.md b/content/posts/leetcode/1280-students-and-examinations.md
index 949bdf11b..7df851d06 100644
--- a/content/posts/leetcode/1280-students-and-examinations.md
+++ b/content/posts/leetcode/1280-students-and-examinations.md
@@ -142,7 +142,6 @@ We can first join the `Students` table and the `Subjects` table to obtain all co
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT student_id, student_name, subject_name, COUNT(e.student_id) AS attended_exams
FROM
diff --git a/content/posts/leetcode/1281-subtract-the-product-and-sum-of-digits-of-an-integer.md b/content/posts/leetcode/1281-subtract-the-product-and-sum-of-digits-of-an-integer.md
index 58572d232..cc28c20f0 100644
--- a/content/posts/leetcode/1281-subtract-the-product-and-sum-of-digits-of-an-integer.md
+++ b/content/posts/leetcode/1281-subtract-the-product-and-sum-of-digits-of-an-integer.md
@@ -174,8 +174,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int subtractProductAndSum(int n) {
int x = 1;
int y = 0;
diff --git a/content/posts/leetcode/1285-find-the-start-and-end-number-of-continuous-ranges.md b/content/posts/leetcode/1285-find-the-start-and-end-number-of-continuous-ranges.md
index 0ff09d941..5d6e24612 100644
--- a/content/posts/leetcode/1285-find-the-start-and-end-number-of-continuous-ranges.md
+++ b/content/posts/leetcode/1285-find-the-start-and-end-number-of-continuous-ranges.md
@@ -86,7 +86,6 @@ There are two ways to implement grouping:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -114,7 +113,6 @@ GROUP BY pid;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1290-convert-binary-number-in-a-linked-list-to-integer.md b/content/posts/leetcode/1290-convert-binary-number-in-a-linked-list-to-integer.md
index b8126ad8b..8880a6878 100644
--- a/content/posts/leetcode/1290-convert-binary-number-in-a-linked-list-to-integer.md
+++ b/content/posts/leetcode/1290-convert-binary-number-in-a-linked-list-to-integer.md
@@ -250,8 +250,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for singly-linked list.
* struct ListNode {
diff --git a/content/posts/leetcode/1294-weather-type-in-each-country.md b/content/posts/leetcode/1294-weather-type-in-each-country.md
index 80f9aac75..a44001658 100644
--- a/content/posts/leetcode/1294-weather-type-in-each-country.md
+++ b/content/posts/leetcode/1294-weather-type-in-each-country.md
@@ -128,7 +128,6 @@ We know nothing about the average weather_state in Spain in November so we do no
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
country_name,
diff --git a/content/posts/leetcode/1302-deepest-leaves-sum.md b/content/posts/leetcode/1302-deepest-leaves-sum.md
index 03b2d525d..75e370494 100644
--- a/content/posts/leetcode/1302-deepest-leaves-sum.md
+++ b/content/posts/leetcode/1302-deepest-leaves-sum.md
@@ -266,8 +266,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/1303-find-the-team-size.md b/content/posts/leetcode/1303-find-the-team-size.md
index 76824f299..ed455295e 100644
--- a/content/posts/leetcode/1303-find-the-team-size.md
+++ b/content/posts/leetcode/1303-find-the-team-size.md
@@ -82,7 +82,6 @@ We can first count the number of people in each team and record it in the `T` ta
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -106,7 +105,6 @@ We can also use a left join to join the `Employee` table with itself based on `t
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT e1.employee_id, COUNT(1) AS team_size
FROM
diff --git a/content/posts/leetcode/1308-running-total-for-different-genders.md b/content/posts/leetcode/1308-running-total-for-different-genders.md
index 259894de3..b3bd17580 100644
--- a/content/posts/leetcode/1308-running-total-for-different-genders.md
+++ b/content/posts/leetcode/1308-running-total-for-different-genders.md
@@ -99,7 +99,6 @@ The fifth day is 2020-01-07, Bajrang scored 7 points and the total score for the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
gender,
diff --git a/content/posts/leetcode/1309-decrypt-string-from-alphabet-to-integer-mapping.md b/content/posts/leetcode/1309-decrypt-string-from-alphabet-to-integer-mapping.md
index b2605b83b..a4e8d7860 100644
--- a/content/posts/leetcode/1309-decrypt-string-from-alphabet-to-integer-mapping.md
+++ b/content/posts/leetcode/1309-decrypt-string-from-alphabet-to-integer-mapping.md
@@ -151,8 +151,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* freqAlphabets(char* s) {
int n = strlen(s);
int i = 0;
diff --git a/content/posts/leetcode/1313-decompress-run-length-encoded-list.md b/content/posts/leetcode/1313-decompress-run-length-encoded-list.md
index a9e230436..ac6d60d00 100644
--- a/content/posts/leetcode/1313-decompress-run-length-encoded-list.md
+++ b/content/posts/leetcode/1313-decompress-run-length-encoded-list.md
@@ -152,8 +152,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1321-restaurant-growth.md b/content/posts/leetcode/1321-restaurant-growth.md
index 0f8119882..23ba1343b 100644
--- a/content/posts/leetcode/1321-restaurant-growth.md
+++ b/content/posts/leetcode/1321-restaurant-growth.md
@@ -90,7 +90,6 @@ Customer table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
@@ -124,7 +123,6 @@ WHERE rk > 6;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
a.visited_on,
diff --git a/content/posts/leetcode/1322-ads-performance.md b/content/posts/leetcode/1322-ads-performance.md
index d0fe237dc..deb4e0db7 100644
--- a/content/posts/leetcode/1322-ads-performance.md
+++ b/content/posts/leetcode/1322-ads-performance.md
@@ -90,7 +90,6 @@ Note that we do not care about Ignored Ads.
```sql
-{{< /terminal >}}
SELECT
ad_id,
ROUND(IFNULL(SUM(action = 'Clicked') / SUM(action IN('Clicked', 'Viewed')) * 100, 0), 2) AS ctr
diff --git a/content/posts/leetcode/1323-maximum-69-number.md b/content/posts/leetcode/1323-maximum-69-number.md
index 1bbb70ed9..c89f09871 100644
--- a/content/posts/leetcode/1323-maximum-69-number.md
+++ b/content/posts/leetcode/1323-maximum-69-number.md
@@ -155,8 +155,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int maximum69Number(int num) {
int n = 0;
int i = 0;
diff --git a/content/posts/leetcode/1327-list-the-products-ordered-in-a-period.md b/content/posts/leetcode/1327-list-the-products-ordered-in-a-period.md
index bc414aa87..59465fdfb 100644
--- a/content/posts/leetcode/1327-list-the-products-ordered-in-a-period.md
+++ b/content/posts/leetcode/1327-list-the-products-ordered-in-a-period.md
@@ -112,7 +112,6 @@ Products with product_id = 5 is ordered in February a total of (50 + 50) = 100.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT product_name, SUM(unit) AS unit
FROM
diff --git a/content/posts/leetcode/1336-number-of-transactions-per-visit.md b/content/posts/leetcode/1336-number-of-transactions-per-visit.md
index aa9935eff..8d6d6b0f3 100644
--- a/content/posts/leetcode/1336-number-of-transactions-per-visit.md
+++ b/content/posts/leetcode/1336-number-of-transactions-per-visit.md
@@ -125,7 +125,6 @@ Transactions table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH RECURSIVE
S AS (
diff --git a/content/posts/leetcode/1341-movie-rating.md b/content/posts/leetcode/1341-movie-rating.md
index ebb44c683..a7eabb116 100644
--- a/content/posts/leetcode/1341-movie-rating.md
+++ b/content/posts/leetcode/1341-movie-rating.md
@@ -130,7 +130,6 @@ Frozen 2 and Joker have a rating average of 3.5 in February but Frozen 2 is smal
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
(
SELECT name AS results
diff --git a/content/posts/leetcode/1350-students-with-invalid-departments.md b/content/posts/leetcode/1350-students-with-invalid-departments.md
index e705750a8..d3f97fd00 100644
--- a/content/posts/leetcode/1350-students-with-invalid-departments.md
+++ b/content/posts/leetcode/1350-students-with-invalid-departments.md
@@ -106,7 +106,6 @@ We can directly use a subquery to find all students who are not in the `Departme
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT id, name
FROM Students
@@ -123,7 +122,6 @@ We can also use a left join to join the `Students` table with the `Departments`
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT s.id, s.name
FROM
diff --git a/content/posts/leetcode/1355-activity-participants.md b/content/posts/leetcode/1355-activity-participants.md
index 4d85e1989..8ac26ba69 100644
--- a/content/posts/leetcode/1355-activity-participants.md
+++ b/content/posts/leetcode/1355-activity-participants.md
@@ -102,7 +102,6 @@ Singing is performed by 2 friends (Victor J. and Jade W.)
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1356-sort-integers-by-the-number-of-1-bits.md b/content/posts/leetcode/1356-sort-integers-by-the-number-of-1-bits.md
index 398c5b341..a9df1ac90 100644
--- a/content/posts/leetcode/1356-sort-integers-by-the-number-of-1-bits.md
+++ b/content/posts/leetcode/1356-sort-integers-by-the-number-of-1-bits.md
@@ -154,8 +154,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1364-number-of-trusted-contacts-of-a-customer.md b/content/posts/leetcode/1364-number-of-trusted-contacts-of-a-customer.md
index a3e2ce096..dd5e0686e 100644
--- a/content/posts/leetcode/1364-number-of-trusted-contacts-of-a-customer.md
+++ b/content/posts/leetcode/1364-number-of-trusted-contacts-of-a-customer.md
@@ -142,7 +142,6 @@ John doesn't have any contacts.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
invoice_id,
diff --git a/content/posts/leetcode/1369-get-the-second-most-recent-activity.md b/content/posts/leetcode/1369-get-the-second-most-recent-activity.md
index 8e680ec8c..e0f7d3b38 100644
--- a/content/posts/leetcode/1369-get-the-second-most-recent-activity.md
+++ b/content/posts/leetcode/1369-get-the-second-most-recent-activity.md
@@ -78,7 +78,6 @@ Bob only has one record, we just take that one.
```sql
-{{< /terminal >}}
SELECT
username,
activity,
diff --git a/content/posts/leetcode/1378-replace-employee-id-with-the-unique-identifier.md b/content/posts/leetcode/1378-replace-employee-id-with-the-unique-identifier.md
index 8f85a200b..0483c84ce 100644
--- a/content/posts/leetcode/1378-replace-employee-id-with-the-unique-identifier.md
+++ b/content/posts/leetcode/1378-replace-employee-id-with-the-unique-identifier.md
@@ -102,7 +102,6 @@ The unique ID of Jonathan is 1.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT unique_id, name
FROM
diff --git a/content/posts/leetcode/1384-total-sales-amount-by-year.md b/content/posts/leetcode/1384-total-sales-amount-by-year.md
index c285ced76..bbeb01c83 100644
--- a/content/posts/leetcode/1384-total-sales-amount-by-year.md
+++ b/content/posts/leetcode/1384-total-sales-amount-by-year.md
@@ -104,7 +104,6 @@ LC Keychain was sold for the period of 2019-12-01 to 2020-01-31, and there are 3
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
s.product_id,
diff --git a/content/posts/leetcode/1393-capital-gainloss.md b/content/posts/leetcode/1393-capital-gainloss.md
index 19ea490a5..4bcf21e41 100644
--- a/content/posts/leetcode/1393-capital-gainloss.md
+++ b/content/posts/leetcode/1393-capital-gainloss.md
@@ -89,7 +89,6 @@ We use `GROUP BY` to group the buy and sell operations of the same stock, and th
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
stock_name,
diff --git a/content/posts/leetcode/1398-customers-who-bought-products-a-and-b-but-not-c.md b/content/posts/leetcode/1398-customers-who-bought-products-a-and-b-but-not-c.md
index 76cf25986..7e015d703 100644
--- a/content/posts/leetcode/1398-customers-who-bought-products-a-and-b-but-not-c.md
+++ b/content/posts/leetcode/1398-customers-who-bought-products-a-and-b-but-not-c.md
@@ -101,7 +101,6 @@ We can use `LEFT JOIN` to join the `Customers` table and the `Orders` table, the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT customer_id, customer_name
FROM
diff --git a/content/posts/leetcode/1407-top-travellers.md b/content/posts/leetcode/1407-top-travellers.md
index ab8d56513..43827399c 100644
--- a/content/posts/leetcode/1407-top-travellers.md
+++ b/content/posts/leetcode/1407-top-travellers.md
@@ -114,7 +114,6 @@ We can use a left join to join the `Users` table with the `Rides` table on the c
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT name, IFNULL(SUM(distance), 0) AS travelled_distance
FROM
diff --git a/content/posts/leetcode/1412-find-the-quiet-students-in-all-exams.md b/content/posts/leetcode/1412-find-the-quiet-students-in-all-exams.md
index 1721d61b6..02be570f5 100644
--- a/content/posts/leetcode/1412-find-the-quiet-students-in-all-exams.md
+++ b/content/posts/leetcode/1412-find-the-quiet-students-in-all-exams.md
@@ -113,7 +113,6 @@ Next, we can perform an inner join between the table $T$ and the table $Student$
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1421-npv-queries.md b/content/posts/leetcode/1421-npv-queries.md
index 7a25b0ad3..e4d096d75 100644
--- a/content/posts/leetcode/1421-npv-queries.md
+++ b/content/posts/leetcode/1421-npv-queries.md
@@ -110,7 +110,6 @@ The npv values of all other queries can be found in the NPV table.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT q.*, IFNULL(npv, 0) AS npv
FROM
diff --git a/content/posts/leetcode/1423-maximum-points-you-can-obtain-from-cards.md b/content/posts/leetcode/1423-maximum-points-you-can-obtain-from-cards.md
index 1cec2305e..080c282e6 100644
--- a/content/posts/leetcode/1423-maximum-points-you-can-obtain-from-cards.md
+++ b/content/posts/leetcode/1423-maximum-points-you-can-obtain-from-cards.md
@@ -286,8 +286,8 @@ end
```
{{< /terminal >}}
+{{< terminal title="Kotlin Code" >}}
```kotlin
-{{< /terminal >}}
class Solution {
fun maxScore(cardPoints: IntArray, k: Int): Int {
val n = cardPoints.size
diff --git a/content/posts/leetcode/1431-kids-with-the-greatest-number-of-candies.md b/content/posts/leetcode/1431-kids-with-the-greatest-number-of-candies.md
index 69cafe5d9..6778a8ea3 100644
--- a/content/posts/leetcode/1431-kids-with-the-greatest-number-of-candies.md
+++ b/content/posts/leetcode/1431-kids-with-the-greatest-number-of-candies.md
@@ -169,8 +169,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
/**
* Note: The returned array must be malloced, assume caller calls free().
diff --git a/content/posts/leetcode/1435-create-a-session-bar-chart.md b/content/posts/leetcode/1435-create-a-session-bar-chart.md
index af1fe527e..9dc5ea33b 100644
--- a/content/posts/leetcode/1435-create-a-session-bar-chart.md
+++ b/content/posts/leetcode/1435-create-a-session-bar-chart.md
@@ -80,7 +80,6 @@ For session_id 5 has a duration greater than or equal to 15 minutes.
```sql
-{{< /terminal >}}
SELECT '[0-5>' AS bin, COUNT(1) AS total FROM Sessions WHERE duration < 300
UNION
SELECT '[5-10>' AS bin, COUNT(1) AS total FROM Sessions WHERE 300 <= duration AND duration < 600
diff --git a/content/posts/leetcode/1436-destination-city.md b/content/posts/leetcode/1436-destination-city.md
index 0d2ae64bd..406de2ac2 100644
--- a/content/posts/leetcode/1436-destination-city.md
+++ b/content/posts/leetcode/1436-destination-city.md
@@ -189,8 +189,8 @@ var destCity = function (paths) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* destCity(char*** paths, int pathsSize, int* pathsColSize) {
for (int i = 0; i < pathsSize; i++) {
int flag = 1;
diff --git a/content/posts/leetcode/1440-evaluate-boolean-expression.md b/content/posts/leetcode/1440-evaluate-boolean-expression.md
index 02959bf20..c326b30b8 100644
--- a/content/posts/leetcode/1440-evaluate-boolean-expression.md
+++ b/content/posts/leetcode/1440-evaluate-boolean-expression.md
@@ -105,7 +105,6 @@ We can associate each row in the `Expressions` table with two rows in the `Varia
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
left_operand,
diff --git a/content/posts/leetcode/1441-build-an-array-with-stack-operations.md b/content/posts/leetcode/1441-build-an-array-with-stack-operations.md
index 3db40f353..374d7152b 100644
--- a/content/posts/leetcode/1441-build-an-array-with-stack-operations.md
+++ b/content/posts/leetcode/1441-build-an-array-with-stack-operations.md
@@ -199,8 +199,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1445-apples-&-oranges.md b/content/posts/leetcode/1445-apples-&-oranges.md
index 4591a3cad..b4833eb33 100644
--- a/content/posts/leetcode/1445-apples-&-oranges.md
+++ b/content/posts/leetcode/1445-apples-&-oranges.md
@@ -84,7 +84,6 @@ We can group the data by date, and then use the `sum` function to calculate the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
sale_date,
diff --git a/content/posts/leetcode/1450-number-of-students-doing-homework-at-a-given-time.md b/content/posts/leetcode/1450-number-of-students-doing-homework-at-a-given-time.md
index 3c7343420..7dd5e0fdd 100644
--- a/content/posts/leetcode/1450-number-of-students-doing-homework-at-a-given-time.md
+++ b/content/posts/leetcode/1450-number-of-students-doing-homework-at-a-given-time.md
@@ -148,8 +148,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int busyStudent(int* startTime, int startTimeSize, int* endTime, int endTimeSize, int queryTime) {
int res = 0;
for (int i = 0; i < startTimeSize; i++) {
diff --git a/content/posts/leetcode/1454-active-users.md b/content/posts/leetcode/1454-active-users.md
index 19500c77e..8ea947506 100644
--- a/content/posts/leetcode/1454-active-users.md
+++ b/content/posts/leetcode/1454-active-users.md
@@ -104,7 +104,6 @@ User Jonathan with id = 7 logged in 7 times in 6 different days, five of them we
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH t AS
(SELECT *,
diff --git a/content/posts/leetcode/1459-rectangles-area.md b/content/posts/leetcode/1459-rectangles-area.md
index 4c79b64cd..d2ffc6413 100644
--- a/content/posts/leetcode/1459-rectangles-area.md
+++ b/content/posts/leetcode/1459-rectangles-area.md
@@ -80,7 +80,6 @@ Note that the rectangle formed by p1 = 1 and p2 = 3 is invalid because the area
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
p1.id AS p1,
diff --git a/content/posts/leetcode/1460-make-two-arrays-equal-by-reversing-subarrays.md b/content/posts/leetcode/1460-make-two-arrays-equal-by-reversing-subarrays.md
index 0f9ce9424..c9fd69161 100644
--- a/content/posts/leetcode/1460-make-two-arrays-equal-by-reversing-subarrays.md
+++ b/content/posts/leetcode/1460-make-two-arrays-equal-by-reversing-subarrays.md
@@ -163,8 +163,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool canBeEqual(int* target, int targetSize, int* arr, int arrSize) {
int count[1001] = {0};
for (int i = 0; i < targetSize; i++) {
diff --git a/content/posts/leetcode/1464-maximum-product-of-two-elements-in-an-array.md b/content/posts/leetcode/1464-maximum-product-of-two-elements-in-an-array.md
index 0c8c2cfa2..a3fe09cdd 100644
--- a/content/posts/leetcode/1464-maximum-product-of-two-elements-in-an-array.md
+++ b/content/posts/leetcode/1464-maximum-product-of-two-elements-in-an-array.md
@@ -185,8 +185,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int maxProduct(int* nums, int numsSize) {
int max = 0;
int submax = 0;
diff --git a/content/posts/leetcode/1468-calculate-salaries.md b/content/posts/leetcode/1468-calculate-salaries.md
index 4dd1e8b1f..886e3cecb 100644
--- a/content/posts/leetcode/1468-calculate-salaries.md
+++ b/content/posts/leetcode/1468-calculate-salaries.md
@@ -100,7 +100,6 @@ For example, Salary for Morninngcat (3, 15) after taxes = 7777 - 7777 * (24 / 10
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
s.company_id,
diff --git a/content/posts/leetcode/1470-shuffle-the-array.md b/content/posts/leetcode/1470-shuffle-the-array.md
index d2a8cb1b9..235aa9633 100644
--- a/content/posts/leetcode/1470-shuffle-the-array.md
+++ b/content/posts/leetcode/1470-shuffle-the-array.md
@@ -145,8 +145,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1479-sales-by-day-of-the-week.md b/content/posts/leetcode/1479-sales-by-day-of-the-week.md
index c7168b2ff..f265f25e8 100644
--- a/content/posts/leetcode/1479-sales-by-day-of-the-week.md
+++ b/content/posts/leetcode/1479-sales-by-day-of-the-week.md
@@ -120,7 +120,6 @@ There are no sales of T-shirts.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
item_category AS category,
diff --git a/content/posts/leetcode/1484-group-sold-products-by-the-date.md b/content/posts/leetcode/1484-group-sold-products-by-the-date.md
index 1c44ae490..c0d88f7b2 100644
--- a/content/posts/leetcode/1484-group-sold-products-by-the-date.md
+++ b/content/posts/leetcode/1484-group-sold-products-by-the-date.md
@@ -80,7 +80,6 @@ For 2020-06-02, the Sold item is (Mask), we just return it.
```sql
-{{< /terminal >}}
SELECT
sell_date,
COUNT(DISTINCT product) AS num_sold,
diff --git a/content/posts/leetcode/1491-average-salary-excluding-the-minimum-and-maximum-salary.md b/content/posts/leetcode/1491-average-salary-excluding-the-minimum-and-maximum-salary.md
index fb43e0bf4..2fb6689fd 100644
--- a/content/posts/leetcode/1491-average-salary-excluding-the-minimum-and-maximum-salary.md
+++ b/content/posts/leetcode/1491-average-salary-excluding-the-minimum-and-maximum-salary.md
@@ -175,8 +175,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
diff --git a/content/posts/leetcode/1495-friendly-movies-streamed-last-month.md b/content/posts/leetcode/1495-friendly-movies-streamed-last-month.md
index e3241998b..6d19808fb 100644
--- a/content/posts/leetcode/1495-friendly-movies-streamed-last-month.md
+++ b/content/posts/leetcode/1495-friendly-movies-streamed-last-month.md
@@ -109,7 +109,6 @@ We can first use an equi-join to join the two tables based on the `content_id` f
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT title
FROM
diff --git a/content/posts/leetcode/1501-countries-you-can-safely-invest-in.md b/content/posts/leetcode/1501-countries-you-can-safely-invest-in.md
index 00db0fc57..776a06538 100644
--- a/content/posts/leetcode/1501-countries-you-can-safely-invest-in.md
+++ b/content/posts/leetcode/1501-countries-you-can-safely-invest-in.md
@@ -139,7 +139,6 @@ We can use an equi-join to join the `Person` table and the `Calls` table on the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT country
FROM
@@ -162,7 +161,6 @@ WHERE duration > (SELECT AVG(duration) FROM Calls);
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1502-can-make-arithmetic-progression-from-sequence.md b/content/posts/leetcode/1502-can-make-arithmetic-progression-from-sequence.md
index 7d49375c3..50cb493a0 100644
--- a/content/posts/leetcode/1502-can-make-arithmetic-progression-from-sequence.md
+++ b/content/posts/leetcode/1502-can-make-arithmetic-progression-from-sequence.md
@@ -168,8 +168,8 @@ var canMakeArithmeticProgression = function (arr) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/1511-customer-order-frequency.md b/content/posts/leetcode/1511-customer-order-frequency.md
index c560f2a1c..3ffff9bc1 100644
--- a/content/posts/leetcode/1511-customer-order-frequency.md
+++ b/content/posts/leetcode/1511-customer-order-frequency.md
@@ -134,7 +134,6 @@ We can use the `JOIN` statement to join the `Orders` table and the `Product` tab
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT customer_id, name
FROM
diff --git a/content/posts/leetcode/1512-number-of-good-pairs.md b/content/posts/leetcode/1512-number-of-good-pairs.md
index dc2d5f3b3..371e0d7b8 100644
--- a/content/posts/leetcode/1512-number-of-good-pairs.md
+++ b/content/posts/leetcode/1512-number-of-good-pairs.md
@@ -169,8 +169,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int numIdenticalPairs(int* nums, int numsSize) {
int cnt[101] = {0};
int ans = 0;
@@ -283,8 +283,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int numIdenticalPairs(int* nums, int numsSize) {
int cnt[101] = {0};
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/1517-find-users-with-valid-e-mails.md b/content/posts/leetcode/1517-find-users-with-valid-e-mails.md
index a8eac3eee..a2c7f350b 100644
--- a/content/posts/leetcode/1517-find-users-with-valid-e-mails.md
+++ b/content/posts/leetcode/1517-find-users-with-valid-e-mails.md
@@ -87,7 +87,6 @@ The mail of user 7 starts with a period.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT *
FROM Users
diff --git a/content/posts/leetcode/1523-count-odd-numbers-in-an-interval-range.md b/content/posts/leetcode/1523-count-odd-numbers-in-an-interval-range.md
index 07d7ed484..0308e3a6f 100644
--- a/content/posts/leetcode/1523-count-odd-numbers-in-an-interval-range.md
+++ b/content/posts/leetcode/1523-count-odd-numbers-in-an-interval-range.md
@@ -119,8 +119,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countOdds(int low, int high) {
return ((high + 1) >> 1) - (low >> 1);
}
diff --git a/content/posts/leetcode/1527-patients-with-a-condition.md b/content/posts/leetcode/1527-patients-with-a-condition.md
index fea52045b..25739ce18 100644
--- a/content/posts/leetcode/1527-patients-with-a-condition.md
+++ b/content/posts/leetcode/1527-patients-with-a-condition.md
@@ -74,7 +74,6 @@ Patients table:
```sql
-{{< /terminal >}}
SELECT
patient_id,
patient_name,
diff --git a/content/posts/leetcode/1532-the-most-recent-three-orders.md b/content/posts/leetcode/1532-the-most-recent-three-orders.md
index 4e7a63d7b..383e90d7c 100644
--- a/content/posts/leetcode/1532-the-most-recent-three-orders.md
+++ b/content/posts/leetcode/1532-the-most-recent-three-orders.md
@@ -122,7 +122,6 @@ We can use an equi-join to join the `Customers` table and the `Orders` table bas
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1543-fix-product-name-format.md b/content/posts/leetcode/1543-fix-product-name-format.md
index ad8de0590..03ec0283f 100644
--- a/content/posts/leetcode/1543-fix-product-name-format.md
+++ b/content/posts/leetcode/1543-fix-product-name-format.md
@@ -87,7 +87,6 @@ In March, one matryoshka was sold.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1549-the-most-recent-orders-for-each-product.md b/content/posts/leetcode/1549-the-most-recent-orders-for-each-product.md
index 1e2263022..c3d464fe4 100644
--- a/content/posts/leetcode/1549-the-most-recent-orders-for-each-product.md
+++ b/content/posts/leetcode/1549-the-most-recent-orders-for-each-product.md
@@ -137,7 +137,6 @@ We can use an equi-join to join the `Orders` table and the `Products` table base
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1555-bank-account-summary.md b/content/posts/leetcode/1555-bank-account-summary.md
index 4dc4525f7..d5dd7cab0 100644
--- a/content/posts/leetcode/1555-bank-account-summary.md
+++ b/content/posts/leetcode/1555-bank-account-summary.md
@@ -114,7 +114,6 @@ Luis did not received any transfer, credit = $800
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
t.user_id,
diff --git a/content/posts/leetcode/1561-maximum-number-of-coins-you-can-get.md b/content/posts/leetcode/1561-maximum-number-of-coins-you-can-get.md
index 50072196b..e0e5bfe93 100644
--- a/content/posts/leetcode/1561-maximum-number-of-coins-you-can-get.md
+++ b/content/posts/leetcode/1561-maximum-number-of-coins-you-can-get.md
@@ -156,8 +156,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/1565-unique-orders-and-customers-per-month.md b/content/posts/leetcode/1565-unique-orders-and-customers-per-month.md
index 7619840cb..8d37df82f 100644
--- a/content/posts/leetcode/1565-unique-orders-and-customers-per-month.md
+++ b/content/posts/leetcode/1565-unique-orders-and-customers-per-month.md
@@ -86,7 +86,6 @@ In January 2021 we have two orders from 2 different customers, but only one of t
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
DATE_FORMAT(order_date, '%Y-%m') AS month,
diff --git a/content/posts/leetcode/1571-warehouse-manager.md b/content/posts/leetcode/1571-warehouse-manager.md
index 99e5a12b2..5e6eae165 100644
--- a/content/posts/leetcode/1571-warehouse-manager.md
+++ b/content/posts/leetcode/1571-warehouse-manager.md
@@ -114,7 +114,6 @@ We can use an inner join to join the `Warehouse` table and the `Products` table
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
name AS warehouse_name,
diff --git a/content/posts/leetcode/1572-matrix-diagonal-sum.md b/content/posts/leetcode/1572-matrix-diagonal-sum.md
index 02debb4e4..f191db7b8 100644
--- a/content/posts/leetcode/1572-matrix-diagonal-sum.md
+++ b/content/posts/leetcode/1572-matrix-diagonal-sum.md
@@ -160,8 +160,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int diagonalSum(int** mat, int matSize, int* matColSize) {
int ans = 0;
for (int i = 0; i < matSize; i++) {
diff --git a/content/posts/leetcode/1581-customer-who-visited-but-did-not-make-any-transactions.md b/content/posts/leetcode/1581-customer-who-visited-but-did-not-make-any-transactions.md
index f2a1c1233..adbb8fbff 100644
--- a/content/posts/leetcode/1581-customer-who-visited-but-did-not-make-any-transactions.md
+++ b/content/posts/leetcode/1581-customer-who-visited-but-did-not-make-any-transactions.md
@@ -109,7 +109,6 @@ We can use a subquery to first find all `visit_id`s that have not made any trans
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT customer_id, COUNT(1) AS count_no_trans
FROM Visits
@@ -127,7 +126,6 @@ We can also use a left join to join the `Visits` table and the `Transactions` ta
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT customer_id, COUNT(1) AS count_no_trans
FROM
diff --git a/content/posts/leetcode/1582-special-positions-in-a-binary-matrix.md b/content/posts/leetcode/1582-special-positions-in-a-binary-matrix.md
index ec29c6013..086f9e799 100644
--- a/content/posts/leetcode/1582-special-positions-in-a-binary-matrix.md
+++ b/content/posts/leetcode/1582-special-positions-in-a-binary-matrix.md
@@ -213,8 +213,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int numSpecial(int** mat, int matSize, int* matColSize) {
int m = matSize;
int n = *matColSize;
diff --git a/content/posts/leetcode/1587-bank-account-summary-ii.md b/content/posts/leetcode/1587-bank-account-summary-ii.md
index 2c1768cfa..c4ce860d2 100644
--- a/content/posts/leetcode/1587-bank-account-summary-ii.md
+++ b/content/posts/leetcode/1587-bank-account-summary-ii.md
@@ -106,7 +106,6 @@ We can use an equi-join to join the `Users` table and the `Transactions` table o
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
name,
diff --git a/content/posts/leetcode/1588-sum-of-all-odd-length-subarrays.md b/content/posts/leetcode/1588-sum-of-all-odd-length-subarrays.md
index 95bf005fd..2194f722b 100644
--- a/content/posts/leetcode/1588-sum-of-all-odd-length-subarrays.md
+++ b/content/posts/leetcode/1588-sum-of-all-odd-length-subarrays.md
@@ -190,8 +190,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int sumOddLengthSubarrays(int* arr, int arrSize) {
int ans = 0;
for (int i = 0; i < arrSize; ++i) {
diff --git a/content/posts/leetcode/1596-the-most-frequently-ordered-products-for-each-customer.md b/content/posts/leetcode/1596-the-most-frequently-ordered-products-for-each-customer.md
index 0e571a61c..9209298aa 100644
--- a/content/posts/leetcode/1596-the-most-frequently-ordered-products-for-each-customer.md
+++ b/content/posts/leetcode/1596-the-most-frequently-ordered-products-for-each-customer.md
@@ -142,7 +142,6 @@ We group the `Orders` table by `customer_id` and `product_id`, and then use the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1598-crawler-log-folder.md b/content/posts/leetcode/1598-crawler-log-folder.md
index a3a139a29..6180763d2 100644
--- a/content/posts/leetcode/1598-crawler-log-folder.md
+++ b/content/posts/leetcode/1598-crawler-log-folder.md
@@ -182,8 +182,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int minOperations(char** logs, int logsSize) {
diff --git a/content/posts/leetcode/1603-design-parking-system.md b/content/posts/leetcode/1603-design-parking-system.md
index b53dcedf2..0def60a4b 100644
--- a/content/posts/leetcode/1603-design-parking-system.md
+++ b/content/posts/leetcode/1603-design-parking-system.md
@@ -243,8 +243,8 @@ public class ParkingSystem {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
typedef struct {
int* count;
} ParkingSystem;
diff --git a/content/posts/leetcode/1607-sellers-with-no-sales.md b/content/posts/leetcode/1607-sellers-with-no-sales.md
index 38cbf1a11..5ff6f12fa 100644
--- a/content/posts/leetcode/1607-sellers-with-no-sales.md
+++ b/content/posts/leetcode/1607-sellers-with-no-sales.md
@@ -126,7 +126,6 @@ We can use a left join to join the `Seller` table with the `Orders` table on the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT seller_name
FROM
diff --git a/content/posts/leetcode/1613-find-the-missing-ids.md b/content/posts/leetcode/1613-find-the-missing-ids.md
index e73a55e4a..562756d0f 100644
--- a/content/posts/leetcode/1613-find-the-missing-ids.md
+++ b/content/posts/leetcode/1613-find-the-missing-ids.md
@@ -73,7 +73,6 @@ The maximum customer_id present in the table is 5, so in the range [1,5], IDs 2
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH RECURSIVE
t AS (
diff --git a/content/posts/leetcode/1623-all-valid-triplets-that-can-represent-a-country.md b/content/posts/leetcode/1623-all-valid-triplets-that-can-represent-a-country.md
index fac7e67d1..3cf4d44d5 100644
--- a/content/posts/leetcode/1623-all-valid-triplets-that-can-represent-a-country.md
+++ b/content/posts/leetcode/1623-all-valid-triplets-that-can-represent-a-country.md
@@ -132,7 +132,6 @@ Let us see all the possible triplets.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
a.student_name AS member_A,
diff --git a/content/posts/leetcode/1624-largest-substring-between-two-equal-characters.md b/content/posts/leetcode/1624-largest-substring-between-two-equal-characters.md
index fe26e73cb..aadf01f8f 100644
--- a/content/posts/leetcode/1624-largest-substring-between-two-equal-characters.md
+++ b/content/posts/leetcode/1624-largest-substring-between-two-equal-characters.md
@@ -181,8 +181,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int maxLengthBetweenEqualCharacters(char* s) {
diff --git a/content/posts/leetcode/1633-percentage-of-users-attended-a-contest.md b/content/posts/leetcode/1633-percentage-of-users-attended-a-contest.md
index cf171e35c..241316bee 100644
--- a/content/posts/leetcode/1633-percentage-of-users-attended-a-contest.md
+++ b/content/posts/leetcode/1633-percentage-of-users-attended-a-contest.md
@@ -110,7 +110,6 @@ We can group the `Register` table by `contest_id` and count the number of regist
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
contest_id,
diff --git a/content/posts/leetcode/1635-hopper-company-queries-i.md b/content/posts/leetcode/1635-hopper-company-queries-i.md
index ed4f1803c..d05cedf08 100644
--- a/content/posts/leetcode/1635-hopper-company-queries-i.md
+++ b/content/posts/leetcode/1635-hopper-company-queries-i.md
@@ -172,7 +172,6 @@ By the end of December --> six active drivers (10, 8, 5, 7, 4, 1) and one acc
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
recursive Months AS (
diff --git a/content/posts/leetcode/1645-hopper-company-queries-ii.md b/content/posts/leetcode/1645-hopper-company-queries-ii.md
index 5f72292d1..2055dbb50 100644
--- a/content/posts/leetcode/1645-hopper-company-queries-ii.md
+++ b/content/posts/leetcode/1645-hopper-company-queries-ii.md
@@ -169,7 +169,6 @@ By the end of December --> six active drivers (10, 8, 5, 7, 4, 1) and one acc
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH RECURSIVE
Month AS (
diff --git a/content/posts/leetcode/1651-hopper-company-queries-iii.md b/content/posts/leetcode/1651-hopper-company-queries-iii.md
index db818e375..6b34707c4 100644
--- a/content/posts/leetcode/1651-hopper-company-queries-iii.md
+++ b/content/posts/leetcode/1651-hopper-company-queries-iii.md
@@ -165,7 +165,6 @@ By the end of October --> average_ride_distance = (0+163+6)/3=56.33, average_
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH RECURSIVE
Months AS (
diff --git a/content/posts/leetcode/1658-minimum-operations-to-reduce-x-to-zero.md b/content/posts/leetcode/1658-minimum-operations-to-reduce-x-to-zero.md
index c3a9c610b..f9f43d2da 100644
--- a/content/posts/leetcode/1658-minimum-operations-to-reduce-x-to-zero.md
+++ b/content/posts/leetcode/1658-minimum-operations-to-reduce-x-to-zero.md
@@ -213,8 +213,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int minOperations(int* nums, int numsSize, int x) {
diff --git a/content/posts/leetcode/1661-average-time-of-process-per-machine.md b/content/posts/leetcode/1661-average-time-of-process-per-machine.md
index 9247d228b..c32931f3d 100644
--- a/content/posts/leetcode/1661-average-time-of-process-per-machine.md
+++ b/content/posts/leetcode/1661-average-time-of-process-per-machine.md
@@ -99,7 +99,6 @@ Note that each machine has $2$ process tasks, so we need to multiply the calcula
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
machine_id,
@@ -124,7 +123,6 @@ GROUP BY 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
machine_id,
diff --git a/content/posts/leetcode/1662-check-if-two-string-arrays-are-equivalent.md b/content/posts/leetcode/1662-check-if-two-string-arrays-are-equivalent.md
index 2940dff4e..d01a2b923 100644
--- a/content/posts/leetcode/1662-check-if-two-string-arrays-are-equivalent.md
+++ b/content/posts/leetcode/1662-check-if-two-string-arrays-are-equivalent.md
@@ -119,8 +119,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool arrayStringsAreEqual(char** word1, int word1Size, char** word2, int word2Size) {
int i = 0;
int j = 0;
diff --git a/content/posts/leetcode/1667-fix-names-in-a-table.md b/content/posts/leetcode/1667-fix-names-in-a-table.md
index 498f9d88c..e7a9cbdf2 100644
--- a/content/posts/leetcode/1667-fix-names-in-a-table.md
+++ b/content/posts/leetcode/1667-fix-names-in-a-table.md
@@ -68,7 +68,6 @@ Users table:
```sql
-{{< /terminal >}}
SELECT
user_id,
CONCAT(UPPER(LEFT(name, 1)), LOWER(SUBSTRING(name, 2))) AS name
@@ -86,7 +85,6 @@ ORDER BY
```sql
-{{< /terminal >}}
SELECT
user_id,
CONCAT(
diff --git a/content/posts/leetcode/1668-maximum-repeating-substring.md b/content/posts/leetcode/1668-maximum-repeating-substring.md
index 80384cb75..02a83da61 100644
--- a/content/posts/leetcode/1668-maximum-repeating-substring.md
+++ b/content/posts/leetcode/1668-maximum-repeating-substring.md
@@ -159,8 +159,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int findWord(int i, char* sequence, char* word) {
diff --git a/content/posts/leetcode/1672-richest-customer-wealth.md b/content/posts/leetcode/1672-richest-customer-wealth.md
index ac82a1999..c5e33c355 100644
--- a/content/posts/leetcode/1672-richest-customer-wealth.md
+++ b/content/posts/leetcode/1672-richest-customer-wealth.md
@@ -182,8 +182,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int maximumWealth(int** accounts, int accountsSize, int* accountsColSize) {
@@ -200,8 +200,8 @@ int maximumWealth(int** accounts, int accountsSize, int* accountsColSize) {
```
{{< /terminal >}}
+{{< terminal title="Kotlin Code" >}}
```kotlin
-{{< /terminal >}}
class Solution {
fun maximumWealth(accounts: Array): Int {
var max = 0
diff --git a/content/posts/leetcode/1677-product's-worth-over-invoices.md b/content/posts/leetcode/1677-product's-worth-over-invoices.md
index 198cb2026..0f4bd1c52 100644
--- a/content/posts/leetcode/1677-product's-worth-over-invoices.md
+++ b/content/posts/leetcode/1677-product's-worth-over-invoices.md
@@ -111,7 +111,6 @@ Invoice table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
name,
diff --git a/content/posts/leetcode/1678-goal-parser-interpretation.md b/content/posts/leetcode/1678-goal-parser-interpretation.md
index 882b15bb2..a0c764781 100644
--- a/content/posts/leetcode/1678-goal-parser-interpretation.md
+++ b/content/posts/leetcode/1678-goal-parser-interpretation.md
@@ -125,8 +125,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* interpret(char* command) {
int n = strlen(command);
char* ans = malloc(sizeof(char) * n + 1);
diff --git a/content/posts/leetcode/1683-invalid-tweets.md b/content/posts/leetcode/1683-invalid-tweets.md
index c13f65271..c43189672 100644
--- a/content/posts/leetcode/1683-invalid-tweets.md
+++ b/content/posts/leetcode/1683-invalid-tweets.md
@@ -76,7 +76,6 @@ For this problem, we can directly use the `CHAR_LENGTH` function to get the leng
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
tweet_id
diff --git a/content/posts/leetcode/1684-count-the-number-of-consistent-strings.md b/content/posts/leetcode/1684-count-the-number-of-consistent-strings.md
index ef24ceb3d..1624719d8 100644
--- a/content/posts/leetcode/1684-count-the-number-of-consistent-strings.md
+++ b/content/posts/leetcode/1684-count-the-number-of-consistent-strings.md
@@ -195,8 +195,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countConsistentStrings(char* allowed, char** words, int wordsSize) {
int n = strlen(allowed);
int make[26] = {0};
@@ -356,8 +356,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int helper(char* s) {
int res = 0;
int n = strlen(s);
diff --git a/content/posts/leetcode/1689-partitioning-into-minimum-number-of-deci-binary-numbers.md b/content/posts/leetcode/1689-partitioning-into-minimum-number-of-deci-binary-numbers.md
index 30f1f90c5..2c723f1ac 100644
--- a/content/posts/leetcode/1689-partitioning-into-minimum-number-of-deci-binary-numbers.md
+++ b/content/posts/leetcode/1689-partitioning-into-minimum-number-of-deci-binary-numbers.md
@@ -137,8 +137,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minPartitions(char* n) {
int ans = 0;
for (int i = 0; n[i]; i++) {
diff --git a/content/posts/leetcode/1693-daily-leads-and-partners.md b/content/posts/leetcode/1693-daily-leads-and-partners.md
index 4a52dbeb9..a82136892 100644
--- a/content/posts/leetcode/1693-daily-leads-and-partners.md
+++ b/content/posts/leetcode/1693-daily-leads-and-partners.md
@@ -86,7 +86,6 @@ We can use the `GROUP BY` statement to group the data by the `date_id` and `make
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
date_id,
diff --git a/content/posts/leetcode/1699-number-of-calls-between-two-persons.md b/content/posts/leetcode/1699-number-of-calls-between-two-persons.md
index aa20d311b..38b44a178 100644
--- a/content/posts/leetcode/1699-number-of-calls-between-two-persons.md
+++ b/content/posts/leetcode/1699-number-of-calls-between-two-persons.md
@@ -82,7 +82,6 @@ We can use the `if` function or the `least` and `greatest` functions to convert
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
IF(from_id < to_id, from_id, to_id) AS person1,
@@ -101,7 +100,6 @@ GROUP BY 1, 2;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
LEAST(from_id, to_id) AS person1,
diff --git a/content/posts/leetcode/1700-number-of-students-unable-to-eat-lunch.md b/content/posts/leetcode/1700-number-of-students-unable-to-eat-lunch.md
index bd4c3d01a..aa40b7b45 100644
--- a/content/posts/leetcode/1700-number-of-students-unable-to-eat-lunch.md
+++ b/content/posts/leetcode/1700-number-of-students-unable-to-eat-lunch.md
@@ -190,8 +190,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countStudents(int* students, int studentsSize, int* sandwiches, int sandwichesSize) {
int count[2] = {0};
for (int i = 0; i < studentsSize; i++) {
diff --git a/content/posts/leetcode/1709-biggest-window-between-visits.md b/content/posts/leetcode/1709-biggest-window-between-visits.md
index 8c6c73027..97a0e44a6 100644
--- a/content/posts/leetcode/1709-biggest-window-between-visits.md
+++ b/content/posts/leetcode/1709-biggest-window-between-visits.md
@@ -88,7 +88,6 @@ We can use the window function `LEAD` to obtain the date of the next visit for e
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1715-count-apples-and-oranges.md b/content/posts/leetcode/1715-count-apples-and-oranges.md
index 803821b98..4ed11b2e7 100644
--- a/content/posts/leetcode/1715-count-apples-and-oranges.md
+++ b/content/posts/leetcode/1715-count-apples-and-oranges.md
@@ -109,7 +109,6 @@ Total number of oranges = 15 + 25 + 8 + 28 + 15 + 15 + 17 = 123
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
SUM(IFNULL(b.apple_count, 0) + IFNULL(c.apple_count, 0)) AS apple_count,
diff --git a/content/posts/leetcode/1729-find-followers-count.md b/content/posts/leetcode/1729-find-followers-count.md
index 8a06c8336..7b0c8bb5c 100644
--- a/content/posts/leetcode/1729-find-followers-count.md
+++ b/content/posts/leetcode/1729-find-followers-count.md
@@ -76,7 +76,6 @@ We can directly group the `Followers` table by `user_id`, and use the `COUNT` fu
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT user_id, COUNT(1) AS followers_count
FROM Followers
diff --git a/content/posts/leetcode/1731-the-number-of-employees-which-report-to-each-employee.md b/content/posts/leetcode/1731-the-number-of-employees-which-report-to-each-employee.md
index ddd077bc2..667dd5614 100644
--- a/content/posts/leetcode/1731-the-number-of-employees-which-report-to-each-employee.md
+++ b/content/posts/leetcode/1731-the-number-of-employees-which-report-to-each-employee.md
@@ -76,7 +76,6 @@ We can use self-join to connect the information of each employee's superior mana
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
e2.employee_id,
diff --git a/content/posts/leetcode/1732-find-the-highest-altitude.md b/content/posts/leetcode/1732-find-the-highest-altitude.md
index e6873e5ef..ca5c7ab08 100644
--- a/content/posts/leetcode/1732-find-the-highest-altitude.md
+++ b/content/posts/leetcode/1732-find-the-highest-altitude.md
@@ -179,8 +179,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int largestAltitude(int* gain, int gainSize) {
diff --git a/content/posts/leetcode/1741-find-total-time-spent-by-each-employee.md b/content/posts/leetcode/1741-find-total-time-spent-by-each-employee.md
index 01875894e..06b5df577 100644
--- a/content/posts/leetcode/1741-find-total-time-spent-by-each-employee.md
+++ b/content/posts/leetcode/1741-find-total-time-spent-by-each-employee.md
@@ -83,7 +83,6 @@ We can first group by `emp_id` and `event_day`, and then calculate the total tim
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT event_day AS day, emp_id, SUM(out_time - in_time) AS total_time
FROM Employees
diff --git a/content/posts/leetcode/1747-leetflex-banned-accounts.md b/content/posts/leetcode/1747-leetflex-banned-accounts.md
index 5fe3b4b34..6267af11f 100644
--- a/content/posts/leetcode/1747-leetflex-banned-accounts.md
+++ b/content/posts/leetcode/1747-leetflex-banned-accounts.md
@@ -88,7 +88,6 @@ We can use a self-join to find out the cases where each account logs in from dif
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT
a.account_id
diff --git a/content/posts/leetcode/1750-minimum-length-of-string-after-deleting-similar-ends.md b/content/posts/leetcode/1750-minimum-length-of-string-after-deleting-similar-ends.md
index 6952935e7..736e7e037 100644
--- a/content/posts/leetcode/1750-minimum-length-of-string-after-deleting-similar-ends.md
+++ b/content/posts/leetcode/1750-minimum-length-of-string-after-deleting-similar-ends.md
@@ -199,8 +199,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minimumLength(char* s) {
int n = strlen(s);
int start = 0;
diff --git a/content/posts/leetcode/1752-check-if-array-is-sorted-and-rotated.md b/content/posts/leetcode/1752-check-if-array-is-sorted-and-rotated.md
index 9b3190c8d..6d5926dc5 100644
--- a/content/posts/leetcode/1752-check-if-array-is-sorted-and-rotated.md
+++ b/content/posts/leetcode/1752-check-if-array-is-sorted-and-rotated.md
@@ -145,8 +145,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool check(int* nums, int numsSize) {
int count = 0;
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/1754-largest-merge-of-two-strings.md b/content/posts/leetcode/1754-largest-merge-of-two-strings.md
index 3acdbfa74..de7079a76 100644
--- a/content/posts/leetcode/1754-largest-merge-of-two-strings.md
+++ b/content/posts/leetcode/1754-largest-merge-of-two-strings.md
@@ -202,8 +202,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* largestMerge(char* word1, char* word2) {
int m = strlen(word1);
int n = strlen(word2);
diff --git a/content/posts/leetcode/1757-recyclable-and-low-fat-products.md b/content/posts/leetcode/1757-recyclable-and-low-fat-products.md
index 14d8aca80..d05ff3625 100644
--- a/content/posts/leetcode/1757-recyclable-and-low-fat-products.md
+++ b/content/posts/leetcode/1757-recyclable-and-low-fat-products.md
@@ -87,7 +87,6 @@ def find_products(products: pd.DataFrame) -> pd.DataFrame:
{{< /terminal >}}
```sql
-{{< /terminal >}}
SELECT
product_id
FROM Products
diff --git a/content/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string.md b/content/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string.md
index f6373e534..130071e9a 100644
--- a/content/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string.md
+++ b/content/posts/leetcode/1758-minimum-changes-to-make-alternating-binary-string.md
@@ -144,8 +144,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int minOperations(char* s) {
diff --git a/content/posts/leetcode/1759-count-number-of-homogenous-substrings.md b/content/posts/leetcode/1759-count-number-of-homogenous-substrings.md
index 17bbba043..4821336e7 100644
--- a/content/posts/leetcode/1759-count-number-of-homogenous-substrings.md
+++ b/content/posts/leetcode/1759-count-number-of-homogenous-substrings.md
@@ -211,8 +211,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countHomogenous(char* s) {
int MOD = 1e9 + 7;
int ans = 0;
diff --git a/content/posts/leetcode/1767-find-the-subtasks-that-did-not-execute.md b/content/posts/leetcode/1767-find-the-subtasks-that-did-not-execute.md
index b558592e9..fa616c7c6 100644
--- a/content/posts/leetcode/1767-find-the-subtasks-that-did-not-execute.md
+++ b/content/posts/leetcode/1767-find-the-subtasks-that-did-not-execute.md
@@ -103,7 +103,6 @@ We can generate a table recursively that contains all pairs of (parent task, chi
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH RECURSIVE
T(task_id, subtask_id) AS (
diff --git a/content/posts/leetcode/1768-merge-strings-alternately.md b/content/posts/leetcode/1768-merge-strings-alternately.md
index 989655392..90c27ed5b 100644
--- a/content/posts/leetcode/1768-merge-strings-alternately.md
+++ b/content/posts/leetcode/1768-merge-strings-alternately.md
@@ -178,8 +178,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* mergeAlternately(char* word1, char* word2) {
int m = strlen(word1);
int n = strlen(word2);
diff --git a/content/posts/leetcode/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.md b/content/posts/leetcode/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.md
index a810c5fbc..d2c92e67c 100644
--- a/content/posts/leetcode/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.md
+++ b/content/posts/leetcode/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.md
@@ -217,8 +217,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
@@ -401,8 +401,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1773-count-items-matching-a-rule.md b/content/posts/leetcode/1773-count-items-matching-a-rule.md
index a76bdcf0a..01e931049 100644
--- a/content/posts/leetcode/1773-count-items-matching-a-rule.md
+++ b/content/posts/leetcode/1773-count-items-matching-a-rule.md
@@ -138,8 +138,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countMatches(char*** items, int itemsSize, int* itemsColSize, char* ruleKey, char* ruleValue) {
int k = strcmp(ruleKey, "type") == 0 ? 0 : strcmp(ruleKey, "color") == 0 ? 1
: 2;
diff --git a/content/posts/leetcode/1777-product's-price-for-each-store.md b/content/posts/leetcode/1777-product's-price-for-each-store.md
index cee1caf8e..12615a9d2 100644
--- a/content/posts/leetcode/1777-product's-price-for-each-store.md
+++ b/content/posts/leetcode/1777-product's-price-for-each-store.md
@@ -76,7 +76,6 @@ Product 1 price's are 70 for store1, 80 for store3 and, it's not sold in
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
product_id,
diff --git a/content/posts/leetcode/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.md b/content/posts/leetcode/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.md
index 85b183547..203960c36 100644
--- a/content/posts/leetcode/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.md
+++ b/content/posts/leetcode/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.md
@@ -188,8 +188,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int nearestValidPoint(int x, int y, int** points, int pointsSize, int* pointsColSize) {
int ans = -1;
int min = INT_MAX;
diff --git a/content/posts/leetcode/1783-grand-slam-titles.md b/content/posts/leetcode/1783-grand-slam-titles.md
index 86a06d73e..f6e91cc04 100644
--- a/content/posts/leetcode/1783-grand-slam-titles.md
+++ b/content/posts/leetcode/1783-grand-slam-titles.md
@@ -101,7 +101,6 @@ We can use `UNION ALL` to merge all player IDs who won Grand Slam titles into a
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -132,7 +131,6 @@ GROUP BY 1;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
player_id,
diff --git a/content/posts/leetcode/1785-minimum-elements-to-add-to-form-a-given-sum.md b/content/posts/leetcode/1785-minimum-elements-to-add-to-form-a-given-sum.md
index e2479fc10..d9541f38d 100644
--- a/content/posts/leetcode/1785-minimum-elements-to-add-to-form-a-given-sum.md
+++ b/content/posts/leetcode/1785-minimum-elements-to-add-to-form-a-given-sum.md
@@ -150,8 +150,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minElements(int* nums, int numsSize, int limit, int goal) {
long long sum = 0;
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/1789-primary-department-for-each-employee.md b/content/posts/leetcode/1789-primary-department-for-each-employee.md
index 09d392911..8285fc6da 100644
--- a/content/posts/leetcode/1789-primary-department-for-each-employee.md
+++ b/content/posts/leetcode/1789-primary-department-for-each-employee.md
@@ -87,7 +87,6 @@ We can first query all employees who already have a direct department, and then
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT employee_id, department_id
FROM Employee
diff --git a/content/posts/leetcode/1790-check-if-one-string-swap-can-make-strings-equal.md b/content/posts/leetcode/1790-check-if-one-string-swap-can-make-strings-equal.md
index f2f3fc54d..4506c58b7 100644
--- a/content/posts/leetcode/1790-check-if-one-string-swap-can-make-strings-equal.md
+++ b/content/posts/leetcode/1790-check-if-one-string-swap-can-make-strings-equal.md
@@ -195,8 +195,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool areAlmostEqual(char* s1, char* s2) {
int n = strlen(s1);
int i1 = -1;
diff --git a/content/posts/leetcode/1795-rearrange-products-table.md b/content/posts/leetcode/1795-rearrange-products-table.md
index 0fbc45718..57873e74e 100644
--- a/content/posts/leetcode/1795-rearrange-products-table.md
+++ b/content/posts/leetcode/1795-rearrange-products-table.md
@@ -79,7 +79,6 @@ We can select the products and prices for each store, and then use the `UNION` o
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT product_id, 'store1' AS store, store1 AS price FROM Products WHERE store1 IS NOT NULL
UNION
diff --git a/content/posts/leetcode/1796-second-largest-digit-in-a-string.md b/content/posts/leetcode/1796-second-largest-digit-in-a-string.md
index 634de9fef..2e505c872 100644
--- a/content/posts/leetcode/1796-second-largest-digit-in-a-string.md
+++ b/content/posts/leetcode/1796-second-largest-digit-in-a-string.md
@@ -185,8 +185,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int secondHighest(char* s) {
int first = -1;
int second = -1;
diff --git a/content/posts/leetcode/1800-maximum-ascending-subarray-sum.md b/content/posts/leetcode/1800-maximum-ascending-subarray-sum.md
index a55728e13..5767feb3d 100644
--- a/content/posts/leetcode/1800-maximum-ascending-subarray-sum.md
+++ b/content/posts/leetcode/1800-maximum-ascending-subarray-sum.md
@@ -185,8 +185,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int maxAscendingSum(int* nums, int numsSize) {
diff --git a/content/posts/leetcode/1809-ad-free-sessions.md b/content/posts/leetcode/1809-ad-free-sessions.md
index 4351f5c3e..5d801f8d4 100644
--- a/content/posts/leetcode/1809-ad-free-sessions.md
+++ b/content/posts/leetcode/1809-ad-free-sessions.md
@@ -105,7 +105,6 @@ We can see that sessions 1 and 4 had at least one ad. Sessions 2, 3, and 5 did n
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT session_id
FROM Playback
diff --git a/content/posts/leetcode/1811-find-interview-candidates.md b/content/posts/leetcode/1811-find-interview-candidates.md
index c06d269bf..b46f74e0c 100644
--- a/content/posts/leetcode/1811-find-interview-candidates.md
+++ b/content/posts/leetcode/1811-find-interview-candidates.md
@@ -122,7 +122,6 @@ Quarz won a medal in 5 consecutive contests (190, 191, 192, 193, and 194), so we
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/1812-determine-color-of-a-chessboard-square.md b/content/posts/leetcode/1812-determine-color-of-a-chessboard-square.md
index 5e743866e..d03872e5e 100644
--- a/content/posts/leetcode/1812-determine-color-of-a-chessboard-square.md
+++ b/content/posts/leetcode/1812-determine-color-of-a-chessboard-square.md
@@ -142,8 +142,8 @@ var squareIsWhite = function (coordinates) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool squareIsWhite(char* coordinates) {
return (coordinates[0] + coordinates[1]) & 1;
}
diff --git a/content/posts/leetcode/1821-find-customers-with-positive-revenue-this-year.md b/content/posts/leetcode/1821-find-customers-with-positive-revenue-this-year.md
index 29a6dd70a..12a2f2d0d 100644
--- a/content/posts/leetcode/1821-find-customers-with-positive-revenue-this-year.md
+++ b/content/posts/leetcode/1821-find-customers-with-positive-revenue-this-year.md
@@ -83,7 +83,6 @@ We can directly use the `WHERE` clause to filter out the customers whose `year`
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
customer_id
diff --git a/content/posts/leetcode/1822-sign-of-the-product-of-an-array.md b/content/posts/leetcode/1822-sign-of-the-product-of-an-array.md
index 69d6cd336..7fea41974 100644
--- a/content/posts/leetcode/1822-sign-of-the-product-of-an-array.md
+++ b/content/posts/leetcode/1822-sign-of-the-product-of-an-array.md
@@ -186,8 +186,8 @@ var arraySign = function (nums) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int arraySign(int* nums, int numsSize) {
int ans = 1;
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/1827-minimum-operations-to-make-the-array-increasing.md b/content/posts/leetcode/1827-minimum-operations-to-make-the-array-increasing.md
index 4eda48e20..1dcf61929 100644
--- a/content/posts/leetcode/1827-minimum-operations-to-make-the-array-increasing.md
+++ b/content/posts/leetcode/1827-minimum-operations-to-make-the-array-increasing.md
@@ -176,8 +176,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int minOperations(int* nums, int numsSize) {
diff --git a/content/posts/leetcode/1828-queries-on-number-of-points-inside-a-circle.md b/content/posts/leetcode/1828-queries-on-number-of-points-inside-a-circle.md
index 0b0e623e4..848673464 100644
--- a/content/posts/leetcode/1828-queries-on-number-of-points-inside-a-circle.md
+++ b/content/posts/leetcode/1828-queries-on-number-of-points-inside-a-circle.md
@@ -194,8 +194,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1831-maximum-transaction-each-day.md b/content/posts/leetcode/1831-maximum-transaction-each-day.md
index 8e21e2c0a..e2972b978 100644
--- a/content/posts/leetcode/1831-maximum-transaction-each-day.md
+++ b/content/posts/leetcode/1831-maximum-transaction-each-day.md
@@ -84,7 +84,6 @@ We can use the window function `RANK()`, which assigns a rank to each transactio
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1832-check-if-the-sentence-is-pangram.md b/content/posts/leetcode/1832-check-if-the-sentence-is-pangram.md
index 2a782dbfb..d12e966d9 100644
--- a/content/posts/leetcode/1832-check-if-the-sentence-is-pangram.md
+++ b/content/posts/leetcode/1832-check-if-the-sentence-is-pangram.md
@@ -142,8 +142,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool checkIfPangram(char* sentence) {
int vis[26] = {0};
for (int i = 0; sentence[i]; i++) {
@@ -247,8 +247,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool checkIfPangram(char* sentence) {
int mark = 0;
for (int i = 0; sentence[i]; i++) {
diff --git a/content/posts/leetcode/1837-sum-of-digits-in-base-k.md b/content/posts/leetcode/1837-sum-of-digits-in-base-k.md
index 36b593b06..c9c193c4d 100644
--- a/content/posts/leetcode/1837-sum-of-digits-in-base-k.md
+++ b/content/posts/leetcode/1837-sum-of-digits-in-base-k.md
@@ -159,8 +159,8 @@ var sumBase = function (n, k) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int sumBase(int n, int k) {
int ans = 0;
while (n) {
diff --git a/content/posts/leetcode/1841-league-statistics.md b/content/posts/leetcode/1841-league-statistics.md
index 649377a8b..b4bcfa451 100644
--- a/content/posts/leetcode/1841-league-statistics.md
+++ b/content/posts/leetcode/1841-league-statistics.md
@@ -115,7 +115,6 @@ Dortmund is the first team in the table. Ajax and Arsenal have the same points,
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
Scores AS (
diff --git a/content/posts/leetcode/1843-suspicious-bank-accounts.md b/content/posts/leetcode/1843-suspicious-bank-accounts.md
index 8f849fd46..545e1127e 100644
--- a/content/posts/leetcode/1843-suspicious-bank-accounts.md
+++ b/content/posts/leetcode/1843-suspicious-bank-accounts.md
@@ -115,7 +115,6 @@ We can see that the income exceeded the max income in May and July, but not in J
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
@@ -147,7 +146,6 @@ ORDER BY s1.tx;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/1844-replace-all-digits-with-characters.md b/content/posts/leetcode/1844-replace-all-digits-with-characters.md
index e3b5dc5ad..c3a58d28d 100644
--- a/content/posts/leetcode/1844-replace-all-digits-with-characters.md
+++ b/content/posts/leetcode/1844-replace-all-digits-with-characters.md
@@ -156,8 +156,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* replaceDigits(char* s) {
int n = strlen(s);
for (int i = 1; i < n; i += 2) {
diff --git a/content/posts/leetcode/1853-convert-date-format.md b/content/posts/leetcode/1853-convert-date-format.md
index a6affa859..c25a043f1 100644
--- a/content/posts/leetcode/1853-convert-date-format.md
+++ b/content/posts/leetcode/1853-convert-date-format.md
@@ -69,7 +69,6 @@ Days table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DATE_FORMAT(day, '%W, %M %e, %Y') AS day FROM Days;
```
diff --git a/content/posts/leetcode/1867-orders-with-maximum-quantity-above-average.md b/content/posts/leetcode/1867-orders-with-maximum-quantity-above-average.md
index cfbd68796..29886304a 100644
--- a/content/posts/leetcode/1867-orders-with-maximum-quantity-above-average.md
+++ b/content/posts/leetcode/1867-orders-with-maximum-quantity-above-average.md
@@ -102,7 +102,6 @@ Orders 1 and 3 are imbalanced because they have a maximum quantity that exceeds
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1873-calculate-special-bonus.md b/content/posts/leetcode/1873-calculate-special-bonus.md
index 33a3c707f..b8334a385 100644
--- a/content/posts/leetcode/1873-calculate-special-bonus.md
+++ b/content/posts/leetcode/1873-calculate-special-bonus.md
@@ -81,7 +81,6 @@ We can use the `IF` statement to determine the calculation method of the bonus,
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
employee_id,
diff --git a/content/posts/leetcode/1875-group-employees-of-the-same-salary.md b/content/posts/leetcode/1875-group-employees-of-the-same-salary.md
index 51f2266d0..52c33e935 100644
--- a/content/posts/leetcode/1875-group-employees-of-the-same-salary.md
+++ b/content/posts/leetcode/1875-group-employees-of-the-same-salary.md
@@ -92,7 +92,6 @@ Juan's salary of 6100 is not included in the ranking because they are not on
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/1880-check-if-word-equals-summation-of-two-words.md b/content/posts/leetcode/1880-check-if-word-equals-summation-of-two-words.md
index ad2ff461a..b6f42e638 100644
--- a/content/posts/leetcode/1880-check-if-word-equals-summation-of-two-words.md
+++ b/content/posts/leetcode/1880-check-if-word-equals-summation-of-two-words.md
@@ -200,8 +200,8 @@ var isSumEqual = function (firstWord, secondWord, targetWord) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int calc(char* s) {
int res = 0;
for (int i = 0; s[i]; i++) {
diff --git a/content/posts/leetcode/1890-the-latest-login-in-2020.md b/content/posts/leetcode/1890-the-latest-login-in-2020.md
index dcaad29b4..10d93d762 100644
--- a/content/posts/leetcode/1890-the-latest-login-in-2020.md
+++ b/content/posts/leetcode/1890-the-latest-login-in-2020.md
@@ -83,7 +83,6 @@ We can first filter out the login records in 2020, and then group by `user_id`,
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT user_id, MAX(time_stamp) AS last_stamp
FROM Logins
diff --git a/content/posts/leetcode/1892-page-recommendations-ii.md b/content/posts/leetcode/1892-page-recommendations-ii.md
index 89066a8ca..053afeb47 100644
--- a/content/posts/leetcode/1892-page-recommendations-ii.md
+++ b/content/posts/leetcode/1892-page-recommendations-ii.md
@@ -135,7 +135,6 @@ You can recommend pages for users 2, 3, 4, and 5 using a similar process.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/1907-count-salary-categories.md b/content/posts/leetcode/1907-count-salary-categories.md
index 86e23537d..f80ea9d15 100644
--- a/content/posts/leetcode/1907-count-salary-categories.md
+++ b/content/posts/leetcode/1907-count-salary-categories.md
@@ -85,7 +85,6 @@ We can first create a temporary table containing all salary categories, and then
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
@@ -122,7 +121,6 @@ We can filter out the number of bank accounts for each salary category separatel
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT 'Low Salary' AS category, IFNULL(SUM(income < 20000), 0) AS accounts_count FROM Accounts
UNION
diff --git a/content/posts/leetcode/1917-leetcodify-friends-recommendations.md b/content/posts/leetcode/1917-leetcodify-friends-recommendations.md
index 837738822..cc4436c08 100644
--- a/content/posts/leetcode/1917-leetcodify-friends-recommendations.md
+++ b/content/posts/leetcode/1917-leetcodify-friends-recommendations.md
@@ -120,7 +120,6 @@ Similarly, we can see that users 2 and 3 listened to songs 10, 11, and 12 on the
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/1919-leetcodify-similar-friends.md b/content/posts/leetcode/1919-leetcodify-similar-friends.md
index 89b5d6d51..4093baf04 100644
--- a/content/posts/leetcode/1919-leetcodify-similar-friends.md
+++ b/content/posts/leetcode/1919-leetcodify-similar-friends.md
@@ -115,7 +115,6 @@ Users 2 and 5 are friends and listened to songs 10, 11, and 12, but they did not
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT DISTINCT user1_id, user2_id
FROM
diff --git a/content/posts/leetcode/1920-build-array-from-permutation.md b/content/posts/leetcode/1920-build-array-from-permutation.md
index da1c9f742..c825f3769 100644
--- a/content/posts/leetcode/1920-build-array-from-permutation.md
+++ b/content/posts/leetcode/1920-build-array-from-permutation.md
@@ -147,8 +147,8 @@ var buildArray = function (nums) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1929-concatenation-of-array.md b/content/posts/leetcode/1929-concatenation-of-array.md
index 07d7c06c4..832eb4c84 100644
--- a/content/posts/leetcode/1929-concatenation-of-array.md
+++ b/content/posts/leetcode/1929-concatenation-of-array.md
@@ -137,8 +137,8 @@ var getConcatenation = function (nums) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1934-confirmation-rate.md b/content/posts/leetcode/1934-confirmation-rate.md
index e67bea267..99eba371f 100644
--- a/content/posts/leetcode/1934-confirmation-rate.md
+++ b/content/posts/leetcode/1934-confirmation-rate.md
@@ -111,7 +111,6 @@ We can use a left join to join the `Signups` table and the `Confirmations` table
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
user_id,
diff --git a/content/posts/leetcode/1939-users-that-actively-request-confirmation-messages.md b/content/posts/leetcode/1939-users-that-actively-request-confirmation-messages.md
index dc8509186..88baff945 100644
--- a/content/posts/leetcode/1939-users-that-actively-request-confirmation-messages.md
+++ b/content/posts/leetcode/1939-users-that-actively-request-confirmation-messages.md
@@ -106,7 +106,6 @@ User 7 requested two messages within 24 hours and 1 second of each other, so we
```sql
-{{< /terminal >}}
SELECT DISTINCT user_id
FROM
Confirmations AS c1
diff --git a/content/posts/leetcode/1944-number-of-visible-people-in-a-queue.md b/content/posts/leetcode/1944-number-of-visible-people-in-a-queue.md
index e88a0e43e..292618876 100644
--- a/content/posts/leetcode/1944-number-of-visible-people-in-a-queue.md
+++ b/content/posts/leetcode/1944-number-of-visible-people-in-a-queue.md
@@ -195,8 +195,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/1949-strong-friendship.md b/content/posts/leetcode/1949-strong-friendship.md
index 2c300e167..c0edb32b7 100644
--- a/content/posts/leetcode/1949-strong-friendship.md
+++ b/content/posts/leetcode/1949-strong-friendship.md
@@ -87,7 +87,6 @@ We did not include the friendship of users 2 and 3 because they only have two co
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1951-all-the-pairs-with-the-maximum-number-of-common-followers.md b/content/posts/leetcode/1951-all-the-pairs-with-the-maximum-number-of-common-followers.md
index eabaa0299..8f8a7414e 100644
--- a/content/posts/leetcode/1951-all-the-pairs-with-the-maximum-number-of-common-followers.md
+++ b/content/posts/leetcode/1951-all-the-pairs-with-the-maximum-number-of-common-followers.md
@@ -82,7 +82,6 @@ Note that we do not have any information about the users that follow users 3, 4,
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/1965-employees-with-missing-information.md b/content/posts/leetcode/1965-employees-with-missing-information.md
index 4b62d332b..703871397 100644
--- a/content/posts/leetcode/1965-employees-with-missing-information.md
+++ b/content/posts/leetcode/1965-employees-with-missing-information.md
@@ -103,7 +103,6 @@ We can first find all `employee_id` that are not in the `Salaries` table from th
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT employee_id
FROM Employees
diff --git a/content/posts/leetcode/1972-first-and-last-call-on-the-same-day.md b/content/posts/leetcode/1972-first-and-last-call-on-the-same-day.md
index d2b135ef1..5319ae32d 100644
--- a/content/posts/leetcode/1972-first-and-last-call-on-the-same-day.md
+++ b/content/posts/leetcode/1972-first-and-last-call-on-the-same-day.md
@@ -79,7 +79,6 @@ On 2021-08-11, user 1 and 5 had a call. This call was the only call for both of
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
with s as (
select
diff --git a/content/posts/leetcode/1978-employees-whose-manager-left-the-company.md b/content/posts/leetcode/1978-employees-whose-manager-left-the-company.md
index 450bb93cf..bb45d7c2b 100644
--- a/content/posts/leetcode/1978-employees-whose-manager-left-the-company.md
+++ b/content/posts/leetcode/1978-employees-whose-manager-left-the-company.md
@@ -80,7 +80,6 @@ We can use a left join to connect the employee table with itself, and then filte
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT e1.employee_id
FROM
@@ -100,7 +99,6 @@ We can also use a subquery to first find all the managers who have left the comp
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT employee_id
FROM Employees
diff --git a/content/posts/leetcode/1988-find-cutoff-score-for-each-school.md b/content/posts/leetcode/1988-find-cutoff-score-for-each-school.md
index e72427342..3099547b4 100644
--- a/content/posts/leetcode/1988-find-cutoff-score-for-each-school.md
+++ b/content/posts/leetcode/1988-find-cutoff-score-for-each-school.md
@@ -111,7 +111,6 @@ Exam table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT school_id, MIN(IFNULL(score, -1)) AS score
FROM
diff --git a/content/posts/leetcode/1990-count-the-number-of-experiments.md b/content/posts/leetcode/1990-count-the-number-of-experiments.md
index 4424d5cd6..a9888cb8f 100644
--- a/content/posts/leetcode/1990-count-the-number-of-experiments.md
+++ b/content/posts/leetcode/1990-count-the-number-of-experiments.md
@@ -86,7 +86,6 @@ On the platform "Web", we had two "Reading" experiments and
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/2004-the-number-of-seniors-and-juniors-to-join-the-company.md b/content/posts/leetcode/2004-the-number-of-seniors-and-juniors-to-join-the-company.md
index fe1cdc5d7..38eabd76f 100644
--- a/content/posts/leetcode/2004-the-number-of-seniors-and-juniors-to-join-the-company.md
+++ b/content/posts/leetcode/2004-the-number-of-seniors-and-juniors-to-join-the-company.md
@@ -111,7 +111,6 @@ We can hire all three juniors with the remaining budget.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
s AS (
diff --git a/content/posts/leetcode/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.md b/content/posts/leetcode/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.md
index 227717755..d55d28ee0 100644
--- a/content/posts/leetcode/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.md
+++ b/content/posts/leetcode/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.md
@@ -115,7 +115,6 @@ We can hire all three juniors with the remaining budget.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
s AS (
diff --git a/content/posts/leetcode/2011-final-value-of-variable-after-performing-operations.md b/content/posts/leetcode/2011-final-value-of-variable-after-performing-operations.md
index a3b6f42ae..3a3c693a8 100644
--- a/content/posts/leetcode/2011-final-value-of-variable-after-performing-operations.md
+++ b/content/posts/leetcode/2011-final-value-of-variable-after-performing-operations.md
@@ -178,8 +178,8 @@ var finalValueAfterOperations = function (operations) {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int finalValueAfterOperations(char** operations, int operationsSize) {
int ans = 0;
for (int i = 0; i < operationsSize; i++) {
diff --git a/content/posts/leetcode/2020-number-of-accounts-that-did-not-stream.md b/content/posts/leetcode/2020-number-of-accounts-that-did-not-stream.md
index 980b4896d..529212cf1 100644
--- a/content/posts/leetcode/2020-number-of-accounts-that-did-not-stream.md
+++ b/content/posts/leetcode/2020-number-of-accounts-that-did-not-stream.md
@@ -101,7 +101,6 @@ User 11 did not subscribe in 2021.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT COUNT(sub.account_id) AS accounts_count
FROM
diff --git a/content/posts/leetcode/2026-low-quality-problems.md b/content/posts/leetcode/2026-low-quality-problems.md
index c62387fb2..0d2efe237 100644
--- a/content/posts/leetcode/2026-low-quality-problems.md
+++ b/content/posts/leetcode/2026-low-quality-problems.md
@@ -82,7 +82,6 @@ Problems 7, 10, 11, and 13 are low-quality problems because their like percentag
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT problem_id
FROM Problems
diff --git a/content/posts/leetcode/2027-minimum-moves-to-convert-string.md b/content/posts/leetcode/2027-minimum-moves-to-convert-string.md
index b08a5609d..b693530b3 100644
--- a/content/posts/leetcode/2027-minimum-moves-to-convert-string.md
+++ b/content/posts/leetcode/2027-minimum-moves-to-convert-string.md
@@ -175,8 +175,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minimumMoves(char* s) {
int n = strlen(s);
int ans = 0;
diff --git a/content/posts/leetcode/2037-minimum-number-of-moves-to-seat-everyone.md b/content/posts/leetcode/2037-minimum-number-of-moves-to-seat-everyone.md
index 47c531e0d..1f7964679 100644
--- a/content/posts/leetcode/2037-minimum-number-of-moves-to-seat-everyone.md
+++ b/content/posts/leetcode/2037-minimum-number-of-moves-to-seat-everyone.md
@@ -186,8 +186,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/2041-accepted-candidates-from-the-interviews.md b/content/posts/leetcode/2041-accepted-candidates-from-the-interviews.md
index e860f1a81..763cac2e5 100644
--- a/content/posts/leetcode/2041-accepted-candidates-from-the-interviews.md
+++ b/content/posts/leetcode/2041-accepted-candidates-from-the-interviews.md
@@ -109,7 +109,6 @@ Rounds table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT candidate_id
FROM
diff --git a/content/posts/leetcode/2042-check-if-numbers-are-ascending-in-a-sentence.md b/content/posts/leetcode/2042-check-if-numbers-are-ascending-in-a-sentence.md
index 0f7b4d7a4..e3b1646db 100644
--- a/content/posts/leetcode/2042-check-if-numbers-are-ascending-in-a-sentence.md
+++ b/content/posts/leetcode/2042-check-if-numbers-are-ascending-in-a-sentence.md
@@ -193,8 +193,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool areNumbersAscending(char* s) {
int pre = -1;
int cur = 0;
diff --git a/content/posts/leetcode/2051-the-category-of-each-member-in-the-store.md b/content/posts/leetcode/2051-the-category-of-each-member-in-the-store.md
index 934fbb7b1..5e19b3fed 100644
--- a/content/posts/leetcode/2051-the-category-of-each-member-in-the-store.md
+++ b/content/posts/leetcode/2051-the-category-of-each-member-in-the-store.md
@@ -144,7 +144,6 @@ Purchases table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
m.member_id,
diff --git a/content/posts/leetcode/2066-account-balance.md b/content/posts/leetcode/2066-account-balance.md
index 0e8e1d38d..59898efc8 100644
--- a/content/posts/leetcode/2066-account-balance.md
+++ b/content/posts/leetcode/2066-account-balance.md
@@ -87,7 +87,6 @@ Account 2:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
account_id,
diff --git a/content/posts/leetcode/2072-the-winner-university.md b/content/posts/leetcode/2072-the-winner-university.md
index 7c8432ab8..7186cc901 100644
--- a/content/posts/leetcode/2072-the-winner-university.md
+++ b/content/posts/leetcode/2072-the-winner-university.md
@@ -155,7 +155,6 @@ Both New York University and California University have 1 excellent student.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
CASE
diff --git a/content/posts/leetcode/2079-watering-plants.md b/content/posts/leetcode/2079-watering-plants.md
index 9af0bf179..8b6bc0245 100644
--- a/content/posts/leetcode/2079-watering-plants.md
+++ b/content/posts/leetcode/2079-watering-plants.md
@@ -204,8 +204,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int wateringPlants(int* plants, int plantsSize, int capacity) {
int ans = 0;
int water = capacity;
diff --git a/content/posts/leetcode/2082-the-number-of-rich-customers.md b/content/posts/leetcode/2082-the-number-of-rich-customers.md
index c11bffb48..b4a5be7b5 100644
--- a/content/posts/leetcode/2082-the-number-of-rich-customers.md
+++ b/content/posts/leetcode/2082-the-number-of-rich-customers.md
@@ -73,7 +73,6 @@ Customer 3 has one bill with an amount strictly greater than 500.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
COUNT(DISTINCT customer_id) AS rich_count
diff --git a/content/posts/leetcode/2084-drop-type-1-orders-for-customers-with-type-0-orders.md b/content/posts/leetcode/2084-drop-type-1-orders-for-customers-with-type-0-orders.md
index 646e30119..7e0b0a387 100644
--- a/content/posts/leetcode/2084-drop-type-1-orders-for-customers-with-type-0-orders.md
+++ b/content/posts/leetcode/2084-drop-type-1-orders-for-customers-with-type-0-orders.md
@@ -91,7 +91,6 @@ Customer 4 has two orders of type 1. We return both of them.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -112,7 +111,6 @@ WHERE order_type = 0 OR NOT EXISTS (SELECT 1 FROM T AS t WHERE t.customer_id = o
```sql
-{{< /terminal >}}
SELECT DISTINCT
a.order_id,
a.customer_id,
diff --git a/content/posts/leetcode/2103-rings-and-rods.md b/content/posts/leetcode/2103-rings-and-rods.md
index ac25388aa..cfb96416a 100644
--- a/content/posts/leetcode/2103-rings-and-rods.md
+++ b/content/posts/leetcode/2103-rings-and-rods.md
@@ -214,8 +214,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countPoints(char* rings) {
int d['Z'];
memset(d, 0, sizeof(d));
diff --git a/content/posts/leetcode/2108-find-first-palindromic-string-in-the-array.md b/content/posts/leetcode/2108-find-first-palindromic-string-in-the-array.md
index ad56fdcb8..2a5890a7b 100644
--- a/content/posts/leetcode/2108-find-first-palindromic-string-in-the-array.md
+++ b/content/posts/leetcode/2108-find-first-palindromic-string-in-the-array.md
@@ -181,8 +181,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* firstPalindrome(char** words, int wordsSize) {
for (int i = 0; i < wordsSize; i++) {
int left = 0;
diff --git a/content/posts/leetcode/2112-the-airport-with-the-most-traffic.md b/content/posts/leetcode/2112-the-airport-with-the-most-traffic.md
index 5386babbc..d19db7c2c 100644
--- a/content/posts/leetcode/2112-the-airport-with-the-most-traffic.md
+++ b/content/posts/leetcode/2112-the-airport-with-the-most-traffic.md
@@ -107,7 +107,6 @@ The airports with the most traffic are airports 1, 2, 3, and 4.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2114-maximum-number-of-words-found-in-sentences.md b/content/posts/leetcode/2114-maximum-number-of-words-found-in-sentences.md
index e389b235f..2f8aa15af 100644
--- a/content/posts/leetcode/2114-maximum-number-of-words-found-in-sentences.md
+++ b/content/posts/leetcode/2114-maximum-number-of-words-found-in-sentences.md
@@ -157,8 +157,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int mostWordsFound(char** sentences, int sentencesSize) {
diff --git a/content/posts/leetcode/2118-build-the-equation.md b/content/posts/leetcode/2118-build-the-equation.md
index 1014a4b47..3e10c6ffb 100644
--- a/content/posts/leetcode/2118-build-the-equation.md
+++ b/content/posts/leetcode/2118-build-the-equation.md
@@ -116,7 +116,6 @@ Terms table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2120-execution-of-all-suffix-instructions-staying-in-a-grid.md b/content/posts/leetcode/2120-execution-of-all-suffix-instructions-staying-in-a-grid.md
index 728a28389..ed5e1ca70 100644
--- a/content/posts/leetcode/2120-execution-of-all-suffix-instructions-staying-in-a-grid.md
+++ b/content/posts/leetcode/2120-execution-of-all-suffix-instructions-staying-in-a-grid.md
@@ -269,8 +269,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2125-number-of-laser-beams-in-a-bank.md b/content/posts/leetcode/2125-number-of-laser-beams-in-a-bank.md
index b5bff30b8..54026bc07 100644
--- a/content/posts/leetcode/2125-number-of-laser-beams-in-a-bank.md
+++ b/content/posts/leetcode/2125-number-of-laser-beams-in-a-bank.md
@@ -197,8 +197,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int numberOfBeams(char** bank, int bankSize) {
int last = 0;
int ans = 0;
diff --git a/content/posts/leetcode/2142-the-number-of-passengers-in-each-bus-i.md b/content/posts/leetcode/2142-the-number-of-passengers-in-each-bus-i.md
index 7e8a2c85c..66a20c976 100644
--- a/content/posts/leetcode/2142-the-number-of-passengers-in-each-bus-i.md
+++ b/content/posts/leetcode/2142-the-number-of-passengers-in-each-bus-i.md
@@ -107,7 +107,6 @@ Passengers table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
bus_id,
diff --git a/content/posts/leetcode/2153-the-number-of-passengers-in-each-bus-ii.md b/content/posts/leetcode/2153-the-number-of-passengers-in-each-bus-ii.md
index 17e853c1b..78e599859 100644
--- a/content/posts/leetcode/2153-the-number-of-passengers-in-each-bus-ii.md
+++ b/content/posts/leetcode/2153-the-number-of-passengers-in-each-bus-ii.md
@@ -110,7 +110,6 @@ Passengers table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2159-order-two-columns-independently.md b/content/posts/leetcode/2159-order-two-columns-independently.md
index d184858df..5d0d6e4da 100644
--- a/content/posts/leetcode/2159-order-two-columns-independently.md
+++ b/content/posts/leetcode/2159-order-two-columns-independently.md
@@ -74,7 +74,6 @@ Data table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/2160-minimum-sum-of-four-digit-number-after-splitting-digits.md b/content/posts/leetcode/2160-minimum-sum-of-four-digit-number-after-splitting-digits.md
index 4e1e9f600..91d844284 100644
--- a/content/posts/leetcode/2160-minimum-sum-of-four-digit-number-after-splitting-digits.md
+++ b/content/posts/leetcode/2160-minimum-sum-of-four-digit-number-after-splitting-digits.md
@@ -149,8 +149,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/2173-longest-winning-streak.md b/content/posts/leetcode/2173-longest-winning-streak.md
index b26281b08..2c5b715ae 100644
--- a/content/posts/leetcode/2173-longest-winning-streak.md
+++ b/content/posts/leetcode/2173-longest-winning-streak.md
@@ -96,7 +96,6 @@ The longest winning streak was 1 match.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/2175-the-change-in-global-rankings.md b/content/posts/leetcode/2175-the-change-in-global-rankings.md
index 90512c4dd..32d06ea1b 100644
--- a/content/posts/leetcode/2175-the-change-in-global-rankings.md
+++ b/content/posts/leetcode/2175-the-change-in-global-rankings.md
@@ -130,7 +130,6 @@ New Zealand did not gain or lose points and their rank did not change.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/2176-count-equal-and-divisible-pairs-in-an-array.md b/content/posts/leetcode/2176-count-equal-and-divisible-pairs-in-an-array.md
index bc5734d38..3c1c80147 100644
--- a/content/posts/leetcode/2176-count-equal-and-divisible-pairs-in-an-array.md
+++ b/content/posts/leetcode/2176-count-equal-and-divisible-pairs-in-an-array.md
@@ -161,8 +161,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countPairs(int* nums, int numsSize, int k) {
int ans = 0;
for (int i = 0; i < numsSize - 1; i++) {
diff --git a/content/posts/leetcode/2181-merge-nodes-in-between-zeros.md b/content/posts/leetcode/2181-merge-nodes-in-between-zeros.md
index 6ef60f365..6fec1e247 100644
--- a/content/posts/leetcode/2181-merge-nodes-in-between-zeros.md
+++ b/content/posts/leetcode/2181-merge-nodes-in-between-zeros.md
@@ -251,8 +251,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for singly-linked list.
* struct ListNode {
diff --git a/content/posts/leetcode/2185-counting-words-with-a-given-prefix.md b/content/posts/leetcode/2185-counting-words-with-a-given-prefix.md
index 6267ba5f5..c0f9d2345 100644
--- a/content/posts/leetcode/2185-counting-words-with-a-given-prefix.md
+++ b/content/posts/leetcode/2185-counting-words-with-a-given-prefix.md
@@ -128,8 +128,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int prefixCount(char** words, int wordsSize, char* pref) {
int ans = 0;
int n = strlen(pref);
diff --git a/content/posts/leetcode/2199-finding-the-topic-of-each-post.md b/content/posts/leetcode/2199-finding-the-topic-of-each-post.md
index 2350b4bea..1e90e5f12 100644
--- a/content/posts/leetcode/2199-finding-the-topic-of-each-post.md
+++ b/content/posts/leetcode/2199-finding-the-topic-of-each-post.md
@@ -122,7 +122,6 @@ Note that it is okay to have one word that expresses more than one topic.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
post_id,
diff --git a/content/posts/leetcode/2205-the-number-of-users-that-are-eligible-for-discount.md b/content/posts/leetcode/2205-the-number-of-users-that-are-eligible-for-discount.md
index f9da92ac2..041235425 100644
--- a/content/posts/leetcode/2205-the-number-of-users-that-are-eligible-for-discount.md
+++ b/content/posts/leetcode/2205-the-number-of-users-that-are-eligible-for-discount.md
@@ -76,7 +76,6 @@ Out of the three users, only User 3 is eligible for a discount.
```sql
-{{< /terminal >}}
CREATE FUNCTION getUserIDs(startDate DATE, endDate DATE, minAmount INT) RETURNS INT
BEGIN
RETURN (
diff --git a/content/posts/leetcode/2220-minimum-bit-flips-to-convert-number.md b/content/posts/leetcode/2220-minimum-bit-flips-to-convert-number.md
index 1a23e6264..0df3a56c4 100644
--- a/content/posts/leetcode/2220-minimum-bit-flips-to-convert-number.md
+++ b/content/posts/leetcode/2220-minimum-bit-flips-to-convert-number.md
@@ -154,8 +154,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minBitFlips(int start, int goal) {
int tmp = start ^ goal;
int ans = 0;
diff --git a/content/posts/leetcode/2228-users-with-two-purchases-within-seven-days.md b/content/posts/leetcode/2228-users-with-two-purchases-within-seven-days.md
index b5300b82c..735348462 100644
--- a/content/posts/leetcode/2228-users-with-two-purchases-within-seven-days.md
+++ b/content/posts/leetcode/2228-users-with-two-purchases-within-seven-days.md
@@ -77,7 +77,6 @@ User 7 had two purchases on the same day so we add their ID.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
diff --git a/content/posts/leetcode/2230-the-users-that-are-eligible-for-discount.md b/content/posts/leetcode/2230-the-users-that-are-eligible-for-discount.md
index ca5c08a74..bc15fc820 100644
--- a/content/posts/leetcode/2230-the-users-that-are-eligible-for-discount.md
+++ b/content/posts/leetcode/2230-the-users-that-are-eligible-for-discount.md
@@ -81,7 +81,6 @@ Out of the three users, only User 3 is eligible for a discount.
```sql
-{{< /terminal >}}
CREATE PROCEDURE getUserIDs(startDate DATE, endDate DATE, minAmount INT)
BEGIN
# Write your MySQL query statement below.
diff --git a/content/posts/leetcode/2235-add-two-integers.md b/content/posts/leetcode/2235-add-two-integers.md
index 551376f96..9b9075582 100644
--- a/content/posts/leetcode/2235-add-two-integers.md
+++ b/content/posts/leetcode/2235-add-two-integers.md
@@ -106,8 +106,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int sum(int num1, int num2) {
return num1 + num2;
}
diff --git a/content/posts/leetcode/2236-root-equals-sum-of-children.md b/content/posts/leetcode/2236-root-equals-sum-of-children.md
index 8b3bc718e..cd8868f37 100644
--- a/content/posts/leetcode/2236-root-equals-sum-of-children.md
+++ b/content/posts/leetcode/2236-root-equals-sum-of-children.md
@@ -188,8 +188,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/2238-number-of-times-a-driver-was-a-passenger.md b/content/posts/leetcode/2238-number-of-times-a-driver-was-a-passenger.md
index ab3065d55..f0cac5511 100644
--- a/content/posts/leetcode/2238-number-of-times-a-driver-was-a-passenger.md
+++ b/content/posts/leetcode/2238-number-of-times-a-driver-was-a-passenger.md
@@ -78,7 +78,6 @@ The driver with ID = 11 was never a passenger.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH T AS (SELECT DISTINCT driver_id FROM Rides)
SELECT t.driver_id, COUNT(passenger_id) AS cnt
diff --git a/content/posts/leetcode/2252-dynamic-pivoting-of-a-table.md b/content/posts/leetcode/2252-dynamic-pivoting-of-a-table.md
index 86baff54a..84a523351 100644
--- a/content/posts/leetcode/2252-dynamic-pivoting-of-a-table.md
+++ b/content/posts/leetcode/2252-dynamic-pivoting-of-a-table.md
@@ -85,7 +85,6 @@ For product 3, the price is 1000 in Shop and 1900 in Souq. It is not sold in the
```sql
-{{< /terminal >}}
CREATE PROCEDURE PivotProducts()
BEGIN
# Write your MySQL query statement below.
diff --git a/content/posts/leetcode/2253-dynamic-unpivoting-of-a-table.md b/content/posts/leetcode/2253-dynamic-unpivoting-of-a-table.md
index 53abede44..5a45896c1 100644
--- a/content/posts/leetcode/2253-dynamic-unpivoting-of-a-table.md
+++ b/content/posts/leetcode/2253-dynamic-unpivoting-of-a-table.md
@@ -88,7 +88,6 @@ Product 3 is sold in Shop and Souq with prices of 1000 and 1900.
```sql
-{{< /terminal >}}
CREATE PROCEDURE UnpivotProducts()
BEGIN
# Write your MySQL query statement below.
diff --git a/content/posts/leetcode/2283-check-if-number-has-equal-digit-count-and-digit-value.md b/content/posts/leetcode/2283-check-if-number-has-equal-digit-count-and-digit-value.md
index ec05e71d2..9b5aacab6 100644
--- a/content/posts/leetcode/2283-check-if-number-has-equal-digit-count-and-digit-value.md
+++ b/content/posts/leetcode/2283-check-if-number-has-equal-digit-count-and-digit-value.md
@@ -165,8 +165,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool digitCount(char* num) {
int count[10] = {0};
for (int i = 0; num[i]; i++) {
diff --git a/content/posts/leetcode/2287-rearrange-characters-to-make-target-string.md b/content/posts/leetcode/2287-rearrange-characters-to-make-target-string.md
index 77fbad1ed..efebced55 100644
--- a/content/posts/leetcode/2287-rearrange-characters-to-make-target-string.md
+++ b/content/posts/leetcode/2287-rearrange-characters-to-make-target-string.md
@@ -199,8 +199,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int rearrangeCharacters(char* s, char* target) {
diff --git a/content/posts/leetcode/2292-products-with-three-or-more-orders-in-two-consecutive-years.md b/content/posts/leetcode/2292-products-with-three-or-more-orders-in-two-consecutive-years.md
index 8ac9f05f9..8805b7266 100644
--- a/content/posts/leetcode/2292-products-with-three-or-more-orders-in-two-consecutive-years.md
+++ b/content/posts/leetcode/2292-products-with-three-or-more-orders-in-two-consecutive-years.md
@@ -77,7 +77,6 @@ Product 2 was ordered one time in 2022. We do not include it in the answer.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
@@ -100,7 +99,6 @@ WHERE p1.mark AND p2.mark;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/2293-min-max-game.md b/content/posts/leetcode/2293-min-max-game.md
index d904fb265..0fa8f9277 100644
--- a/content/posts/leetcode/2293-min-max-game.md
+++ b/content/posts/leetcode/2293-min-max-game.md
@@ -173,8 +173,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
diff --git a/content/posts/leetcode/2298-tasks-count-in-the-weekend.md b/content/posts/leetcode/2298-tasks-count-in-the-weekend.md
index f59e98063..50c797d44 100644
--- a/content/posts/leetcode/2298-tasks-count-in-the-weekend.md
+++ b/content/posts/leetcode/2298-tasks-count-in-the-weekend.md
@@ -86,7 +86,6 @@ Task 6 was submitted on Sunday.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
SUM(WEEKDAY(submit_date) IN (5, 6)) AS weekend_cnt,
diff --git a/content/posts/leetcode/2299-strong-password-checker-ii.md b/content/posts/leetcode/2299-strong-password-checker-ii.md
index 12c42b2f0..e0419beb3 100644
--- a/content/posts/leetcode/2299-strong-password-checker-ii.md
+++ b/content/posts/leetcode/2299-strong-password-checker-ii.md
@@ -236,8 +236,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool strongPasswordCheckerII(char* password) {
int n = strlen(password);
if (n < 8) {
diff --git a/content/posts/leetcode/2308-arrange-table-by-gender.md b/content/posts/leetcode/2308-arrange-table-by-gender.md
index 04d3af8f7..01d706e23 100644
--- a/content/posts/leetcode/2308-arrange-table-by-gender.md
+++ b/content/posts/leetcode/2308-arrange-table-by-gender.md
@@ -90,7 +90,6 @@ Note that the IDs of each gender are sorted in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
t AS (
@@ -120,7 +119,6 @@ ORDER BY rk1, rk2;
```sql
-{{< /terminal >}}
SELECT
user_id,
gender
diff --git a/content/posts/leetcode/2314-the-first-day-of-the-maximum-recorded-degree-in-each-city.md b/content/posts/leetcode/2314-the-first-day-of-the-maximum-recorded-degree-in-each-city.md
index 52106cefd..7cf5a7e0d 100644
--- a/content/posts/leetcode/2314-the-first-day-of-the-maximum-recorded-degree-in-each-city.md
+++ b/content/posts/leetcode/2314-the-first-day-of-the-maximum-recorded-degree-in-each-city.md
@@ -80,7 +80,6 @@ For city 3, the maximum degree was recorded on 2022-12-07 with -6 degrees.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2315-count-asterisks.md b/content/posts/leetcode/2315-count-asterisks.md
index 67a5e35e0..ba6be6eb6 100644
--- a/content/posts/leetcode/2315-count-asterisks.md
+++ b/content/posts/leetcode/2315-count-asterisks.md
@@ -188,8 +188,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countAsterisks(char* s) {
int ans = 0;
int ok = 1;
diff --git a/content/posts/leetcode/2319-check-if-matrix-is-x-matrix.md b/content/posts/leetcode/2319-check-if-matrix-is-x-matrix.md
index b1ad8bccf..acd4924ed 100644
--- a/content/posts/leetcode/2319-check-if-matrix-is-x-matrix.md
+++ b/content/posts/leetcode/2319-check-if-matrix-is-x-matrix.md
@@ -207,8 +207,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool checkXMatrix(int** grid, int gridSize, int* gridColSize) {
for (int i = 0; i < gridSize; i++) {
for (int j = 0; j < gridSize; j++) {
diff --git a/content/posts/leetcode/2324-product-sales-analysis-iv.md b/content/posts/leetcode/2324-product-sales-analysis-iv.md
index 3d1007e74..e59c71119 100644
--- a/content/posts/leetcode/2324-product-sales-analysis-iv.md
+++ b/content/posts/leetcode/2324-product-sales-analysis-iv.md
@@ -110,7 +110,6 @@ User 102 spent the most money on products 1, 2, and 3.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2325-decode-the-message.md b/content/posts/leetcode/2325-decode-the-message.md
index c69c40392..65d5f5e3f 100644
--- a/content/posts/leetcode/2325-decode-the-message.md
+++ b/content/posts/leetcode/2325-decode-the-message.md
@@ -186,8 +186,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* decodeMessage(char* key, char* message) {
int m = strlen(key);
int n = strlen(message);
diff --git a/content/posts/leetcode/2329-product-sales-analysis-v.md b/content/posts/leetcode/2329-product-sales-analysis-v.md
index e9a9e2ef8..e797cf017 100644
--- a/content/posts/leetcode/2329-product-sales-analysis-v.md
+++ b/content/posts/leetcode/2329-product-sales-analysis-v.md
@@ -103,7 +103,6 @@ Users 102 and 103 spent the same amount and we break the tie by their ID while u
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT user_id, SUM(quantity * price) AS spending
FROM
diff --git a/content/posts/leetcode/2331-evaluate-boolean-binary-tree.md b/content/posts/leetcode/2331-evaluate-boolean-binary-tree.md
index cf9b3fa9b..db259a5e9 100644
--- a/content/posts/leetcode/2331-evaluate-boolean-binary-tree.md
+++ b/content/posts/leetcode/2331-evaluate-boolean-binary-tree.md
@@ -257,8 +257,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Definition for a binary tree node.
* struct TreeNode {
diff --git a/content/posts/leetcode/2339-all-the-matches-of-the-league.md b/content/posts/leetcode/2339-all-the-matches-of-the-league.md
index f0835bac2..79c6f0cdd 100644
--- a/content/posts/leetcode/2339-all-the-matches-of-the-league.md
+++ b/content/posts/leetcode/2339-all-the-matches-of-the-league.md
@@ -73,7 +73,6 @@ Teams table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT t1.team_name AS home_team, t2.team_name AS away_team
FROM
diff --git a/content/posts/leetcode/2341-maximum-number-of-pairs-in-array.md b/content/posts/leetcode/2341-maximum-number-of-pairs-in-array.md
index 0edc1a821..db82c76c5 100644
--- a/content/posts/leetcode/2341-maximum-number-of-pairs-in-array.md
+++ b/content/posts/leetcode/2341-maximum-number-of-pairs-in-array.md
@@ -205,8 +205,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2346-compute-the-rank-as-a-percentage.md b/content/posts/leetcode/2346-compute-the-rank-as-a-percentage.md
index 8f3fa5820..50bb51d3f 100644
--- a/content/posts/leetcode/2346-compute-the-rank-as-a-percentage.md
+++ b/content/posts/leetcode/2346-compute-the-rank-as-a-percentage.md
@@ -83,7 +83,6 @@ For Department 2:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
student_id,
diff --git a/content/posts/leetcode/2347-best-poker-hand.md b/content/posts/leetcode/2347-best-poker-hand.md
index 8ed7fbd12..effc5ffe2 100644
--- a/content/posts/leetcode/2347-best-poker-hand.md
+++ b/content/posts/leetcode/2347-best-poker-hand.md
@@ -216,8 +216,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char* bestHand(int* ranks, int ranksSize, char* suits, int suitsSize) {
bool isFlush = true;
for (int i = 1; i < suitsSize; i++) {
diff --git a/content/posts/leetcode/2351-first-letter-to-appear-twice.md b/content/posts/leetcode/2351-first-letter-to-appear-twice.md
index 5dba8b0f2..7d0318b4a 100644
--- a/content/posts/leetcode/2351-first-letter-to-appear-twice.md
+++ b/content/posts/leetcode/2351-first-letter-to-appear-twice.md
@@ -176,8 +176,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char repeatedCharacter(char* s) {
int vis[26] = {0};
for (int i = 0; s[i]; i++) {
@@ -291,8 +291,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
char repeatedCharacter(char* s) {
int mask = 0;
for (int i = 0; s[i]; i++) {
diff --git a/content/posts/leetcode/2356-number-of-unique-subjects-taught-by-each-teacher.md b/content/posts/leetcode/2356-number-of-unique-subjects-taught-by-each-teacher.md
index 763c0c59e..5140df437 100644
--- a/content/posts/leetcode/2356-number-of-unique-subjects-taught-by-each-teacher.md
+++ b/content/posts/leetcode/2356-number-of-unique-subjects-taught-by-each-teacher.md
@@ -83,7 +83,6 @@ Teacher 2:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT teacher_id, COUNT(DISTINCT subject_id) AS cnt
FROM Teacher
diff --git a/content/posts/leetcode/2357-make-array-zero-by-subtracting-equal-amounts.md b/content/posts/leetcode/2357-make-array-zero-by-subtracting-equal-amounts.md
index d73c3230a..22b5b6e43 100644
--- a/content/posts/leetcode/2357-make-array-zero-by-subtracting-equal-amounts.md
+++ b/content/posts/leetcode/2357-make-array-zero-by-subtracting-equal-amounts.md
@@ -147,8 +147,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minimumOperations(int* nums, int numsSize) {
int vis[101] = {0};
vis[0] = 1;
diff --git a/content/posts/leetcode/2362-generate-the-invoice.md b/content/posts/leetcode/2362-generate-the-invoice.md
index 36e57348f..ffe87c9fa 100644
--- a/content/posts/leetcode/2362-generate-the-invoice.md
+++ b/content/posts/leetcode/2362-generate-the-invoice.md
@@ -101,7 +101,6 @@ The highest price is $1000, and the invoices with the highest prices are 2 and 4
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/2363-merge-similar-items.md b/content/posts/leetcode/2363-merge-similar-items.md
index 7a1cbfa1b..6e74157bc 100644
--- a/content/posts/leetcode/2363-merge-similar-items.md
+++ b/content/posts/leetcode/2363-merge-similar-items.md
@@ -204,8 +204,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
diff --git a/content/posts/leetcode/2372-calculate-the-influence-of-each-salesperson.md b/content/posts/leetcode/2372-calculate-the-influence-of-each-salesperson.md
index 71f976f24..dea0dc947 100644
--- a/content/posts/leetcode/2372-calculate-the-influence-of-each-salesperson.md
+++ b/content/posts/leetcode/2372-calculate-the-influence-of-each-salesperson.md
@@ -132,7 +132,6 @@ The total for Jerry is 0.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT sp.salesperson_id, name, IFNULL(SUM(price), 0) AS total
FROM
diff --git a/content/posts/leetcode/2377-sort-the-olympic-table.md b/content/posts/leetcode/2377-sort-the-olympic-table.md
index 06b9eca04..e8c87eff5 100644
--- a/content/posts/leetcode/2377-sort-the-olympic-table.md
+++ b/content/posts/leetcode/2377-sort-the-olympic-table.md
@@ -86,7 +86,6 @@ Israel comes before Egypt because it has more bronze medals.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT *
FROM Olympic
diff --git a/content/posts/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks.md b/content/posts/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks.md
index 0368a39b6..d9b62385b 100644
--- a/content/posts/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks.md
+++ b/content/posts/leetcode/2379-minimum-recolors-to-get-k-consecutive-black-blocks.md
@@ -216,8 +216,8 @@ class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int minimumRecolors(char* blocks, int k) {
diff --git a/content/posts/leetcode/2383-minimum-hours-of-training-to-win-a-competition.md b/content/posts/leetcode/2383-minimum-hours-of-training-to-win-a-competition.md
index 5814d6576..756ad7443 100644
--- a/content/posts/leetcode/2383-minimum-hours-of-training-to-win-a-competition.md
+++ b/content/posts/leetcode/2383-minimum-hours-of-training-to-win-a-competition.md
@@ -230,8 +230,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int minNumberOfHours(int initialEnergy, int initialExperience, int* energy, int energySize, int* experience, int experienceSize) {
int res = 0;
for (int i = 0; i < energySize; i++) {
diff --git a/content/posts/leetcode/2388-change-null-values-in-a-table-to-the-previous-value.md b/content/posts/leetcode/2388-change-null-values-in-a-table-to-the-previous-value.md
index c92e0adc6..f8e5c8521 100644
--- a/content/posts/leetcode/2388-change-null-values-in-a-table-to-the-previous-value.md
+++ b/content/posts/leetcode/2388-change-null-values-in-a-table-to-the-previous-value.md
@@ -81,7 +81,6 @@ Note that the rows in the output are the same as in the input.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
id,
@@ -100,7 +99,6 @@ FROM CoffeeShop;
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/2394-employees-with-deductions.md b/content/posts/leetcode/2394-employees-with-deductions.md
index 122d563d0..b344b4db3 100644
--- a/content/posts/leetcode/2394-employees-with-deductions.md
+++ b/content/posts/leetcode/2394-employees-with-deductions.md
@@ -115,7 +115,6 @@ Employee 3:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2395-find-subarrays-with-equal-sum.md b/content/posts/leetcode/2395-find-subarrays-with-equal-sum.md
index 54a6b4f34..ced06ff8e 100644
--- a/content/posts/leetcode/2395-find-subarrays-with-equal-sum.md
+++ b/content/posts/leetcode/2395-find-subarrays-with-equal-sum.md
@@ -163,8 +163,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool findSubarrays(int* nums, int numsSize) {
for (int i = 1; i < numsSize - 1; i++) {
for (int j = i + 1; j < numsSize; j++) {
diff --git a/content/posts/leetcode/2396-strictly-palindromic-number.md b/content/posts/leetcode/2396-strictly-palindromic-number.md
index 45f657c49..594f1226a 100644
--- a/content/posts/leetcode/2396-strictly-palindromic-number.md
+++ b/content/posts/leetcode/2396-strictly-palindromic-number.md
@@ -115,8 +115,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool isStrictlyPalindromic(int n) {
return 0;
}
diff --git a/content/posts/leetcode/2399-check-distances-between-same-letters.md b/content/posts/leetcode/2399-check-distances-between-same-letters.md
index 3423915d8..90a192549 100644
--- a/content/posts/leetcode/2399-check-distances-between-same-letters.md
+++ b/content/posts/leetcode/2399-check-distances-between-same-letters.md
@@ -172,8 +172,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool checkDistances(char* s, int* distance, int distanceSize) {
int n = strlen(s);
int d[26] = {0};
diff --git a/content/posts/leetcode/2413-smallest-even-multiple.md b/content/posts/leetcode/2413-smallest-even-multiple.md
index 222dee8cd..d013bfd55 100644
--- a/content/posts/leetcode/2413-smallest-even-multiple.md
+++ b/content/posts/leetcode/2413-smallest-even-multiple.md
@@ -116,8 +116,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int smallestEvenMultiple(int n) {
return n % 2 == 0 ? n : n * 2;
}
diff --git a/content/posts/leetcode/2414-length-of-the-longest-alphabetical-continuous-substring.md b/content/posts/leetcode/2414-length-of-the-longest-alphabetical-continuous-substring.md
index 5af999287..4e3dc2c11 100644
--- a/content/posts/leetcode/2414-length-of-the-longest-alphabetical-continuous-substring.md
+++ b/content/posts/leetcode/2414-length-of-the-longest-alphabetical-continuous-substring.md
@@ -172,8 +172,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int longestContinuousSubstring(char* s) {
diff --git a/content/posts/leetcode/2432-the-employee-that-worked-on-the-longest-task.md b/content/posts/leetcode/2432-the-employee-that-worked-on-the-longest-task.md
index 7daa39a7a..c49e737d8 100644
--- a/content/posts/leetcode/2432-the-employee-that-worked-on-the-longest-task.md
+++ b/content/posts/leetcode/2432-the-employee-that-worked-on-the-longest-task.md
@@ -209,8 +209,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int hardestWorker(int n, int** logs, int logsSize, int* logsColSize) {
diff --git a/content/posts/leetcode/2433-find-the-original-array-of-prefix-xor.md b/content/posts/leetcode/2433-find-the-original-array-of-prefix-xor.md
index fe5bacce6..0965c21dd 100644
--- a/content/posts/leetcode/2433-find-the-original-array-of-prefix-xor.md
+++ b/content/posts/leetcode/2433-find-the-original-array-of-prefix-xor.md
@@ -168,8 +168,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2443-sum-of-number-and-its-reverse.md b/content/posts/leetcode/2443-sum-of-number-and-its-reverse.md
index 1a6c2bff1..508a2b5d2 100644
--- a/content/posts/leetcode/2443-sum-of-number-and-its-reverse.md
+++ b/content/posts/leetcode/2443-sum-of-number-and-its-reverse.md
@@ -171,8 +171,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool sumOfNumberAndReverse(int num) {
for (int i = 0; i <= num; i++) {
int t = i;
diff --git a/content/posts/leetcode/2444-count-subarrays-with-fixed-bounds.md b/content/posts/leetcode/2444-count-subarrays-with-fixed-bounds.md
index d9b1e3dd4..788d7455b 100644
--- a/content/posts/leetcode/2444-count-subarrays-with-fixed-bounds.md
+++ b/content/posts/leetcode/2444-count-subarrays-with-fixed-bounds.md
@@ -210,8 +210,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
diff --git a/content/posts/leetcode/2455-average-value-of-even-numbers-that-are-divisible-by-three.md b/content/posts/leetcode/2455-average-value-of-even-numbers-that-are-divisible-by-three.md
index 864aefc3c..5ff892f07 100644
--- a/content/posts/leetcode/2455-average-value-of-even-numbers-that-are-divisible-by-three.md
+++ b/content/posts/leetcode/2455-average-value-of-even-numbers-that-are-divisible-by-three.md
@@ -161,8 +161,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int averageValue(int* nums, int numsSize) {
int s = 0, n = 0;
for (int i = 0; i < numsSize; ++i) {
diff --git a/content/posts/leetcode/2469-convert-the-temperature.md b/content/posts/leetcode/2469-convert-the-temperature.md
index 03c35dc69..f8d748b65 100644
--- a/content/posts/leetcode/2469-convert-the-temperature.md
+++ b/content/posts/leetcode/2469-convert-the-temperature.md
@@ -121,8 +121,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2474-customers-with-strictly-increasing-purchases.md b/content/posts/leetcode/2474-customers-with-strictly-increasing-purchases.md
index cd7545bf6..1708f6207 100644
--- a/content/posts/leetcode/2474-customers-with-strictly-increasing-purchases.md
+++ b/content/posts/leetcode/2474-customers-with-strictly-increasing-purchases.md
@@ -100,7 +100,6 @@ Customer 3: The first year is 2017, and the last year is 2018
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
customer_id
diff --git a/content/posts/leetcode/2480-form-a-chemical-bond.md b/content/posts/leetcode/2480-form-a-chemical-bond.md
index 58cb6c66a..480b8a807 100644
--- a/content/posts/leetcode/2480-form-a-chemical-bond.md
+++ b/content/posts/leetcode/2480-form-a-chemical-bond.md
@@ -91,7 +91,6 @@ Each Metal element pairs with a Nonmetal element in the output table.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT a.symbol AS metal, b.symbol AS nonmetal
FROM
diff --git a/content/posts/leetcode/2482-difference-between-ones-and-zeros-in-row-and-column.md b/content/posts/leetcode/2482-difference-between-ones-and-zeros-in-row-and-column.md
index b705de3c1..90c176b89 100644
--- a/content/posts/leetcode/2482-difference-between-ones-and-zeros-in-row-and-column.md
+++ b/content/posts/leetcode/2482-difference-between-ones-and-zeros-in-row-and-column.md
@@ -232,8 +232,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
diff --git a/content/posts/leetcode/2494-merge-overlapping-events-in-the-same-hall.md b/content/posts/leetcode/2494-merge-overlapping-events-in-the-same-hall.md
index fff87c84d..730fd43e8 100644
--- a/content/posts/leetcode/2494-merge-overlapping-events-in-the-same-hall.md
+++ b/content/posts/leetcode/2494-merge-overlapping-events-in-the-same-hall.md
@@ -83,7 +83,6 @@ Hall 3:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
S AS (
diff --git a/content/posts/leetcode/2496-maximum-value-of-a-string-in-an-array.md b/content/posts/leetcode/2496-maximum-value-of-a-string-in-an-array.md
index e476adc2e..446ba8e63 100644
--- a/content/posts/leetcode/2496-maximum-value-of-a-string-in-an-array.md
+++ b/content/posts/leetcode/2496-maximum-value-of-a-string-in-an-array.md
@@ -196,8 +196,8 @@ public class Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int parseInt(char* s) {
diff --git a/content/posts/leetcode/2504-concatenate-the-name-and-the-profession.md b/content/posts/leetcode/2504-concatenate-the-name-and-the-profession.md
index cd285292d..ebd9e62a4 100644
--- a/content/posts/leetcode/2504-concatenate-the-name-and-the-profession.md
+++ b/content/posts/leetcode/2504-concatenate-the-name-and-the-profession.md
@@ -79,7 +79,6 @@ Person table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT person_id, CONCAT(name, "(", SUBSTRING(profession, 1, 1), ")") AS name
FROM Person
diff --git a/content/posts/leetcode/2515-shortest-distance-to-target-string-in-a-circular-array.md b/content/posts/leetcode/2515-shortest-distance-to-target-string-in-a-circular-array.md
index 9fe25e380..ec1949571 100644
--- a/content/posts/leetcode/2515-shortest-distance-to-target-string-in-a-circular-array.md
+++ b/content/posts/leetcode/2515-shortest-distance-to-target-string-in-a-circular-array.md
@@ -190,8 +190,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int closetTarget(char** words, int wordsSize, char* target, int startIndex) {
for (int i = 0; i <= wordsSize >> 1; i++) {
if (strcmp(words[(startIndex - i + wordsSize) % wordsSize], target) == 0 || strcmp(words[(startIndex + i) % wordsSize], target) == 0) {
diff --git a/content/posts/leetcode/2520-count-the-digits-that-divide-a-number.md b/content/posts/leetcode/2520-count-the-digits-that-divide-a-number.md
index 8e57274ed..f6ffd8c4d 100644
--- a/content/posts/leetcode/2520-count-the-digits-that-divide-a-number.md
+++ b/content/posts/leetcode/2520-count-the-digits-that-divide-a-number.md
@@ -158,8 +158,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int countDigits(int num) {
int ans = 0;
int cur = num;
diff --git a/content/posts/leetcode/2529-maximum-count-of-positive-integer-and-negative-integer.md b/content/posts/leetcode/2529-maximum-count-of-positive-integer-and-negative-integer.md
index c0bb54739..68331d8c5 100644
--- a/content/posts/leetcode/2529-maximum-count-of-positive-integer-and-negative-integer.md
+++ b/content/posts/leetcode/2529-maximum-count-of-positive-integer-and-negative-integer.md
@@ -170,8 +170,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int maximumCount(int* nums, int numsSize) {
@@ -303,8 +303,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define max(a, b) (((a) > (b)) ? (a) : (b))
int search(int* nums, int numsSize, int target) {
diff --git a/content/posts/leetcode/2535-difference-between-element-sum-and-digit-sum-of-an-array.md b/content/posts/leetcode/2535-difference-between-element-sum-and-digit-sum-of-an-array.md
index 4b6c10958..ecb311829 100644
--- a/content/posts/leetcode/2535-difference-between-element-sum-and-digit-sum-of-an-array.md
+++ b/content/posts/leetcode/2535-difference-between-element-sum-and-digit-sum-of-an-array.md
@@ -175,8 +175,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int differenceOfSum(int* nums, int numsSize) {
int ans = 0;
for (int i = 0; i < numsSize; i++) {
diff --git a/content/posts/leetcode/2540-minimum-common-value.md b/content/posts/leetcode/2540-minimum-common-value.md
index 067809220..0114f191c 100644
--- a/content/posts/leetcode/2540-minimum-common-value.md
+++ b/content/posts/leetcode/2540-minimum-common-value.md
@@ -184,8 +184,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int getCommon(int* nums1, int nums1Size, int* nums2, int nums2Size) {
int i = 0;
int j = 0;
diff --git a/content/posts/leetcode/2541-minimum-operations-to-make-array-equal-ii.md b/content/posts/leetcode/2541-minimum-operations-to-make-array-equal-ii.md
index 2ad9220cb..734eeb67b 100644
--- a/content/posts/leetcode/2541-minimum-operations-to-make-array-equal-ii.md
+++ b/content/posts/leetcode/2541-minimum-operations-to-make-array-equal-ii.md
@@ -240,8 +240,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
long long minOperations(int* nums1, int nums1Size, int* nums2, int nums2Size, int k) {
if (k == 0) {
for (int i = 0; i < nums1Size; i++) {
diff --git a/content/posts/leetcode/2544-alternating-digit-sum.md b/content/posts/leetcode/2544-alternating-digit-sum.md
index 0ad5a98a5..5854bb0b5 100644
--- a/content/posts/leetcode/2544-alternating-digit-sum.md
+++ b/content/posts/leetcode/2544-alternating-digit-sum.md
@@ -168,8 +168,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int alternateDigitSum(int n) {
int ans = 0;
int sign = 1;
diff --git a/content/posts/leetcode/2546-apply-bitwise-operations-to-make-strings-equal.md b/content/posts/leetcode/2546-apply-bitwise-operations-to-make-strings-equal.md
index da7ad98f0..2eb83958b 100644
--- a/content/posts/leetcode/2546-apply-bitwise-operations-to-make-strings-equal.md
+++ b/content/posts/leetcode/2546-apply-bitwise-operations-to-make-strings-equal.md
@@ -126,8 +126,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
bool makeStringsEqual(char* s, char* target) {
int count = 0;
for (int i = 0; s[i]; i++) {
diff --git a/content/posts/leetcode/2553-separate-the-digits-in-an-array.md b/content/posts/leetcode/2553-separate-the-digits-in-an-array.md
index 6d75c12a9..29515b474 100644
--- a/content/posts/leetcode/2553-separate-the-digits-in-an-array.md
+++ b/content/posts/leetcode/2553-separate-the-digits-in-an-array.md
@@ -185,8 +185,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2554-maximum-number-of-integers-to-choose-from-a-range-i.md b/content/posts/leetcode/2554-maximum-number-of-integers-to-choose-from-a-range-i.md
index d7c9b322d..5eaa74f9e 100644
--- a/content/posts/leetcode/2554-maximum-number-of-integers-to-choose-from-a-range-i.md
+++ b/content/posts/leetcode/2554-maximum-number-of-integers-to-choose-from-a-range-i.md
@@ -200,8 +200,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int cmp(const void* a, const void* b) {
return *(int*) a - *(int*) b;
}
diff --git a/content/posts/leetcode/2562-find-the-array-concatenation-value.md b/content/posts/leetcode/2562-find-the-array-concatenation-value.md
index b37a26fd5..c15a8a6d7 100644
--- a/content/posts/leetcode/2562-find-the-array-concatenation-value.md
+++ b/content/posts/leetcode/2562-find-the-array-concatenation-value.md
@@ -211,8 +211,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int getLen(int num) {
int res = 0;
while (num) {
diff --git a/content/posts/leetcode/2566-maximum-difference-by-remapping-a-digit.md b/content/posts/leetcode/2566-maximum-difference-by-remapping-a-digit.md
index 923fa5126..34d7be44c 100644
--- a/content/posts/leetcode/2566-maximum-difference-by-remapping-a-digit.md
+++ b/content/posts/leetcode/2566-maximum-difference-by-remapping-a-digit.md
@@ -198,8 +198,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
int getLen(int num) {
int res = 0;
while (num) {
diff --git a/content/posts/leetcode/2567-minimum-score-by-changing-two-elements.md b/content/posts/leetcode/2567-minimum-score-by-changing-two-elements.md
index 1f8085162..325ff2008 100644
--- a/content/posts/leetcode/2567-minimum-score-by-changing-two-elements.md
+++ b/content/posts/leetcode/2567-minimum-score-by-changing-two-elements.md
@@ -151,8 +151,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
#define min(a, b) (((a) < (b)) ? (a) : (b))
int cmp(const void* a, const void* b) {
diff --git a/content/posts/leetcode/2574-left-and-right-sum-differences.md b/content/posts/leetcode/2574-left-and-right-sum-differences.md
index 05f26e8a8..3c5a9bfae 100644
--- a/content/posts/leetcode/2574-left-and-right-sum-differences.md
+++ b/content/posts/leetcode/2574-left-and-right-sum-differences.md
@@ -190,8 +190,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2575-find-the-divisibility-array-of-a-string.md b/content/posts/leetcode/2575-find-the-divisibility-array-of-a-string.md
index 85bbe4528..c81803daa 100644
--- a/content/posts/leetcode/2575-find-the-divisibility-array-of-a-string.md
+++ b/content/posts/leetcode/2575-find-the-divisibility-array-of-a-string.md
@@ -169,8 +169,8 @@ impl Solution {
```
{{< /terminal >}}
+{{< terminal title="C Code" >}}
```c
-{{< /terminal >}}
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
diff --git a/content/posts/leetcode/2668-find-latest-salaries.md b/content/posts/leetcode/2668-find-latest-salaries.md
index af0a58d8a..c5a5bbec4 100644
--- a/content/posts/leetcode/2668-find-latest-salaries.md
+++ b/content/posts/leetcode/2668-find-latest-salaries.md
@@ -89,7 +89,6 @@ Each row contains employees details and their yearly salaries, however, some of
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
emp_id,
diff --git a/content/posts/leetcode/2669-count-artist-occurrences-on-spotify-ranking-list.md b/content/posts/leetcode/2669-count-artist-occurrences-on-spotify-ranking-list.md
index fc93a1370..24dc302b6 100644
--- a/content/posts/leetcode/2669-count-artist-occurrences-on-spotify-ranking-list.md
+++ b/content/posts/leetcode/2669-count-artist-occurrences-on-spotify-ranking-list.md
@@ -73,7 +73,6 @@ Each row contains an id, track_name, and artist.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
artist,
diff --git a/content/posts/leetcode/2686-immediate-food-delivery-iii.md b/content/posts/leetcode/2686-immediate-food-delivery-iii.md
index ccdc60397..3a50fb0e5 100644
--- a/content/posts/leetcode/2686-immediate-food-delivery-iii.md
+++ b/content/posts/leetcode/2686-immediate-food-delivery-iii.md
@@ -86,7 +86,6 @@ order_date is sorted in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT order_date
,ROUND(100*SUM(IF(customer_pref_delivery_date = order_date,1,0))/COUNT(*),2) AS immediate_percentage
diff --git a/content/posts/leetcode/2687-bikes-last-time-used.md b/content/posts/leetcode/2687-bikes-last-time-used.md
index dd8ac993d..2d035b035 100644
--- a/content/posts/leetcode/2687-bikes-last-time-used.md
+++ b/content/posts/leetcode/2687-bikes-last-time-used.md
@@ -81,7 +81,6 @@ Returning output in order by the bike that were most recently used.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
bike_number,
diff --git a/content/posts/leetcode/2688-find-active-users.md b/content/posts/leetcode/2688-find-active-users.md
index 663d088fb..ace0715c4 100644
--- a/content/posts/leetcode/2688-find-active-users.md
+++ b/content/posts/leetcode/2688-find-active-users.md
@@ -78,7 +78,6 @@ Each row includes the user ID, the purchased item, the date of purchase, and the
```sql
-{{< /terminal >}}
# Write your MySQL query statement
SELECT DISTINCT
user_id
diff --git a/content/posts/leetcode/2701-consecutive-transactions-with-increasing-amounts.md b/content/posts/leetcode/2701-consecutive-transactions-with-increasing-amounts.md
index 867c79454..ac00ba45e 100644
--- a/content/posts/leetcode/2701-consecutive-transactions-with-increasing-amounts.md
+++ b/content/posts/leetcode/2701-consecutive-transactions-with-increasing-amounts.md
@@ -87,7 +87,6 @@ customer_id is sorted in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2720-popularity-percentage.md b/content/posts/leetcode/2720-popularity-percentage.md
index ad749da17..5e06ca16e 100644
--- a/content/posts/leetcode/2720-popularity-percentage.md
+++ b/content/posts/leetcode/2720-popularity-percentage.md
@@ -92,7 +92,6 @@ user1 is sorted in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
F AS (
diff --git a/content/posts/leetcode/2738-count-occurrences-in-text.md b/content/posts/leetcode/2738-count-occurrences-in-text.md
index d6bd483eb..0e8d49ce7 100644
--- a/content/posts/leetcode/2738-count-occurrences-in-text.md
+++ b/content/posts/leetcode/2738-count-occurrences-in-text.md
@@ -76,7 +76,6 @@ Files table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT 'bull' AS word, COUNT(*) AS count
FROM Files
diff --git a/content/posts/leetcode/2752-customers-with-maximum-number-of-transactions-on-consecutive-days.md b/content/posts/leetcode/2752-customers-with-maximum-number-of-transactions-on-consecutive-days.md
index 34a041dea..60226e4d2 100644
--- a/content/posts/leetcode/2752-customers-with-maximum-number-of-transactions-on-consecutive-days.md
+++ b/content/posts/leetcode/2752-customers-with-maximum-number-of-transactions-on-consecutive-days.md
@@ -80,7 +80,6 @@ In total, the highest number of consecutive transactions is 3, achieved by custo
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
s AS (
diff --git a/content/posts/leetcode/2783-flight-occupancy-and-waitlist-analysis.md b/content/posts/leetcode/2783-flight-occupancy-and-waitlist-analysis.md
index 56e9bad8f..69f773b97 100644
--- a/content/posts/leetcode/2783-flight-occupancy-and-waitlist-analysis.md
+++ b/content/posts/leetcode/2783-flight-occupancy-and-waitlist-analysis.md
@@ -99,7 +99,6 @@ Passengers table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
flight_id,
diff --git a/content/posts/leetcode/2793-status-of-flight-tickets.md b/content/posts/leetcode/2793-status-of-flight-tickets.md
index 280287fad..e9eea7e4b 100644
--- a/content/posts/leetcode/2793-status-of-flight-tickets.md
+++ b/content/posts/leetcode/2793-status-of-flight-tickets.md
@@ -105,7 +105,6 @@ Passengers table:
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
passenger_id,
diff --git a/content/posts/leetcode/2820-election-results.md b/content/posts/leetcode/2820-election-results.md
index 6db367992..62668d35d 100644
--- a/content/posts/leetcode/2820-election-results.md
+++ b/content/posts/leetcode/2820-election-results.md
@@ -83,7 +83,6 @@ Note that there may be multiple candidates ranking first in the result set, so w
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2837-total-traveled-distance.md b/content/posts/leetcode/2837-total-traveled-distance.md
index d6be1a4f6..f02400993 100644
--- a/content/posts/leetcode/2837-total-traveled-distance.md
+++ b/content/posts/leetcode/2837-total-traveled-distance.md
@@ -106,7 +106,6 @@ We can use a left join to connect the two tables, and then use group by sum to c
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT user_id, name, IFNULL(SUM(distance), 0) AS 'traveled distance'
FROM
diff --git a/content/posts/leetcode/2853-highest-salaries-difference.md b/content/posts/leetcode/2853-highest-salaries-difference.md
index 68f6c049e..00e257f69 100644
--- a/content/posts/leetcode/2853-highest-salaries-difference.md
+++ b/content/posts/leetcode/2853-highest-salaries-difference.md
@@ -78,7 +78,6 @@ We can first calculate the highest salary for each department, and then calculat
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT MAX(s) - MIN(s) AS salary_difference
FROM
diff --git a/content/posts/leetcode/2854-rolling-average-steps.md b/content/posts/leetcode/2854-rolling-average-steps.md
index 674bd0a03..261132f02 100644
--- a/content/posts/leetcode/2854-rolling-average-steps.md
+++ b/content/posts/leetcode/2854-rolling-average-steps.md
@@ -101,7 +101,6 @@ We can use the window function `LAG() OVER()` to calculate the difference in day
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2893-calculate-orders-within-each-interval.md b/content/posts/leetcode/2893-calculate-orders-within-each-interval.md
index c182c19c1..88dd3c262 100644
--- a/content/posts/leetcode/2893-calculate-orders-within-each-interval.md
+++ b/content/posts/leetcode/2893-calculate-orders-within-each-interval.md
@@ -83,7 +83,6 @@ Returning table orderd by interval_no in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
@@ -108,7 +107,6 @@ WHERE minute % 6 = 0;
```sql
-{{< /terminal >}}
SELECT
FLOOR((minute + 5) / 6) AS interval_no,
SUM(order_count) AS total_orders
diff --git a/content/posts/leetcode/2922-market-analysis-iii.md b/content/posts/leetcode/2922-market-analysis-iii.md
index 656997d9c..da23958f6 100644
--- a/content/posts/leetcode/2922-market-analysis-iii.md
+++ b/content/posts/leetcode/2922-market-analysis-iii.md
@@ -120,7 +120,6 @@ We can use equijoin to connect the `Orders` table and the `Users` table accordin
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2978-symmetric-coordinates.md b/content/posts/leetcode/2978-symmetric-coordinates.md
index d7668be45..4e5542aef 100644
--- a/content/posts/leetcode/2978-symmetric-coordinates.md
+++ b/content/posts/leetcode/2978-symmetric-coordinates.md
@@ -79,7 +79,6 @@ We can use the window function `ROW_NUMBER()` to add an auto-incrementing sequen
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
P AS (
diff --git a/content/posts/leetcode/2984-find-peak-calling-hours-for-each-city.md b/content/posts/leetcode/2984-find-peak-calling-hours-for-each-city.md
index c5c17a34d..8462f41b6 100644
--- a/content/posts/leetcode/2984-find-peak-calling-hours-for-each-city.md
+++ b/content/posts/leetcode/2984-find-peak-calling-hours-for-each-city.md
@@ -78,7 +78,6 @@ Output table is ordered by peak_calling_hour and city in descending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2985-calculate-compressed-mean.md b/content/posts/leetcode/2985-calculate-compressed-mean.md
index b48c36a5f..db04e4285 100644
--- a/content/posts/leetcode/2985-calculate-compressed-mean.md
+++ b/content/posts/leetcode/2985-calculate-compressed-mean.md
@@ -74,7 +74,6 @@ We use the `SUM` function to calculate the total quantity of products and the to
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
ROUND(
diff --git a/content/posts/leetcode/2986-find-third-transaction.md b/content/posts/leetcode/2986-find-third-transaction.md
index 88cc8fde9..a5833afb4 100644
--- a/content/posts/leetcode/2986-find-third-transaction.md
+++ b/content/posts/leetcode/2986-find-third-transaction.md
@@ -79,7 +79,6 @@ Output table is ordered by user_id in ascending order.
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2987-find-expensive-cities.md b/content/posts/leetcode/2987-find-expensive-cities.md
index 66c53d4f1..eb14f45b9 100644
--- a/content/posts/leetcode/2987-find-expensive-cities.md
+++ b/content/posts/leetcode/2987-find-expensive-cities.md
@@ -86,7 +86,6 @@ We group the `Listings` table by `city`, then calculate the average house price
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT city
FROM Listings
diff --git a/content/posts/leetcode/2988-manager-of-the-largest-department.md b/content/posts/leetcode/2988-manager-of-the-largest-department.md
index 0a2e56eff..24b33ce73 100644
--- a/content/posts/leetcode/2988-manager-of-the-largest-department.md
+++ b/content/posts/leetcode/2988-manager-of-the-largest-department.md
@@ -83,7 +83,6 @@ We can first count the number of employees in each department, denoted as table
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2989-class-performance.md b/content/posts/leetcode/2989-class-performance.md
index 8e1386687..d013e78bb 100644
--- a/content/posts/leetcode/2989-class-performance.md
+++ b/content/posts/leetcode/2989-class-performance.md
@@ -82,7 +82,6 @@ We can use the `MAX` and `MIN` functions to get the maximum and minimum sums of
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
MAX(assignment1 + assignment2 + assignment3) - MIN(
diff --git a/content/posts/leetcode/2990-loan-types.md b/content/posts/leetcode/2990-loan-types.md
index 66f1eb6ff..74185ae4f 100644
--- a/content/posts/leetcode/2990-loan-types.md
+++ b/content/posts/leetcode/2990-loan-types.md
@@ -80,7 +80,6 @@ We can group the `Loans` table by `user_id` to find users who have both `Refinan
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT user_id
FROM Loans
diff --git a/content/posts/leetcode/2991-top-three-wineries.md b/content/posts/leetcode/2991-top-three-wineries.md
index 7740a6020..2b1a6e76d 100644
--- a/content/posts/leetcode/2991-top-three-wineries.md
+++ b/content/posts/leetcode/2991-top-three-wineries.md
@@ -106,7 +106,6 @@ Next, we just need to filter out the data where `rk = 1`, then join table `T` to
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (
diff --git a/content/posts/leetcode/2993-friday-purchases-i.md b/content/posts/leetcode/2993-friday-purchases-i.md
index 455c997df..127134f9b 100644
--- a/content/posts/leetcode/2993-friday-purchases-i.md
+++ b/content/posts/leetcode/2993-friday-purchases-i.md
@@ -87,7 +87,6 @@ First, we use the `DATE_FORMAT` function to format the date in the form of `YYYY
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
SELECT
CEIL(DAYOFMONTH(purchase_date) / 7) AS week_of_month,
diff --git a/content/posts/leetcode/2994-friday-purchases-ii.md b/content/posts/leetcode/2994-friday-purchases-ii.md
index 4bf12ca14..4ce02b738 100644
--- a/content/posts/leetcode/2994-friday-purchases-ii.md
+++ b/content/posts/leetcode/2994-friday-purchases-ii.md
@@ -83,7 +83,6 @@ We can generate a table `T` that contains all dates in November 2023 using recur
```sql
-{{< /terminal >}}
WITH RECURSIVE
T AS (
SELECT '2023-11-01' AS purchase_date
diff --git a/content/posts/leetcode/2995-viewers-turned-streamers.md b/content/posts/leetcode/2995-viewers-turned-streamers.md
index 8309fb209..e2146e050 100644
--- a/content/posts/leetcode/2995-viewers-turned-streamers.md
+++ b/content/posts/leetcode/2995-viewers-turned-streamers.md
@@ -82,7 +82,6 @@ We can use the window function `RANK()` to rank each session by `user_id` dimens
```sql
-{{< /terminal >}}
# Write your MySQL query statement below
WITH
T AS (