# UK Data: Code utilities

> Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging

- name: uk.co.reliness/code-utilities
- version: 1.5.0
- connection class: R0 (autonomous)
- trust: 83/100 flags: no-repository
- quality: 89/100 (new)
- owner: not claimed
- descriptor: https://api.protogrid.dev/v1/servers/uk.co.reliness%2Fcode-utilities
- tools: https://api.protogrid.dev/v1/servers/uk.co.reliness%2Fcode-utilities/tools

**An agent can connect right now, no human step.** Remote endpoint, no authentication, reachable on the last probe.

## Connection (mcpServers)

```json
{
  "mcpServers": {
    "code-utilities": {
      "type": "http",
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
      "headers": {
        "Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
      }
    }
  }
}
```

Placeholders to fill: `${CODE_UTILITIES_TOKEN}`.

## Trust

- hygiene: 80
- liveness: 100
- freshness: 100
- provenance: 55
- drivers: +dns-namespace +website +reachable +uptime-100% +updated-0d-ago -no-repository
- Derived from observable signals (official registry feed and our own credential-free probes); no code audit performed.

## Quality 89/100 (new)

### protocol: 75 (weight 25)

- warn `protocol.modern`: newest supported version is 2025-11-25; 2026-07-28 not supported, older versions are deprecated until 2027-07-28
- n/a `protocol.stateless`: only applies to 2026-07-28 servers
- pass `protocol.transport`: streamable HTTP
- n/a `protocol.list_ttl`: only applies to 2026-07-28 servers

### authorization: n/a (weight 15)

- n/a `auth.prm`, `auth.as_metadata`, `auth.cimd`: no remote uses OAuth
- n/a `auth.secret_in_url`: no templated URL

### tool hygiene: 100 (weight 30)

- pass `tools.descriptions`: every tool has a description
- pass `tools.description_length`: descriptions are concise
- pass `tools.schemas`: every tool has an object input schema
- pass `tools.annotations`: 32 of 32 tools declare readOnlyHint or destructiveHint
- pass `tools.directory_hints`: every tool declares readOnlyHint, destructiveHint, idempotentHint and openWorldHint
- pass `tools.token_cost`: about 4,223 tokens to load every tool
- pass `tools.api_dump`: tools are not a one-to-one API dump

### stability: n/a (weight 15)

- n/a `stability.changes`, `stability.rug_pull`: tool history recorded for 0 of the 7 days needed

### dependencies: n/a (weight 15)

- n/a `deps.known_vulns`, `deps.mcp_sdk_version`, `deps.resolvable`: no npm or PyPI package

- tools: 32, about 4,223 tokens to load them all
- tool set hash: fd3b24fa8d6b399f6d88b356e926ff0f
- badge: [![protogrid quality](https://protogrid.dev/badge/uk.co.reliness/code-utilities.svg)](https://protogrid.dev/servers/uk.co.reliness/code-utilities)
- Checks run on what our credential-free, read-only probes observe; tools are never called and no code audit is performed.

### Tool changes

_No tool definition changes recorded._

## Remotes

- https://ukdata.reliness.co.uk/mcp/code-utilities (streamable-http, auth none, reachable true, uptime30d 1)

## Packages

_none_

## Tools (32)

- `binary_addition`: Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)
- `binary_search`: Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)
- `can_attend_meetings`: Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, false otherwise. (cost: 1 credit)
- `count_bits`: Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)
- `find_duplicate_number`: Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)
- `find_equilibrium_index`: Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost: 1 credit)
- `find_first_non_repeating_char`: Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)
- `find_kth_smallest`: Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)
- `find_longest_word`: Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit)
- `find_majority_element`: Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null otherwise. (cost: 1 credit)
- `find_max_subarray_sum`: Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)
- `find_minimum_rotated_sorted_array`: Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (cost: 1 credit)
- `find_missing_number`: Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit)
- `find_next_greater_element`: For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)
- `find_n_largest`: Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)
- `find_pairs_with_sum`: Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)
- `find_peak_element`: Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit)
- `flatten_list`: Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)
- `is_anagram`: Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit)
- `is_palindrome`: Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)
- `is_perfect_square`: Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)
- `is_power`: Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 credit)
- `is_rotation`: Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, false otherwise. (cost: 1 credit)
- `is_sum_of_cubes`: Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit)
- `is_valid_ip_address`: Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)
- `is_valid_parentheses`: Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol in the correct order. (cost: 1 credit)
- `merge_dictionaries`: Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)
- `merge_sorted_lists`: Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)
- `min_meeting_rooms`: Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)
- `reverse_string`: Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)
- `sort_numbers`: Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)
- `validate_sudoku`: Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherwise. (cost: 1 credit)