Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

To find the median of two sorted arrays, merge them and calculate the middle element(s). This includes arrays of unequal sizes, as shown in the examples provided. For even-length arrays, the median is the average of the two middle elements. Example inputs include a[] = [-5, 3, 6, 12, 15] and b[] = [-12, -10, -6, -3, 4, 10] with a median of 3.&nbsp; Read the full article for detailed solutions <a href="https://www.geeksforgeeks.org/median-of-two-sorted-arrays-of-different-sizes/">here</a>

Median of two Sorted Array

To find the minimum days required to create m bouquets with k adjacent flowers, we can use two approaches: Linear Search and Binary Search. The linear search approach iterates through all possible days, checking if m bouquets can be created by picking k adjacent flowers. The binary search approach optimizes the solution by narrowing down the search space and checking if it's possible to make m bouquets within mid days. If not possible, it adjusts the search range. Both methods ensure the minimum days are found for making the required bouquets.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/minimum-days-to-make-m-bouquets/">here</a>.

Minimum days to make M bouquets

To find the minimum number of bananas Koko must eat per hour, we can use two approaches. The Naive Approach uses a linear search to evaluate each possible speed and find the minimum speed that allows Koko to finish the piles within k hours. The Binary Search Approach optimizes the search by narrowing down the range of possible speeds. Both methods calculate the time needed to finish the bananas and return the optimal eating speed. These approaches ensure that Koko finishes all piles in the given time.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/koko-eating-bananas/">here</a>.

Koko Eating Bananas

To find the square root of a positive integer n, we can use different approaches. The Naive Approach involves using a loop to find the largest integer whose square is less than or equal to n. The Binary Search Approach optimizes this by using a binary search algorithm. Alternatively, we can use Built-In Functions like sqrt() for faster results. Another method uses a Mathematical Formula for calculating square roots. These methods help find the floor value of the square root efficiently.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/square-root-of-an-integer/">here</a>.

Square root of an integer

The task is to find the bitonic point, or the maximum value, in an array that first increases and then decreases. A Naive Approach using linear search can find the maximum by iterating through the array. The Expected Approach uses Binary Search to efficiently find the maximum element in O(log n) time. The mid element is compared with its neighbors to determine whether to search left or right. The binary search approach ensures optimal performance in large arrays.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/find-the-maximum-element-in-an-array-which-is-first-increasing-and-then-decreasing/">here</a>.

Bitonic Point – Maximum in Increasing Decreasing Array

The task is to find the lower bound of a given target in a sorted array. The lower bound is the smallest index where the element is greater than or equal to the target. Two approaches are provided: a Naive Approach using linear search and an Expected Approach using binary search for optimal performance. Binary search offers a time complexity of O(log n). The result is the index where the target can be inserted or found.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/implement-lower-bound/">here</a>.

Implement Lower Bound

The task is to find the k-th missing positive number from a sorted array of distinct integers. We explore three approaches: Naive Approach using a hash set, Better Approach using index comparison, and Expected Approach using binary search. The binary search method offers the most efficient solution with a time complexity of O(log n). The goal is to efficiently determine the missing number in the sequence.For more detail information, Read the full article <a href="https://www.geeksforgeeks.org/k-th-missing-element-in-sorted-array/">here</a>.

Kth Missing Positive Number

The problem involves allocating k students books from the array arr[] such that the maximum number of pages assigned to any student is minimized. We explore two approaches: a Naive Approach using iteration and an Expected Approach with binary search. The binary search method optimizes the process, achieving better efficiency. The task is to return the minimum maximum number of pages or -1 if allocation is not possible.For more information, Read the full article <a href="https://www.geeksforgeeks.org/allocate-minimum-number-pages/">here</a>.

Allocate Minimum Pages

This problem involves placing k aggressive cows in stalls[] such that the minimum distance between any two cows is maximized. The task is to determine the maximum possible minimum distance between the cows. We explore two approaches: a Naive Approach using iteration and an Expected Approach with binary search. The binary search approach is more efficient, reducing time complexity to O(n * log(MAX - MIN)).&nbsp; Check out the full solution and explanation in the article. Read the full article <a href="https://www.geeksforgeeks.org/assign-stalls-to-k-cows-to-maximize-the-minimum-distance-between-them/">here</a>.

Aggressive Cows

Find the k-th element in the merged sorted array formed from two sorted arrays. The task involves efficiently identifying the k-th smallest element without fully merging the arrays. Multiple methods can be used, including sorting, priority queue, optimized merge, and binary search. Each approach has different time and space complexities.&nbsp; Discover more on how to implement these techniques with our detailed guide. <a href="https://www.geeksforgeeks.org/k-th-element-two-sorted-arrays/">Read the full article here</a>.&nbsp;

K-th Element of Merged Two Sorted Arrays

Given an array where no two adjacent elements are the same, the task is to find the index of a peak element. A peak element is strictly greater than its adjacent elements. There are two approaches: using linear search with O(n) time complexity and using binary search with O(log n) time complexity. Binary search is more efficient as it reduces the search space in half with each iteration.For more information, Read the full article <a href="https://www.geeksforgeeks.org/find-a-peak-in-a-given-array/">here</a>.

Find Peak Element in Array

Given a sorted and rotated array of distinct elements, the task is to find the index of a given key. The solution can be approached using three methods: linear search, binary search twice, and a single binary search. The binary search methods optimize the process by reducing time complexity to O(log n). The process involves finding the pivot and applying binary search to the sorted subarray.For more information, Read the full article <a href="https://www.geeksforgeeks.org/search-an-element-in-a-sorted-and-pivoted-array/">here</a>.

Search in a Sorted and Rotated Array