---
title: "Discussion on \"(7) Binary Search: Workout\" | Hashnode"
description: "Discussion on \"(7) Binary Search: Workout\". Question Link\nDifficulty: Hard\nProblem Statement: Given an array, you need to minimize the maximum difference between two adjacent elements.\nApproach: In the ok function mid is minimized maximum value which we want to put between two adjacent arrays...."
url: "https://hashnode.com/posts/7-binary-search-workout/61d846714b84101d2c3ee329"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [(7) Binary Search: Workout](https://programminguides.hashnode.dev/7-binary-search-workout?utm_source=hashnode&utm_medium=feed)

Question Link Difficulty: Hard Problem Statement: Given an array, you need to minimize the maximum difference between two adjacent elements. Approach: In the ok function mid is minimized maximum value which we want to put between two adjacent arrays....

Jan 7, 2022 · 2 min read · programminguides.hashnode.dev  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Mohammad Arsalan](https://hashnode.com/@mohdarsalan)

@mohdarsalan · India

  
[View profile](https://hashnode.com/@mohdarsalan)

Web Developer

I am Computer Science Graduate and Web Developer.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.