Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging
Maintain this server? Claim it
Call this server's tools from your browser. Nothing to install.
Optional. Bearer <key> for more than the free daily allowance; free key from POST https://ukdata.reliness.co.uk/keys
Requests go through mcptry because browsers can't call most MCP servers directly. Header values are sent to the server for that request only and are never stored or logged.
Tool list from our last check. Connect live to refresh it.
Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)
string, required, first binary number as string (e.g., '1010')
string, required, second binary number as string (e.g., '1101')
Pick your client. Values in capitals, like YOUR_TOKEN, are yours to fill in.
Run in a terminal
claude mcp add --transport http code-utilities https://ukdata.reliness.co.uk/mcp/code-utilities
Headers
Authorization (optional, not in the config above): Optional. Bearer <key> for more than the free daily allowance; free key from POST https://ukdata.reliness.co.uk/keysAdds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| a | string | string, required, first binary number as string (e.g., '1010') |
| b | string | string, required, second binary number as string (e.g., '1101') |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"a": {
"type": "string",
"description": "string, required, first binary number as string (e.g., '1010')"
},
"b": {
"type": "string",
"description": "string, required, second binary number as string (e.g., '1101')"
}
}
}Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| arr | any | array of numbers, required, the sorted list to search |
| target | number | string | number, required, the value to find |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"arr": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, the sorted list to search"
},
"target": {
"type": [
"number",
"string"
],
"description": "number, required, the value to find"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| intervals | any | array, required, list of meeting time intervals as [start, end] pairs |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"intervals": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of meeting time intervals as [start, end] pairs"
}
}
}Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| num | string | integer, required, the non-negative integer to analyze |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"num": {
"type": "string",
"description": "integer, required, the non-negative integer to analyze"
}
}
}Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| nums | any | array, required, list of integers containing one duplicate |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of integers containing one duplicate"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| arr | any | array of numbers, required, the input array to search, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"arr": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, the input array to search, no units, no default"
}
}
}Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| s | string | string, required, the input string to search, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"s": {
"type": "string",
"description": "string, required, the input string to search, no units, no default"
}
}
}Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| k | string | integer, required, the position of the desired smallest element (1-indexed) |
| nums | any | array of numbers, required, the list of numbers to search |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"k": {
"type": "string",
"description": "integer, required, the position of the desired smallest element (1-indexed)"
},
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, the list of numbers to search"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| text | string | string, required, the text to search for the longest word |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"text": {
"type": "string",
"description": "string, required, the text to search for the longest word"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| nums | any | array, required, list of integers to search |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of integers to search"
}
}
}Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| nums | any | array of numbers, required, the list of integers to analyze |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, the list of integers to analyze"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| nums | any | array of numbers, required, the rotated sorted array to search, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, the rotated sorted array to search, no units, no default"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| nums | any | array of integers, required, list containing numbers from 0 to n with one missing, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of integers, required, list containing numbers from 0 to n with one missing, no units, no default"
}
}
}Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| n | string | integer, required, number of largest values to find, count, no default |
| nums | any | array, required, list of numeric values, no unit, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"n": {
"type": "string",
"description": "integer, required, number of largest values to find, count, no default"
},
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of numeric values, no unit, no default"
}
}
}For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| nums | any | array of numbers, required, list of numbers to process |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of numbers, required, list of numbers to process"
}
}
}Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| nums | any | array, required, list of integers, no unit, no default |
| target | string | integer, required, target sum value, no unit, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of integers, no unit, no default"
},
"target": {
"type": "string",
"description": "integer, required, target sum value, no unit, no default"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| nums | any | array, required, list of integers to search |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nums": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of integers to search"
}
}
}Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| nested_list | any | array, required, the nested list structure to flatten, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"nested_list": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, the nested list structure to flatten, no units, no default"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| word1 | string | string, required, first word to compare, no units, no default |
| word2 | string | string, required, second word to compare, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"word1": {
"type": "string",
"description": "string, required, first word to compare, no units, no default"
},
"word2": {
"type": "string",
"description": "string, required, second word to compare, no units, no default"
}
}
}Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| text | string | string, required, text to check, no unit, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"text": {
"type": "string",
"description": "string, required, text to check, no unit, no default"
}
}
}Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| num | number | string | number, required, number to check, no unit, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"num": {
"type": [
"number",
"string"
],
"description": "number, required, number to check, no unit, no default"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| num | number | string | number, required, the number to check |
| base | number | string | number, required, the base to test against |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"num": {
"type": [
"number",
"string"
],
"description": "number, required, the number to check"
},
"base": {
"type": [
"number",
"string"
],
"description": "number, required, the base to test against"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| str1 | string | string, required, first string to compare |
| str2 | string | string, required, second string to check if it's a rotation of str1 |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"str1": {
"type": "string",
"description": "string, required, first string to compare"
},
"str2": {
"type": "string",
"description": "string, required, second string to check if it's a rotation of str1"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| num | string | integer, required, the number to check (must be non-negative) |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"num": {
"type": "string",
"description": "integer, required, the number to check (must be non-negative)"
}
}
}Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| ip | string | string, required, the IP address string to validate |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"ip": {
"type": "string",
"description": "string, required, the IP address string to validate"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| s | string | string, required, the input string containing parentheses/brackets/braces to validate, no units, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"s": {
"type": "string",
"description": "string, required, the input string containing parentheses/brackets/braces to validate, no units, no default"
}
}
}Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| dict1 | string | object, required, the first dictionary |
| dict2 | string | object, required, the second dictionary to merge into the first |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"dict1": {
"type": "string",
"description": "object, required, the first dictionary"
},
"dict2": {
"type": "string",
"description": "object, required, the second dictionary to merge into the first"
}
}
}Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| list1 | any | array, required, first sorted list |
| list2 | any | array, required, second sorted list |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"list1": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, first sorted list"
},
"list2": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, second sorted list"
}
}
}Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| intervals | any | array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time] |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"intervals": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time]"
}
}
}Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| text | string | string, required, the text string to reverse |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"text": {
"type": "string",
"description": "string, required, the text string to reverse"
}
}
}Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)
| Argument | Type | Description |
|---|---|---|
| numbers | any | array, required, list of numeric values to sort, no unit, no default |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"numbers": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, list of numeric values to sort, no unit, no default"
}
}
}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)
| Argument | Type | Description |
|---|---|---|
| board | any | array, required, 9x9 2D array representing the Sudoku board with digits 1-9 or empty cells |
{
"type": "object",
"$schema": "http://json-schema.org/draft-07/schema#",
"properties": {
"board": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string"
}
},
{
"type": "string"
}
],
"description": "array, required, 9x9 2D array representing the Sudoku board with digits 1-9 or empty cells"
}
}
}We read every tool's name, description and inputs the way the model will, looking for instructions hidden from you. A clean result means no warning signs, not a guarantee. Scanned Nov 7, 2026.