Merge k Sorted Lists LeetCode Solution
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.
divide and conquer
Majority Element LeetCode Solution
Given an array nums of size n, return the majority element. The majority element is the element that appears more than [n / 2] times. You may assume that the majority element always exists in the array.
Median of Two Sorted Arrays LeetCode Solution
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
Divide and Conquer Algorithms
Here, We will discuss about divide and conquer algorithms, their strategy, pros and cons of divide and conquer, applications of divide and conquer algorithm. What is Divide and Conquer Algorithm ? Some problems failed to provide optimal solutions. Among those problems, some are easily solved by using the Divide and Conquer technique. Divide and Conquer …
Merge Sort
Here, We will discuss about Merge Sort in C, their algorithm, implementation code in C, time and space complexity, and their applications. What is Merge Sort? Merge Sort is a divide and conquer algorithms based on the idea of breaking down a list into several sub-lists. The algorithm starts breaking down a list into sub-lists …
Quick Sort
Here, We will discuss about Quick sort in C, their algorithm, implementation in C, time & space complexity and their applications. What is Quick Sort? Quick Sort is one of the famous comparison-based sorting algorithms based on divide and conquers algorithmic technique. It uses recursive calls for sorting the element. The algorithm starts by picking …