Orivel Orivel
Open menu

Latest Tasks & Discussions

Browse the latest benchmark content across tasks and discussions. Switch by genre to focus on what you want to compare.

Benchmark Genres

Model Directory

Summarization

Anthropic Claude Opus 4.6 VS Google Gemini 2.5 Flash

Summarize a Policy Memo with Balanced Tradeoffs

Read the memo below and write a concise summary of 140 to 180 words for a city council member who has not read it. Your summary must cover the problem, the proposed pilot program, expected benefits, main risks or criticisms, and how success would be measured. Do not quote directly. Memo: Riverton's public buses have lost riders for six consecutive years, even though the city's population has grown. A transportation department review found several causes: routes are infrequent outside downtown, schedules are hard to understand, and buses are often delayed by traffic congestion. Low-income residents and older adults reported the greatest difficulty reaching jobs, clinics, and grocery stores without long waits or costly ride-hailing services. In response, staff propose a two-year "Frequent Corridors" pilot. Instead of spreading service thinly across the entire network, the city would increase weekday frequency to every 10 minutes on five major corridors from 6 a.m. to 9 p.m. Two underused neighborhood routes would be replaced by on-demand shuttles that riders could book by phone or app. The plan would also add larger bus-stop signs, simplified maps, and a real-time arrival display at the central transfer station. Supporters argue that riders value reliability and simplicity more than broad but infrequent coverage. They say concentrating resources on the busiest corridors could attract new riders, reduce missed transfers, and improve access to major employers and the community college. They also note that on-demand shuttles may serve low-density areas more efficiently than nearly empty fixed-route buses. Critics raise several concerns. Some disability advocates worry that app-based booking could disadvantage riders without smartphones, although the proposal includes phone reservations. Labor representatives warn that the shuttle service could be outsourced later, potentially affecting union jobs. Environmental groups support transit investment overall but question whether replacing fixed routes with smaller vehicles might reduce total passenger capacity. Some residents also fear that neighborhoods losing direct bus lines will feel abandoned, even if average wait times fall. The pilot is estimated to cost 8 million dollars over two years. Staff suggest funding it through a mix of state transit grants, parking revenue, and delaying a planned downtown streetscape project. They propose evaluating the pilot using ridership changes, average wait times, on-time performance, transfer success rates, customer satisfaction surveys, and access to essential destinations for low-income households. If the pilot fails to improve ridership and reliability within 18 months, staff recommend ending it early or redesigning it.

169
Mar 13, 2026 02:31

Coding

OpenAI GPT-5 mini VS Google Gemini 2.5 Flash-Lite

Implement a Least Recently Used (LRU) Cache

Implement an LRU (Least Recently Used) cache data structure in Python that supports the following operations, each in O(1) average time complexity: 1. `get(key)` — Return the value associated with the key if it exists in the cache, otherwise return -1. Accessing a key marks it as recently used. 2. `put(key, value)` — Insert or update the key-value pair. If the cache has reached its capacity, evict the least recently used item before inserting the new one. Your implementation should be a class called `LRUCache` with the following interface: ``` cache = LRUCache(capacity) cache.put(key, value) result = cache.get(key) ``` Demonstrate your implementation with the following test sequence: ``` cache = LRUCache(2) cache.put(1, 10) cache.put(2, 20) print(cache.get(1)) # Expected: 10 cache.put(3, 30) # Evicts key 2 print(cache.get(2)) # Expected: -1 cache.put(4, 40) # Evicts key 1 print(cache.get(1)) # Expected: -1 print(cache.get(3)) # Expected: 30 print(cache.get(4)) # Expected: 40 ``` Requirements: - Do NOT use `functools.lru_cache` or `collections.OrderedDict`. Implement the underlying data structure yourself. - Use a combination of a hash map and a doubly linked list. - Include clear comments explaining your approach. - Handle edge cases such as capacity of 0 or 1. - Provide the complete, runnable code including the test sequence above with its expected output.

195
Mar 12, 2026 19:00

Showing 341 to 360 of 426 results

Related Links

X f L