All Topics

 C Language C++ Language Greedy Algorithm Hashing Java Language Linked List Python Queue Stack String Sorting Searching Recursion Backtracking Dynamic Programming Graph Theory Bit Manipulation Mathematics Sliding Window Technique Divide And Conquer Matrix Manipulation Two Pointers Binary Tree

Topic: Divide-and-conquer-question / Level: Beginner






Most Visited

 Given an array, find the maximum sum of a subarray that has a given sum using divide and conquer. Given a string, find the first non-repeating character using divide and conquer. Implement a function to find the first non-repeating character in a string using divide and conquer. Write a function to find the minimum window substring that contains all characters of another string using divide and conquer. Write a function to find the longest common prefix among an array of strings using divide and conquer. Write a function to find the longest common prefix among an array of strings using divide and conquer. Write a function that generates all possible combinations of a given string using divide and conquer. Given an integer n, find the number of ways to express it as a sum of positive integers using divide and conquer. Given a string, find the longest valid parentheses substring using divide and conquer. Write a function that counts the number of inversions in an array using the merge sort technique. Given an array, find the number of ways to split it into two subsets such that their sums are equal using divide and conquer. Write a function to find the longest increasing subsequence of a string using divide and conquer. Implement a function to find the longest alternating subsequence in a string using divide and conquer. Write a function to find the longest increasing subsequence in a sequence of numbers using divide and conquer. Given a binary search tree, find the kth largest element using divide and conquer.