{"id":"uk.co.reliness/code-utilities","slug":"uk-co-reliness-code-utilities","title":"UK Data: Code utilities","description":"Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging","version":"1.5.0","publisher":{"kind":"domain","id":"reliness.co.uk","label":"reliness.co.uk","url":"https://reliness.co.uk"},"website":"https://ukdata.reliness.co.uk","repository":"","remotes":[{"type":"streamable-http","url":"https://ukdata.reliness.co.uk/mcp/code-utilities","headers":[{"description":"Optional. Bearer <key> for more than the free daily allowance; free key from POST https://ukdata.reliness.co.uk/keys","isSecret":true,"name":"Authorization"}]}],"packages":[],"published":"2026-11-07","updated":"2026-11-07","status":"online","auth":"","latency_ms":2245,"checked":"2026-11-19","uptime":100,"checks":3,"tools":[{"name":"is_valid_ip_address","title":"is valid ip address","description":"Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)","read_only":true},{"name":"find_max_subarray_sum","title":"find max subarray sum","description":"Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)","read_only":true},{"name":"merge_dictionaries","title":"merge dictionaries","description":"Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)","read_only":true},{"name":"find_kth_smallest","title":"find kth smallest","description":"Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)","read_only":true},{"name":"count_bits","title":"count bits","description":"Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)","read_only":true},{"name":"binary_search","title":"binary search","description":"Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)","read_only":true},{"name":"reverse_string","title":"reverse string","description":"Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)","read_only":true},{"name":"min_meeting_rooms","title":"min meeting rooms","description":"Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)","read_only":true},{"name":"find_next_greater_element","title":"find next greater element","description":"For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)","read_only":true},{"name":"binary_addition","title":"binary addition","description":"Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)","read_only":true},{"name":"is_palindrome","title":"is palindrome","description":"Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)","read_only":true},{"name":"sort_numbers","title":"sort numbers","description":"Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)","read_only":true},{"name":"find_pairs_with_sum","title":"find pairs with sum","description":"Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)","read_only":true},{"name":"is_perfect_square","title":"is perfect square","description":"Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)","read_only":true},{"name":"find_n_largest","title":"find n largest","description":"Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)","read_only":true},{"name":"is_valid_parentheses","title":"is valid parentheses","description":"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)","read_only":true},{"name":"find_minimum_rotated_sorted_array","title":"find minimum rotated sorted array","description":"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)","read_only":true},{"name":"flatten_list","title":"flatten list","description":"Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)","read_only":true},{"name":"is_anagram","title":"is anagram","description":"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)","read_only":true},{"name":"find_first_non_repeating_char","title":"find first non repeating char","description":"Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)","read_only":true},{"name":"find_equilibrium_index","title":"find equilibrium index","description":"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)","read_only":true},{"name":"find_missing_number","title":"find missing number","description":"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)","read_only":true},{"name":"is_power","title":"is power","description":"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)","read_only":true},{"name":"find_longest_word","title":"find longest word","description":"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)","read_only":true},{"name":"can_attend_meetings","title":"can attend meetings","description":"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)","read_only":true},{"name":"is_rotation","title":"is rotation","description":"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)","read_only":true},{"name":"find_peak_element","title":"find peak element","description":"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)","read_only":true},{"name":"find_duplicate_number","title":"find duplicate number","description":"Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)","read_only":true},{"name":"is_sum_of_cubes","title":"is sum of cubes","description":"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)","read_only":true},{"name":"validate_sudoku","title":"validate sudoku","description":"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)","read_only":true},{"name":"find_majority_element","title":"find majority element","description":"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)","read_only":true},{"name":"merge_sorted_lists","title":"merge sorted lists","description":"Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)","read_only":true}],"server_info":{"name":"code-utilities","version":"1.0.0"},"category":"developer","tags":["web-search","productivity"],"kind":"remote","source":"registry","submitted":{},"first_party":true,"domain_rank":null,"score":100,"indexable":true,"first_seen":"2026-11-07","stars":0,"badges":["new"],"sponsor":null,"page":"https://agentsindex.org/agents/uk-co-reliness-code-utilities/"}