Skip to content

You are given an array of N integers. Return maximum value for all 1 … #30

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions src/main/scala/Array/MaximumAbsoluteDifference.scala
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
package Array

object MaximumAbsoluteDifference {

/**
* You are given an array of N integers. Return maximum value for all 1 ≤ i, j ≤ N,
which is defined as |array[i] - array[j]| + |i - j|, where |x| denotes absolute value of x.
*
* @param Array[Int]
* @return
*/

def maxAbsDiff(array : Array[Int]): Int = {

var maximum_sum = Int.MinValue
var maximum_difference = Int.MinValue
var minimum_sum = Int.MaxValue
var minimum_difference = Int.MaxValue
for (i <- array.indices) {
val value = array(i)
sum(i) = value + i
difference(i) = ai - i
}

Math.max(
sum.max - sum.min,
Math.abs(difference.max - difference.min)
)
}
}
21 changes: 21 additions & 0 deletions src/main/scala/Array/MinimumStepInInfiniteGrid.scala
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
package Array

object MinimumStepInInfiniteGrid {

/**
* Method returns minimum numbers of steps
*
* @param Array[Int], @param Array[Int]
* @return
*/

def minimumSteps(x_coordinate: Array[Int], y_coordinate: Array[Int]): Int = {
var steps = 0
for (i <- 1 until x.coordinate.length) {
val x_direction = math.abs(x_coordinate(i) - x_coordinate(i - 1))
val y_direction = math.abs(y_coordinate(i) - y_coordinate(i - 1))
steps = steps + math.max(x_direction, y_direction)
}
steps
}
}
15 changes: 15 additions & 0 deletions src/test/scala/Array/MinimumStepInInfiniteGridSpec.scala
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
package Array

import org.scalatest.FlatSpec

class MinimumStepInInfiniteGridSpec {

"Minimum Step In Infinite Grid should return the minimum number of steps taken to follow the given coordinates" in {
assert(MinimumStepInInfiniteGrid.minimumSteps(Array(0, 1, 1), Array(0, 1, 2)) === 2
}

"Minimum Step In Infinite Grid should return the minimum number of steps taken to follow the given coordinates" in {
assert(MinimumStepInInfiniteGrid.minimumSteps(Array(0, 1, 7, 9), Array(1, 1, 1, 6)) === 12
}

}