Maximum Repeating Substring
For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum
Read more →Welcome to Hazrat Ali, Problem Solving Website “At Hazrat Ali, we provide a platform for aspiring problem solvers and developers to sharpen their coding and algorithmic skills. Whether you’re a beginner or an advanced coder, our wide range of challenges and resources will help you grow. From mastering data structures and algorithms to participating in competitive coding contests, we offer tools and a community that supports your journey in programming. Explore our curated problems, get involved in discussions, and start Solving problems that will elevate your coding expertise. Join us today and start your problem-Solving adventure!”
For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum
Read more →There is an m x n matrix that is initialized to all 0's. There is also a 2D array indices where each indices[i] = [ri, ci] represents a 0-indexed location to pe
Read more →Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Read more →You are given a string sentence that consist of words separated by spaces. Each word consists of lowercase and uppercase letters only.
Read more →Given a string s, return the string after replacing every uppercase letter with the same lowercase letter.
Read more →Write a function that reverses a string. The input string is given as an array of characters s.
Read more →