Maximum distance between two occurrences of same element

Here given code implementation process.

/*
   Java Program
   Maximum distance between two occurrences of same element
*/
import java.util.HashMap;
public class Distance
{
	// Display given array element
	public void display(int[] arr, int n)
	{
		// iterate the loop through by n
		for (int i = 0; i < n; ++i)
		{
			System.out.print("  " + arr[i]);
		}
		System.out.print("\n");
	}
	// Find max distance between any two similar elements
	public void maxDistance(int[] data, int n)
	{
		// Resultant variable
		int result = 0;
      	int element = 0;
		// Use to collect element occurrence
		HashMap < Integer, Integer > record = new HashMap < Integer, Integer > ();
		// Display given array element
		System.out.print(" Given Array  : ");
		display(data, n);
		// Execute loop through by array size
		for (int i = 0; i < n; ++i)
		{
			if (record.containsKey(data[i]))
			{
				if (result < (i - record.get(data[i])))
				{
                  // Get new result
					result = i - record.get(data[i]);
                  	element = data[i];
				}
			}
			else
			{
				record.put(data[i], i);
			}
		}
		// Display calculated result
		System.out.print("\n Element is "+element+" and Distance is : " + result);
	}
	public static void main(String[] arg)
	{
		Distance task = new Distance();
		// Define array of integer elements
		int[] data = {
			3 , 5 , 7 , 9 , 4 , 3 , 5 , 7 , 4 , 7 , 9 , 5 , 3 , 9 , 5 , 6
		};
		// Get the number of elements
		int n = data.length;
		// test
		task.maxDistance(data, n);
	}
}

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

// Include header file
#include <iostream>
#include <unordered_map>
using namespace std;

/*
   C++ Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	public:
		// Display given array element
		void display(int arr[], int n)
		{
			// iterate the loop through by n
			for (int i = 0; i < n; ++i)
			{
				cout << "  " << arr[i];
			}
			cout << "\n";
		}
	// Find max distance between any two similar elements
	void maxDistance(int data[], int n)
	{
		// Resultant variable
		int result = 0;
		int element = 0;
		// Use to collect element occurrence
		unordered_map < int, int > record ;
		// Display given array element
		cout << " Given Array  : ";
		this->display(data, n);
		// Execute loop through by array size
		for (int i = 0; i < n; ++i)
		{
			if (record.find(data[i]) != record.end())
			{
				if (result < (i - record[data[i]]))
				{
					// Get new result
					result = i - record[data[i]];
					element = data[i];
				}
			}
			else
			{
				record[data[i]] = i;
			}
		}
		// Display calculated result
		cout << "\n Element is " << element << " and Distance is : " << result;
	}
};
int main()
{
	Distance task = Distance();
	// Define array of integer elements
	int data[] = {
		3 , 5 , 7 , 9 , 4 , 3 , 5 , 7 , 4 , 7 , 9 , 5 , 3 , 9 , 5 , 6
	};
	// Get the number of elements
	int n = sizeof(data) / sizeof(data[0]);
	// test
	task.maxDistance(data, n);
	return 0;
}

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

// Include namespace system
using System;
using System.Collections.Generic;
/*
   C# Program
   Maximum distance between two occurrences of same element
*/
public class Distance
{
	// Display given array element
	public void display(int[] arr, int n)
	{
		// iterate the loop through by n
		for (int i = 0; i < n; ++i)
		{
			Console.Write("  " + arr[i]);
		}
		Console.Write("\n");
	}
	// Find max distance between any two similar elements
	public void maxDistance(int[] data, int n)
	{
		// Resultant variable
		int result = 0;
		int element = 0;
		// Use to collect element occurrence
		Dictionary < int, int > record = new Dictionary < int, int > ();
		// Display given array element
		Console.Write(" Given Array  : ");
		display(data, n);
		// Execute loop through by array size
		for (int i = 0; i < n; ++i)
		{
			if (record.ContainsKey(data[i]))
			{
				if (result < (i - record[data[i]]))
				{
					// Get new result
					result = i - record[data[i]];
					element = data[i];
				}
			}
			else
			{
				record.Add(data[i], i);
			}
		}
		// Display calculated result
		Console.Write("\n Element is " + element + " and Distance is : " + result);
	}
	public static void Main(String[] arg)
	{
		Distance task = new Distance();
		// Define array of integer elements
		int[] data = {
			3 , 5 , 7 , 9 , 4 , 3 , 5 , 7 , 4 , 7 , 9 , 5 , 3 , 9 , 5 , 6
		};
		// Get the number of elements
		int n = data.Length;
		// test
		task.maxDistance(data, n);
	}
}

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

<?php
/*
   Php Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	// Display given array element
	public	function display( & $arr, $n)
	{
		// iterate the loop through by n
		for ($i = 0; $i < $n; ++$i)
		{
			echo "  ". $arr[$i];
		}
		echo "\n";
	}
	// Find max distance between any two similar elements
	public	function maxDistance( & $data, $n)
	{
		// Resultant variable
		$result = 0;
		$element = 0;
		// Use to collect element occurrence
		$record = array();
		// Display given array element
		echo " Given Array  : ";
		$this->display($data, $n);
		// Execute loop through by array size
		for ($i = 0; $i < $n; ++$i)
		{
			if (array_key_exists($data[$i], $record))
			{
				if ($result < ($i - $record[$data[$i]]))
				{
					// Get new result
					$result = $i - $record[$data[$i]];
					$element = $data[$i];
				}
			}
			else
			{
				$record[$data[$i]] = $i;
			}
		}
		// Display calculated result
		echo "\n Element is ". $element ." and Distance is : ". $result;
	}
}

function main()
{
	$task = new Distance();
	// Define array of integer elements
	$data = array(3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6);
	// Get the number of elements
	$n = count($data);
	$task->maxDistance($data, $n);
}
main();

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

/*
   Node Js Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	// Display given array element
	display(arr, n)
	{
		// iterate the loop through by n
		for (var i = 0; i < n; ++i)
		{
			process.stdout.write("  " + arr[i]);
		}
		process.stdout.write("\n");
	}
	// Find max distance between any two similar elements
	maxDistance(data, n)
	{
		// Resultant variable
		var result = 0;
		var element = 0;
		// Use to collect element occurrence
		var record = new Map();
		// Display given array element
		process.stdout.write(" Given Array  : ");
		this.display(data, n);
		// Execute loop through by array size
		for (var i = 0; i < n; ++i)
		{
			if (record.has(data[i]))
			{
				if (result < (i - record.get(data[i])))
				{
					// Get new result
					result = i - record.get(data[i]);
					element = data[i];
				}
			}
			else
			{
				record.set(data[i], i);
			}
		}
		// Display calculated result
		process.stdout.write("\n Element is " + element + " and Distance is : " + result);
	}
}

function main()
{
	var task = new Distance();
	// Define array of integer elements
	var data = [3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6];
	// Get the number of elements
	var n = data.length;
	// test
	task.maxDistance(data, n);
}
main();

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

#    Python 3 Program
#    Maximum distance between two occurrences of same element

class Distance :
	#  Display given array element
	def display(self, arr, n) :
		#  iterate the loop through by n
		i = 0
		while (i < n) :
			print("  ", arr[i], end = "")
			i += 1
		
		print(end = "\n")
	
	#  Find max distance between any two similar elements
	def maxDistance(self, data, n) :
		#  Resultant variable
		result = 0
		element = 0
		#  Use to collect element occurrence
		record = dict()
		#  Display given list element
		print(" Given Array  : ", end = "")
		self.display(data, n)
		i = 0
		#  Execute loop through by list size
		while (i < n) :
			if (data[i] in record.keys()) :
				if (result < (i - record.get(data[i]))) :
					#  Get new result
					result = i - record.get(data[i])
					element = data[i]
				
			else :
				record[data[i]] = i
			
			i += 1
		
		#  Display calculated result
		print("\n Element is ", element ," and Distance is : ", result, end = "")
	

def main() :
	task = Distance()
	#  Define list of integer elements
	data = [3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6]
	#  Get the number of elements
	n = len(data)
	#  test
	task.maxDistance(data, n)

if __name__ == "__main__": main()

Output

 Given Array  :    3   5   7   9   4   3   5   7   4   7   9   5   3   9   5   6

 Element is  5  and Distance is :  13

#  Ruby Program
#  Maximum distance between two occurrences of same element

class Distance 
	#  Display given array element
	def display(arr, n) 
		#  iterate the loop through by n
		i = 0
		while (i < n) 
			print("  ", arr[i])
			i += 1
		end

		print("\n")
	end

	#  Find max distance between any two similar elements
	def maxDistance(data, n) 
		#  Resultant variable
		result = 0
		element = 0
		#  Use to collect element occurrence
		record = Hash.new
		#  Display given array element
		print(" Given Array  : ")
		self.display(data, n)
		i = 0
		#  Execute loop through by array size
		while (i < n) 
			if (record.key?(data[i])) 
				if (result < (i - record[data[i]])) 
					#  Get new result
					result = i - record[data[i]]
					element = data[i]
				end
			else 
				record[data[i]] = i
			end

			i += 1
		end

		#  Display calculated result
		print("\n Element is ", element ," and Distance is : ", result)
	end

end

def main() 
	task = Distance.new()
	#  Define array of integer elements
	data = [3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6]
	#  Get the number of elements
	n = data.length
	#  test
	task.maxDistance(data, n)
end

main()

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

import scala.collection.mutable._;
/*
   Scala Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	// Display given array element
	def display(arr: Array[Int], n: Int): Unit = {
		// iterate the loop through by n
		var i: Int = 0;
		while (i < n)
		{
			print("  " + arr(i));
			i += 1;
		}
		print("\n");
	}
	// Find max distance between any two similar elements
	def maxDistance(data: Array[Int], n: Int): Unit = {
		// Resultant variable
		var result: Int = 0;
		var element: Int = 0;
		// Use to collect element occurrence
	
		var record: Map[Int, Int] = Map();
		// Display given array element
		print(" Given Array  : ");
		this.display(data, n);
		var i: Int = 0;
		// Execute loop through by array size
		while (i < n)
		{
			if (record.contains(data(i)))
			{
				if (result < (i - record.get(data(i)).get))
				{
					// Get new result
					result = i - record.get(data(i)).get;
					element = data(i);
				}
			}
			else
			{
				record.addOne(data(i), i);
			}
			i += 1;
		}
		// Display calculated result
		print("\n Element is " + element + " and Distance is : " + result);
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var task: Distance = new Distance();
		// Define array of integer elements
		var data: Array[Int] = Array(3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6);
		// Get the number of elements
		var n: Int = data.length;
		// test
		task.maxDistance(data, n);
	}
}

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

import Foundation
/*
   Swift 4 Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	// Display given array element
	func display(_ arr: [Int], _ n: Int)
	{
		// iterate the loop through by n
		var i: Int = 0;
		while (i < n)
		{
			print("  ", arr[i], terminator: "");
			i += 1;
		}
		print(terminator: "\n");
	}
	// Find max distance between any two similar elements
	func maxDistance(_ data: [Int], _ n: Int)
	{
		// Resultant variable
		var result: Int = 0;
		var element: Int = 0;
		// Use to collect element occurrence
		var record = [Int: Int]();
		// Display given array element
		print(" Given Array  : ", terminator: "");
		self.display(data, n);
		var i: Int = 0;
		// Execute loop through by array size
		while (i < n)
		{
			if (record.keys.contains(data[i]))
			{
				if (result < (i - record[data[i]]!))
				{
					// Get new result
					result = i - record[data[i]]!;
					element = data[i];
				}
			}
			else
			{
				record[data[i]] = i;
			}
			i += 1;
		}
		// Display calculated result
		print("\n Element is ", element ," and Distance is : ", result, terminator: "");
	}
}
func main()
{
	let task: Distance = Distance();
	// Define array of integer elements
	let data: [Int] = [3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6];
	// Get the number of elements
	let n: Int = data.count;
	// test
	task.maxDistance(data, n);
}
main();

Output

 Given Array  :    3   5   7   9   4   3   5   7   4   7   9   5   3   9   5   6

 Element is  5  and Distance is :  13

/*
   Kotlin Program
   Maximum distance between two occurrences of same element
*/
class Distance
{
	// Display given array element
	fun display(arr: Array < Int > , n: Int): Unit
	{
		// iterate the loop through by n
		var i: Int = 0;
		while (i < n)
		{
			print("  " + arr[i]);
			i += 1;
		}
		print("\n");
	}
	// Find max distance between any two similar elements
	fun maxDistance(data: Array < Int > , n: Int): Unit
	{
		// Resultant variable
		var result: Int = 0;
		var element: Int = 0;
		// Use to collect element occurrence
		var record = mutableMapOf<Int, Int>();
		// Display given array element
		print(" Given Array  : ");
		this.display(data, n);
		var i: Int = 0;
		// Execute loop through by array size
		while (i < n)
		{
			if (record.containsKey(data[i]))
			{
				if (result < (i - record.getValue(data[i])))
				{
					// Get new result
					result = i - record.getValue(data[i]);
					element = data[i];
				}
			}
			else
			{
				record.put(data[i], i);
			}
			i += 1;
		}
		// Display calculated result
		print("\n Element is " + element + " and Distance is : " + result);
	}
}
fun main(args: Array < String > ): Unit
{
	var task: Distance = Distance();
	// Define array of integer elements
	var data: Array < Int > = arrayOf(3, 5, 7, 9, 4, 3, 5, 7, 4, 7, 9, 5, 3, 9, 5, 6);
	// Get the number of elements
	var n: Int = data.count();
	// test
	task.maxDistance(data, n);
}

Output

 Given Array  :   3  5  7  9  4  3  5  7  4  7  9  5  3  9  5  6

 Element is 5 and Distance is : 13

« Previous Next »

Hash

Count the occurrence of array elements

Find all subarray with given sum

Sort array elements by frequency

Check if two arrays are identical or not

Sum of unique elements in array

Find if there is a subarray with 0 sum

Find all common elements in two arrays

Find the most repeated element in an array

Find first repeating element in array

Print all subarrays with 0 sum

Find all missing elements of a range

Find the unique elements in array

Check whether given two sets are disjoint or not

Find all distinct divisible pairs in array

Check if array is subset of another array

Find all duplicate subtrees in binary tree

Find K smallest leaf nodes in a given Binary Tree

Largest subarray with equal number of 0s and 1s

Detect cycle in a linked list in linear time

Find union and intersection of two linked lists

Check whether one array is constructed by pair of another array

Find the even product pairs in an array

Sort map by value in ascending order

Find the numbers occurring odd number of times

Group the array elements by occurrence sequence

Find longest subarray with 0 sum

Longest consecutive subsequence

Count distinct elements in every window of given size

Check if two arrays are permutations of each other

Find all distinct symmetric pairs in an array efficiently

Check pair with given product in an array

Find common elements in all rows of a given matrix efficiently

Find pairs with given sum in an array

Convert an array to reduced form

Count substring with equal number of 0s 1s and 2s

Count pairs whose products exist in array

Maximum distance between two occurrences of same element

Find the length of each path in binary tree

Count the pairs of amicable numbers

Check arithmetic progression in array

Find the frequency of characters in a string

Print the characters by frequency

Find the character having kth largest frequency

Top k frequent elements in array

Count of elements which are not at the correct position

Count of anagrams of each string in between two arrays

Print the repeating K digits number in string

Check if K palindromic strings can be formed from a given string

Count the elements having frequency equal to its value

Find uncommon characters of the two strings

Check if rearrange of characters can such that no two adjacent are same

Count of substrings of length K with exactly K distinct characters

Count elements present in first array but not in second

Sum of all even frequency elements in matrix

Sum of all maximum frequency elements in matrix

Sum of all odd frequency elements in an array

Find all odd frequency elements from an Array

Find most occurring node in linked list

Check whether the given matrix is latin square or not

Find the distinct strings present in a given array

Sort array elements using builtin method

Minimum increment operations to make array unique

Find the number of repeated words in a string

Remove duplicate words from string

Change gender words in a given string

Minimum number of deletion required to make two strings anagram

Vertical sum of given binary tree efficiently

Smallest subarray with k distinct numbers

Find the smallest binary digit multiple of given number

Find duplicate elements in given array

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name