Topic: divide-and-conquer-problem / Level: intermediate

• 1951. Write a divide and conquer solution to count the number of distinct palindromic substrings in a string.
• 1952. Use divide and conquer to solve the problem of finding the maximum sum of non-adjacent elements in an array.
• 1953. Implement a divide and conquer algorithm to find the longest increasing subsequence in a circular array.
• 1954. Write a divide and conquer solution to find the first missing positive integer in an unsorted array.
• 1955. Use divide and conquer to solve the problem of finding the longest valid parentheses substring.
• 1956. Implement a divide and conquer approach to count the number of unique combinations that can sum to a target using a set of integers.
• 1957. Write a divide and conquer algorithm to find the maximum area rectangle that can fit inside a binary matrix.
• 1958. Use divide and conquer to solve the problem of counting the number of unique characters in a string.
• 1959. Implement a divide and conquer solution to find the longest palindromic substring in a string.
• 1960. Write a divide and conquer algorithm to solve the problem of counting the number of valid arrangements of parentheses for n pairs.
• 1961. Use divide and conquer to find the maximum profit from stock trading given a series of prices.
• 1962. Implement a divide and conquer approach to count the number of distinct paths from the top-left to the bottom-right of a grid with obstacles.
• 1963. Write a divide and conquer solution to find the longest common substring among multiple strings.
• 1964. Use divide and conquer to solve the problem of finding the maximum size square sub-matrix that contains all 1s.
• 1965. Implement a divide and conquer algorithm to find the longest increasing path in a matrix.
• 1966. Write a divide and conquer solution to count the number of valid anagrams that can be formed from a given string.
• 1967. Use divide and conquer to find the maximum product of three numbers in an array.
• 1968. Implement a divide and conquer approach to find the longest common prefix among an array of strings.
• 1969. Write a divide and conquer algorithm to solve the problem of finding the minimum height of a binary search tree given a set of keys.
• 1970. Use divide and conquer to find the smallest missing number in a sorted array.
• 1971. Implement a divide and conquer solution to find the longest palindromic substring in a rotated string.
• 1972. Write a divide and conquer algorithm to count the number of unique paths in a grid with blocked cells.
• 1973. Use divide and conquer to solve the problem of finding the longest increasing subsequence of length k in an array.
• 1974. Implement a divide and conquer approach to find the maximum area of a rectangle formed by heights in a histogram.
• 1975. Write a divide and conquer solution to find the maximum sum of a contiguous subarray with at least one negative number.
• 1976. Use divide and conquer to count the number of valid parentheses combinations given n pairs.
• 1977. Implement a divide and conquer algorithm to find the first unique character in a string.
• 1978. Write a divide and conquer solution to find the total number of unique paths in a grid with obstacles.
• 1979. Use divide and conquer to find the maximum profit from buying and selling stock once.
• 1980. Implement a divide and conquer approach to count the number of palindromic substrings in a string.
• 1981. Write a divide and conquer solution to find the longest common subsequence of two strings.
• 1982. Use divide and conquer to solve the problem of finding the maximum sum rectangle in a binary matrix.
• 1983. Implement a divide and conquer algorithm to find the longest increasing subsequence in a rotated sorted array.
• 1984. Write a divide and conquer solution to find the number of unique characters in a string.
• 1985. Use divide and conquer to solve the problem of finding the longest path in a binary tree.
• 1986. Implement a divide and conquer approach to find the longest palindromic substring in a string.
• 1987. Write a divide and conquer algorithm to solve the problem of counting the number of unique paths from the top left to the bottom right of a grid.
• 1988. Use divide and conquer to find the longest increasing path in a matrix.
• 1989. Implement a divide and conquer solution to find the maximum product of two numbers in two different arrays.
• 1990. Write a divide and conquer approach to count the number of valid configurations for n queens on an n×n chessboard.
• 1991. Use divide and conquer to find the maximum area rectangle in a binary matrix.
• 1992. Implement a divide and conquer solution to find the longest valid parentheses substring in a string.
• 1993. Write a divide and conquer algorithm to count the number of palindromic substrings in a string.
• 1994. Use divide and conquer to solve the problem of counting the number of unique paths in a grid with obstacles.
• 1995. Implement a divide and conquer approach to find the longest increasing subsequence in a rotated sorted array.
• 1996. Write a divide and conquer solution to find the longest substring without repeating characters in a string.
• 1997. Use divide and conquer to solve the problem of finding the maximum product of three numbers in an array.
• 1998. Implement a divide and conquer algorithm to find the number of ways to climb a staircase with 1, 2, or 3 steps.
• 1999. Write a divide and conquer solution to find the longest common prefix among a list of strings.
• 2000. Use divide and conquer to solve the problem of finding the longest palindromic substring in a string.

• More Levels

• Beginner
• Advanced