Head to head: Google: Gemini 3.6 Flash vs gpt-oss-120b

Google: Gemini 3.6 Flash: [ { "text": "Fast shipping but the fabric feels cheap.", "label": "mixed", "reason": "Fast shipping but cheap fabric." }, { "text": "Absolutely love it, wearing it daily!", "label": "positive", "reason": "Loves product and wears it daily." }, { "text": "It broke after a week. Refund was quick and painless though.", "label": "mixed", "reason": "Item broke, but refund was easy." } ]

gpt-oss-120b: [ {"text":"Fast shipping but the fabric feels cheap.","label":"mixed","reason":"Quick delivery, low-quality material."}, {"text":"Absolutely love it, wearing it daily!","label":"positive","reason":"Adore it, uses it every day."}, {"text":"It broke after a week. Refund was quick and painless though.","label":"mixed","reason":"Product failed, refund handled smoothly."} ]

Google: Gemini 3.6 Flash: **Subject:** Service Restored: T4 Slip Downloads Now Available Dear HR Administrator, We are writing to inform you that an issue affecting T4 tax slip downloads for Canadian employees earlier today has been fully resolved. For approximately 95 minutes this morning, some employees were unable to access or download their T4 slips through the payroll portal. Our team addressed the issue promptly, and full service has been restored. We want to reassure you that all payroll data remained entirely secure, accurate, and uncompromised throughout this period. **What you should do now:** Please advise your Canadian employees to log in and attempt to download their T4 slips again. If the download is successful, no further action is needed. Should any employee continue to experience difficulties, please have them try again after refreshing their browser, or reach out to our customer support team for assistance. We sincerely apologize for this disruption and any inconvenience it caused your team and employees during this busy season. Thank you for your patience and continued partnership. Sincerely, [Your Name/Company Name]

gpt-oss-120b: **Subject:** Update on Today’s T4 Slip Download Issue Dear HR Administrator, This morning, from 08:10 am to 09:45 am EST, employees in Canada were unable to download their T4 slips from our payroll platform. The service interruption lasted approximately 95 minutes and has now been fully resolved. Please have your employees retry downloading their T4 slips. If the download succeeds, no further action is required on your part. All payroll data, including the T4 information, remained securely stored and unchanged throughout the incident. Our team is actively monitoring the system to ensure continued stability. We understand how critical timely access to tax documents is for your team, and we sincerely apologize for any inconvenience this may have caused. Your confidence in our service is important to us, and we remain committed to delivering reliable, secure payroll solutions. If you have any questions, please contact our support team at support@payrollsaaS.com. Thank you for your understanding. Sincerely, [Your Name] Customer Success Manager

Google: Gemini 3.6 Flash: ```json { "order_id": "ZX-4819-B", "customer_name": "Marisol Venn", "ship_to_city": "Dunbar", "items": [ { "name": "AeroLatch mini", "sku": "ALM-04", "quantity": 5 }, { "name": "Copperfin filter", "sku": "CFF-9", "quantity": 1 } ], "total_qty": 6, "promised_ship_date": "2026-04-14", "tracking_code": "TRK-0091-XY-2", "fragile": true, "support_case": "CS-77102" } ```

gpt-oss-120b: ```json { "order_id": "ZX-4819-B", "customer_name": "Marisol Venn", "ship_to_city": "Dunbar", "items": [ { "name": "AeroLatch mini", "sku": "ALM-04", "quantity": 5 }, { "name": "Copperfin filter", "sku": "CFF-9", "quantity": 1 } ], "total_qty": 6, "promised_ship_date": "2026-04-14", "tracking_code": "TRK-0091-XY-2", "fragile": true, "support_case": "CS-77102" } ```

Google: Gemini 3.6 Flash: ```python class Node: def __init__(self, key: int = 0, value: int = 0): self.key = key self.value = value self.prev = None self.next = None class LRUCache: def __init__(self, capacity: int): self.capacity = capacity self.cache = {} # Dummy head and tail nodes to simplify list manipulation self.head = Node() self.tail = Node() self.head.next = self.tail self.tail.prev = self.head def _remove(self, node: Node) -> None: """Remove an existing node from the doubly linked list.""" prev_node = node.prev next_node = node.next prev_node.next = next_node next_node.prev = prev_node def _add_to_tail(self, node: Node) -> None: """Insert a node right before the dummy tail (most recently used).""" prev_node = self.tail.prev prev_node.next = node node.prev = prev_node node.next = self.tail self.tail.prev = node def get(self, key: int) -> int: if key in self.cache: node = self.cache[key] self._remove(node) self._add_to_tail(node) return node.value return -1 def put(self, key: int, value: int) -> None: if key in self.cache: node = self.cache[key] node.value = value self._remove(node) self._add_to_tail(node) else: if len(self.cache) >= self.capacity: # Evict the least recently used node (head.next) lru_node = self.head.next self._remove(lru_node) del self.cache[lru_node.key] new_node = Node(key, value) self.cache[key] = new_node self._add_to_tail(new_node) ```

gpt-oss-120b: ```python from __future__ import annotations from typing import Optional class _Node: __slots__ = ("key", "value", "prev", "next") def __init__(self, key: int, value: int): self.key: int = key self.value: int = value self.prev: Optional[_Node] = None self.next: Optional[_Node] = None class LRUCache: """ Least‑Recently‑Used (LRU) cache with O(1) get and put operations. """ def __init__(self, capacity: int): if capacity <= 0: raise ValueError("capacity must be > 0") self._capacity: int = capacity self._cache: dict[int, _Node] = {} # Dummy head & tail simplify insert / removal logic self._head: _Node = _Node(0, 0) # most‑recently used side self._tail: _Node = _Node(0, 0) # least‑recently used side self._head.next = self._tail self._tail.prev = self._head # ------------------------------------------------------------------ # # Internal helper methods (all O(1)) # ------------------------------------------------------------------ # def _remove(self, node: _Node) -> None: """Detach `node` from the linked list.""" prev_node = node.prev nxt_node = node.next if prev_node is not None and nxt_node is not None: prev_node.next = nxt_node nxt_node.prev = prev_node node.prev = node.next = None def _add_to_front(self, node: _Node) -> None: """Insert `node` right after the dummy head (most‑recent position).""" node.prev = self._head node.next = self._head.next self._head.next!.prev = node # type: ignore[union-attr] self._head.next = node def _move_to_front(self, node: _Node) -> None: """Mark `node` as most recently used.""" self._remove(node) self._add_to_front(node) def _evict_lru(self) -> None: """Remove the least recently used node (right before dummy tail).""" lru = self._tail.prev if lru is self._head: # cache empty; should not happen return self._remove(lru) del self._cache[lru.key] # ------------------------------------------------------------------ # # Public API # ------------------------------------------------------------------ # def get(self, key: int) -> int: """Return value for `key` if present, else -1. Marks key as recently used.""" node = self._cache.get(key) if node is None: return -1 self._move_to_front(node) return node.value def put(self, key: int, value: int) -> None: """Insert or update `key` with `value`. Evicts LRU entry if capacity exceeded.""" node = self._cache.get(key) if node: # Update existing entry and move to front node.value = value self._move_to_front(node) else: # Insert new entry if len(self._cache) >= self._capacity: self._evict_lru() new_node = _Node(key, value) self._cache[key] = new_node self._add_to_front(new_node) ```

Google: Gemini 3.6 Flash: "It's been a long time since we saw their new office, and he and I were surprised how quiet it was." Its -> It's, seen -> saw, there -> their, me and him -> he and I, was -> were, suprised -> surprised, quite -> quiet

gpt-oss-120b: It's been a long time since we saw their new office, and he and I were surprised how quiet it was. Its -> It's, seen -> saw, there -> their, me -> I, him -> he, was -> were, suprised -> surprised, quite -> quiet

Google: Gemini 3.6 Flash: **Corrected Passage:** "Yesterday's deployment to the invoices service was supposed to reduce timeouts, but instead it increased p95 latency from 380ms to 1.4s for eu-west customers only. We don't think the database is the cause because CPU usage stayed under 35%; however, the new retry logic is probably amplifying traffic. By 16:40, we rolled back the worker image and latency returned to near baseline, though a few requests were still queued for around 20 minutes." *** ### Main Changes Made: * **Subject-Verb Agreement & Tense:** Corrected verb forms throughout the passage (e.g., "were suppose" to "was supposed," "logic are" to "logic is," "roll backed" to "rolled back," and "requests was" to "requests were"). * **Punctuation & Apostrophes:** Added missing apostrophes for possessives/contractions ("Yesterday's," "don't"), removed an incorrect plural apostrophe ("timeouts"), and added a semicolon before "however" to fix a comma splice. * **Clarity & Phrasing:** Replaced the informal noun "deploy" with "deployment," added "usage" after CPU, and improved prepositional phrasing (e.g., "returned to near baseline").

gpt-oss-120b: **Revised passage** Yesterday’s deployment to the invoices service was supposed to reduce timeouts, but instead it increased the p95 latency from 380 ms to 1.4 s for EU‑West customers only. We don’t think the database is the cause because CPU stayed under 35 %, but the new retry logic is probably amplifying traffic. By 16:40 we had rolled back the worker image, and latency returned to near baseline, though a few requests were still queued for about 20 minutes. **Main changes** - Fixed possessive forms, plurals, and verb tenses (e.g., “Yesterday’s deployment,” “was supposed,” “are → is,” “rolled back,” “were still queued”). - Corrected punctuation and added missing commas for clearer sentence flow. - Clarified wording and consistency (e.g., “time‑outs” → “timeouts,” “EU‑West customers only,” “CPU stayed under 35 %”).

Google: Gemini 3.6 Flash: 9: A 10: B 11: D 12: C Justification: Since B must immediately follow A and A must precede D (which cannot be at 12), A and B must take slots 9 and 10, leaving D for 11 and C for 12 to satisfy all conditions.

gpt-oss-120b: 9 AM – A 10 AM – B 11 AM – D 12 PM – C **Justification:** A precedes D, B follows A directly, C is not in the first slot, and D is not at 12 PM. All constraints are satisfied.

Google: Gemini 3.6 Flash: ```javascript function normalizePhones(records) { return records.map(record => { let normalizedPhone = null; if (record.phone !== null && record.phone !== undefined) { const mainPart = String(record.phone).split(/x|ext|#/i)[0]; const digits = mainPart.replace(/\D/g, ''); if (digits.length === 10) { normalizedPhone = `+1${digits}`; } else if (digits.length === 11 && digits.startsWith('1')) { normalizedPhone = `+1${digits.slice(1)}`; } } return { ...record, phone: normalizedPhone }; }); } ```

gpt-oss-120b: ```javascript function normalizePhones(records) { return records.map(record => { const { phone } = record; let normalized = null; if (typeof phone === 'string') { // Remove any extension (e.g., "x22", "X123", "ext. 45") const noExt = phone.split(/[xX]/)[0]; // Keep only digits const digits = noExt.replace(/\D/g, ''); if (digits.length === 10) { normalized = '+1' + digits; } else if (digits.length === 11 && digits[0] === '1') { normalized = '+1' + digits.slice(1); } } // Return a shallow copy with the normalized phone return { ...record, phone: normalized }; }); } ```

Google: Gemini 3.6 Flash: * DECISION: The team selected Northwind Studio to redesign the tenant onboarding workflow. * RISK: Delayed legal review of updated consent screen wording might postpone the launch. * OWNER: Priya will deliver revised consent copy to legal and Northwind by Thursday. * DATE: Target launch remains 18 September 2026, assuming legal approval arrives next week.

gpt-oss-120b: - DECISION: Select Northwind Studio to redesign the tenant onboarding flow. - RISK: Legal review may delay launch if consent wording not approved promptly. - OWNER: Priya sends revised copy to legal and Northwind by Thursday. - DATE: Target launch set for 18 September 2026, pending approval.

Google: Gemini 3.6 Flash: ```sql WITH ranked_orders AS ( SELECT c.name, o.total_cents, ROW_NUMBER() OVER (PARTITION BY o.customer_id ORDER BY o.total_cents DESC) AS rn FROM customers c JOIN orders o ON c.id = o.customer_id ) SELECT name, ROUND(total_cents / 100.0, 2) AS second_largest_order_total FROM ranked_orders WHERE rn = 2 ORDER BY second_largest_order_total DESC; ```

gpt-oss-120b: ```sql SELECT c.name, round(o.total_cents / 100.0, 2) AS second_largest_total FROM ( SELECT customer_id, total_cents, row_number() OVER (PARTITION BY customer_id ORDER BY total_cents DESC) AS rn FROM orders ) o JOIN customers c ON c.id = o.customer_id WHERE o.rn = 2 ORDER BY second_largest_total DESC; ```

Google: Gemini 3.6 Flash: ```typescript class LRUCache<K, V> { private readonly capacity: number; private readonly cache: Map<K, V>; constructor(capacity: number) { if (capacity <= 0) { throw new Error("Capacity must be greater than 0"); } this.capacity = capacity; this.cache = new Map<K, V>(); } get(key: K): V | undefined { if (!this.cache.has(key)) { return undefined; } const value = this.cache.get(key)!; // Move to end to mark as most-recently-used this.cache.delete(key); this.cache.set(key, value); return value; } set(key: K, value: V): void { if (this.cache.has(key)) { this.cache.delete(key); } else if (this.cache.size >= this.capacity) { // Delete the first key (least-recently-used) const lruKey = this.cache.keys().next().value; if (lruKey !== undefined) { this.cache.delete(lruKey); } } this.cache.set(key, value); } } ```

gpt-oss-120b: ```ts class LRUCache<K, V> { private readonly capacity: number; private readonly cache: Map<K, V>; constructor(capacity: number) { if (capacity < 1) throw new Error('Capacity must be greater than 0'); this.capacity = capacity; this.cache = new Map(); } get(key: K): V | undefined { if (!this.cache.has(key)) return undefined; const value = this.cache.get(key)!; // Move to most-recently-used position this.cache.delete(key); this.cache.set(key, value); return value; } set(key: K, value: V): void { if (this.cache.has(key)) { this.cache.delete(key); } else if (this.cache.size >= this.capacity) { // Evict least-recently-used (first inserted) key const lruKey = this.cache.keys().next().value; this.cache.delete(lruKey); } this.cache.set(key, value); } } ```

Google: Gemini 3.6 Flash: **Key Steps:** 1. **Convert the tank volume to liters:** $1\text{ m}^3 = 1,000\text{ liters}$ $0.9\text{ m}^3 \times 1,000 = 900\text{ liters}$ 2. **Calculate the total time in seconds:** $\text{Total seconds} = \frac{900\text{ liters}}{3.5\text{ liters}} \times 8\text{ seconds}$ $\text{Total seconds} \approx 2057.14\text{ seconds}$ 3. **Convert total seconds into minutes and seconds:** $\text{Minutes} = \lfloor \frac{2057.14}{60} \rfloor = 34\text{ minutes}$ $\text{Remaining seconds} = 2057.14 - (34 \times 60) = 17.14\text{ seconds}$ 4. **Round to the nearest second:** $17.14\text{ seconds} \approx 17\text{ seconds}$ 34:17

gpt-oss-120b: **Key steps** 1. Convert tank volume to liters: \(0.9\ \text{m}^3 = 0.9 \times 1000 \text{ L} = 900\text{ L}\). 2. Find the pump’s flow rate: \(\displaystyle \frac{3.5\ \text{L}}{8\ \text{s}} = 0.4375\ \text{L/s}\). 3. Compute the time to deliver 900 L: \[ t = \frac{900\ \text{L}}{0.4375\ \text{L/s}} = \frac{900}{0.4375}\ \text{s} = \frac{900}{7/16}\ \text{s} = 900 \times \frac{16}{7} = \frac{14400}{7}\ \text{s} \approx 2057.14\ \text{s}. \] 4. Convert seconds to minutes + seconds: \[ 2057.14\ \text{s} = 34\ \text{min} + 17.14\ \text{s} \] Rounded to the nearest second → 17 s. **Final answer** 34:17