MCP serveruk.co.reliness/code-utilities
Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging
Overview
Score?
UNRATED 0.089
of what a free look can see, on 5 looks
Looks
6
last 1 day ago
Tools
32
More info
URL
ukdata.reliness.co.uk/mcp/code-utilities
streamable-http
Says it is
code-utilities 1.0.0
protocol 2025-06-18
In the record since
10 days ago
Among servers32,723 with a card
0median 0.547 · this server 0.089 · highest on record 0.8351
Toolsfrom sha256:be31ad6a57…c6cbeb
| Tool | Schema |
|---|---|
| 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) |
input · no output |
| 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) |
input · no output |
| 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: |
input · no output |
| count_bits Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| find_kth_smallest Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| 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 cred |
input · no output |
| find_max_subarray_sum Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| find_n_largest Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| flatten_list Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| is_palindrome Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit) |
input · no output |
| is_perfect_square Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| 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. (co |
input · no output |
| 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) |
input · no output |
| 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) |
input · no output |
| 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. |
input · no output |
| 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) |
input · no output |
| merge_sorted_lists Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit) |
input · no output |
| 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) |
input · no output |
| reverse_string Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit) |
input · no output |
| sort_numbers Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit) |
input · no output |
| 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 |
input · no output |
Verify it yourself
npx teppi-check https://ukdata.reliness.co.uk/mcp/code-utilitiescurl -s https://api.teppi.xyz/v1/trust/mcp/mcs_01M6WVAHWTCV829S6AF0YMGR1S