UK Data: Code utilities

它能帮你做什么

我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。

• 连接方式: 在云端运行
• 传输方式: Streamable HTTP
• 分类: 开发者工具
• 你需要填写：Authorization

安装

选择你使用的 AI 应用，然后复制设置。

你需要

• 在云端运行无需安装任何东西，通过互联网连接

你用的是哪个应用？

claude mcp add --transport http code-utilities https://ukdata.reliness.co.uk/mcp/code-utilities --header 'Authorization: your-value'

{
  "mcpServers": {
    "code-utilities": {
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
      "headers": {
        "Authorization": "your-value"
      }
    }
  }
}

{
  "servers": {
    "code-utilities": {
      "type": "http",
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
      "headers": {
        "Authorization": "your-value"
      }
    }
  }
}

你的选择通过 Cookie 保存在这台设备上，无需账户。

需要你填写的值

• Authorization 机密 HTTP header
  Optional. Bearer for more than the free daily allowance; free key from POST https://ukdata.reliness.co.uk/keys

这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同，请以 README 为准。

它能做什么

工具名称和描述与服务器在 2026年11月7日 报告的完全一致。这些内容由作者撰写，不是我们写的；我们以纯文本形式显示。

• 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)

• find_max_subarray_sum

  Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (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)

• find_kth_smallest

  Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (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)

• 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)

• reverse_string

  Reverses the order of characters in a given string, returning the string backwards. (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)

• 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)

• 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)

• is_palindrome

  Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)

• sort_numbers

  Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (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)

• is_perfect_square

  Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)

• find_n_largest

  Finds the n largest numbers from a list and returns them in descending order. (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)

• 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)

• 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)

• 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_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_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)

• 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)

• 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)

• 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)

• 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)

• 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)

• 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)

• 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)

• 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)

• 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)

• merge_sorted_lists

  Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)

基础检查i

我们检查的是任何人都能看到的信息；我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月8日

• ! 注意

  作者与仓库一致

  注册中心没有列出源代码仓库，因此无法将发布者（reliness.co.uk）与代码对应起来

• … 尚未检查

  仍在维护

  我们还没有从 GitHub 读取这个仓库

• … 尚未检查

  有许可证

  我们还没有从 GitHub 读取这个仓库

• ✓ 通过

  端点有响应

  在 32 毫秒内响应（HTTP 200）

• – 不适用

  使用 OAuth 登录

  无需登录

• ✓ 通过

  工具描述中没有隐藏指令

  已读取 32 个工具描述，未发现针对 AI 的隐藏指令

与“开发者工具”中的其他服务器比较i

• 星标数多于此分类中其他 5135 个服务器的 0%
• 发布到注册中心的时间比此分类中其他 5135 个服务器的 93% 更新
• 基础检查结果等于或优于此分类中其他 5135 个服务器的 23%

与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时，星标数才计入。

替代选择

同一分类中其他作者的服务器，按星标数排序。

如何看卡片：↓ 每周下载量i★ GitHub 星标i三大支柱：评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i

作者的 README

仓库中没有找到 README