Problem Description Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word. For a given query word, the spell checker handles two categories of spelling mistakes: Capitalization: If the query matches a word in the wordlist (case-insensitive), then the query word is

Problem Description Given two strings s and t, your goal is to convert s into t in k moves or less. During the ith (1 <= i <= k) move you can: 1) Choose any index j (1-indexed) from s, such that 1 <= j <= s.length and j

Problem Description There is an integer array nums that consists of n unique elements, but you have forgotten it. However, you do remember every pair of adjacent elements in nums. You are given a 2D integer array adjacentPairs of size n - 1 where each adjacentPairs[i] = [ui, vi] indicates

Problem Description Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) such that a * b = c * d where a, b, c, and d are elements of nums, and a != b != c != d. Problem Explanation what is tuple? A group of immutable elements