uk.co.reliness/code-utilities
up checked
Unclaimed · Unverified
Agent searches it appeared in, last 30 days: 0. Run this server? Claim the listing: verified label, uptime alerts and analytics.
Publisher-provided title
UK Data: Code utilities
Publisher-provided description
Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging
Summary by lookupd
Runs deterministic string, number and list routines such as palindrome checks, sorting, searching, validation and merging.
Install
Claude Code, remote (streamable-http)
claude mcp add --transport http code-utilities https://ukdata.reliness.co.uk/mcp/code-utilities
Codex, remote (streamable-http)
codex mcp add code-utilities --url https://ukdata.reliness.co.uk/mcp/code-utilities
Cursor, remote (streamable-http) → .cursor/mcp.json
{
"mcpServers": {
"code-utilities": {
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
}
}
}Other clients: docs. Or tell your agent: Set up lookupd for me: read https://lookupd.com/agent.md and follow it.
Tools (showing 30 of 32)
Publisher-provided text
is_valid_ip_addressValidates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)find_max_subarray_sumFinds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)merge_dictionariesMerges 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_smallestFinds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)count_bitsCounts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)binary_searchPerforms binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)reverse_stringReverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)min_meeting_roomsFinds 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_elementFor each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)binary_additionAdds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)is_palindromeChecks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)sort_numbersSorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)find_pairs_with_sumFinds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)is_perfect_squareChecks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)find_n_largestFinds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)is_valid_parenthesesChecks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol ifind_minimum_rotated_sorted_arrayFinds 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. (cflatten_listFlattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)is_anagramChecks 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_charFinds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)find_equilibrium_indexFinds 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. (costfind_missing_numberFinds 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_powerChecks 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: 1find_longest_wordFinds 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_meetingsDetermines 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, falsis_rotationChecks 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,find_peak_elementFinds 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_numberFinds 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_cubesChecks 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_sudokuChecks 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 otherw
Details
- Version: 1.5.0
- Transports: streamable-http
- Uptime (7 days): 100%
- Median latency: 307 ms
- First indexed:
- Last seen in registry:
- Website: https://ukdata.reliness.co.uk
Badge for your README
Shows this live status and links here; updates hourly.
[](https://lookupd.com/servers/uk.co.reliness/code-utilities)
- 62092 servers
- Last crawl: 2026-11-11T17:17:22.074Z
- API base:
https://api.lookupd.com - MCP URL:
https://api.lookupd.com/mcp