New Self New Life
No Result
View All Result
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices
New Self New Life
No Result
View All Result
Home Softwares

Minimize operations to make all the elements of given Subarrays distinct

by admin
3 years ago
in Softwares
Best Coding Practices For Rest API Design
Share on FacebookShare on Twitter


Given an arr[] of optimistic integers and begin[] and finish[] arrays of size L, Which comprises the beginning and finish indexes of L variety of non-intersecting sub-arrays as a begin[i] and finish[i]  for all (1 ≤ i ≤ L). An operation is outlined as under: 

  • Choose an ordered steady or non – steady a part of the sub-array after which add an integer let’s say A to the entire parts of the chosen half.

Then, the duty is to output the minimal quantity of given operations required to make all the weather of all given non – intersecting sub-arrays distinct.

Notice: If a couple of sub-arrays comprises the identical aspect, It doesn’t matter. Simply every sub-array ought to comprise distinct parts in itself.

Examples:

Enter: arr[] = {2, 2, 1, 2, 3}, begin[] = {1, 3}, finish[] = {2, 5}               
Output: 1
Rationalization: First sub-array : [start[1], finish[1]] = {2, 2}.
Second sub-array : [start[3], finish[5]] = {1, 2, 3}.
In First sub-array selected sub-sequence from index 1 to 1 as {2} and plus any integer random integer let say 1.Then, First sub-array = {3, 2}. Now, each sub-array comprises distinct parts in itself. Whole variety of required operation are 1.

Enter: arr[] = {1, 2, 3, 3, 4, 5}, begin[] = {1, 4}, finish[] = {3, 6}
Output: 0
Rationalization: It may be verified that sub-arrays {1, 2, 3} and {3, 4, 5} each are distinct in itself. Subsequently, whole variety of required operations are 0.

Method: Implement the thought under to resolve the issue

Making all the weather distinct in a sub-array by given operation solely relies upon upon the utmost frequency in an sub-array, If we transformed excessive frequent aspect in distinct type then remainder of the frequencies lower than max frequency might be make distinct concurrently. For extra readability see the  idea of strategy.Receive the utmost frequency in every sub-array and apply the algorithm offered under.

Idea of strategy:

Suppose our sub-array A[] is = {2, 2, 2, 2, 2, 2, 2, 2, 2, 2}. Highest frequency is 10 right here.

First operation: Selected ordered sub-sequence from index 6 to 10 and add any integer let say 1 to all parts in sub-sequence. Then,   A[] = {2, 2, 2, 2, 2, 3, 3, 3, 3, 3}. Highest frequency is 5 until right here. 

Second Operation: Selected ordered sub-sequence from index 3 to five and eight to 10 add any integer let say 2 to all parts in sub-sequence. Then,  A[] = {2, 2, 4, 4, 4, 3, 3, 5, 5, 5}. Highest frequency is 3 until right here.

Third Operation: Selected ordered sub-sequence from index 4 to five and 9 to 10 add any integer let say 3 to all parts in sub-sequence. Then,  A[] = {2, 2, 4, 7, 7, 3, 3, 5, 8, 8}

Fourth Operation: Selected ordered sub-sequence of indices : {1, 4, 6, 9}  add any integer let say 10 to all parts in sub-sequence. Then,  A[] = {12, 2, 4, 17, 7, 13, 3, 5, 18, 8}

Thus, Solely 4 operation are required to transform into distinct parts. At second operation we are able to see the each 2 and three aspect has 5 frequency and we efficiently convert them into distinct parts. This provides us concept that If we attempt to make max frequent aspect distinct, Then remainder of the weather having frequency lower than or equal to max frequency might be transformed into distinct concurrently.    

In above instance, It may be clearly seen that, At every operation we’re changing the precisely half of the parts, If worth of max_frequency is even at that present operation in any other case we’re changing (max_frequency+1)/2 parts in addition to we’re decreasing the worth of max_frequency in the identical method.Thus we are able to conclude the under offered algorithm to resolve the issue.

Algorithm to resolve the issue:

      1. Create a variable let’s say min_operations to retailer whole variety of minimal operations required for all              sub-arrays.

      2. For Every given sub-array observe the steps under:

  •  Depend frequency of every aspect and retailer them in Hash-Map.
  • Traverse the Hash-Map to acquire most frequency in a variable let’s say max_frequency.
  • Create and initialize counter variable to zero.
  • Apply the under algorithm for acquiring minimal variety of operations required.   

            whereas(max_frequency > 1)
              {
                      if (isEven(max_frequency))
                       {
                             max_frequency/=2;
                        }
                      else
                       {
                             max_frequency = (max_frequency+1)/2;
                       }
                      counter++;
             }

  • On finishing the loop add worth of counter variable in min_operations.

      3. After apply above algorithm on every given sub-array print the worth of min_operations.  

Beneath is the code to implement the strategy:

Java

  

import java.io.*;

import java.lang.*;

import java.util.*;

  

class GFG {

    

    public static void essential(String args[])

    {

  

        

        int[] arr = { 2, 2, 2, 2, 2, 3, 3, 3, 3, 3 };

  

        

        

        int[] begin = { 1, 6 };

  

        

        

        int[] finish = { 5, 10 };

  

        

        

        int min_operations = 0;

  

        

        

        for (int i = 0; i < begin.size; i++) {

  

            

            int start_index = begin[i];

  

            

            int end_index = finish[i];

  

            

            

            HashMap<Integer, Integer> map = new HashMap<>();

  

            

            

            for (int j = start_index - 1; j < end_index;

                 j++) {

  

                

                

                map.put(arr[j], map.get(arr[j]) == null

                                    ? 1

                                    : map.get(arr[j]) + 1);

            }

  

            

            

            int max_frequency = 0;

  

            

            for (Map.Entry<Integer, Integer> set :

                 map.entrySet()) {

  

                

                

                max_frequency

                    = set.getValue() > max_frequency

                          ? set.getValue()

                          : max_frequency;

            }

  

            

            

            whereas (max_frequency > 1) {

  

                

                max_frequency

                    = max_frequency % 2 == 0

                          ? max_frequency / 2

                          : (max_frequency + 1) / 2;

  

                

                

                min_operations++;

            }

        }

  

        

        

        System.out.println(min_operations);

    }

}

Time Complexity: O(N)
Auxiliary House: O(N) 



Source link

Tags: DistinctElementsMinimizeOperationsSubarrays
Previous Post

Olivia Wilde and Harry Styles ‘thriving’ amid former nanny’s claims

Next Post

Zuma says Ramaphosa has suspended the Public Protector while she is investigating him

Related Posts

Smart software replaces expensive sensors for glass wall detection with 96% accuracy
Softwares

Smart software replaces expensive sensors for glass wall detection with 96% accuracy

by admin
June 1, 2025
User Guide For UnoPim PDF Generator
Softwares

User Guide For UnoPim PDF Generator

by admin
May 31, 2025
Infragistics Ultimate 25.1 includes updates across several of its UI toolkit components
Softwares

Infragistics Ultimate 25.1 includes updates across several of its UI toolkit components

by admin
May 29, 2025
Qt bridges the language barrier gap
Softwares

Qt bridges the language barrier gap

by admin
May 28, 2025
Find the Best Rust Software Developers for Your Project
Softwares

Find the Best Rust Software Developers for Your Project

by admin
May 26, 2025
Next Post
Zuma says Ramaphosa has suspended the Public Protector while she is investigating him

Zuma says Ramaphosa has suspended the Public Protector while she is investigating him

Anthropologie Sale: Get a $68 Top for Just $6 & More 91% Off Deals

Anthropologie Sale: Get a $68 Top for Just $6 & More 91% Off Deals

  • Trending
  • Comments
  • Latest
Anant Ambani wedding: Celebs, wealthy elite attend lavish billionaire festivities – National

Anant Ambani wedding: Celebs, wealthy elite attend lavish billionaire festivities – National

March 1, 2024
Product Information Management Trends (PIM)

Product Information Management Trends (PIM)

February 4, 2022
Deployment Diagrams Explained in Detail, With Examples

Deployment Diagrams Explained in Detail, With Examples

August 11, 2021
The Data Lake Security Checklist: IT Leader Essentials

The Data Lake Security Checklist: IT Leader Essentials

August 1, 2022
Bolstr bag, PowerSmart electric mower, and more – Review updates

Bolstr bag, PowerSmart electric mower, and more – Review updates

June 24, 2023
Unveiling the Future of Trading

Unveiling the Future of Trading

October 18, 2023
10 really good gadgets that cost less than $100 – TechCrunch

10 really good gadgets that cost less than $100 – TechCrunch

December 17, 2021
What is Kubernetes: An Overview

An Introduction to Kubernetes | Developer.com

August 11, 2022
Fantastic Four Star Vanessa Kirby Is Pregnant!

Fantastic Four Star Vanessa Kirby Is Pregnant!

June 2, 2025
Inside Zendaya and Tom Holland’s Marvelous Love Story

Inside Zendaya and Tom Holland’s Marvelous Love Story

June 1, 2025
Their Complete Relationship Timeline – Hollywood Life

Their Complete Relationship Timeline – Hollywood Life

June 1, 2025
One In Four European Firms Ban Grok AI Chatbot Over Security Concerns

One In Four European Firms Ban Grok AI Chatbot Over Security Concerns

June 1, 2025
Kylie Jenner Hidden From Knicks Jumbotron While On Date With Timothée Chalamet — But Was It The NBA's Choice Or Hers??

Kylie Jenner Hidden From Knicks Jumbotron While On Date With Timothée Chalamet — But Was It The NBA's Choice Or Hers??

June 1, 2025
‘The Black Phone 2’ Dials In Some Ominous Teasers

‘The Black Phone 2’ Dials In Some Ominous Teasers

May 31, 2025
Nicola Peltz Beckham shares cryptic Instagram story amid ongoing rumours of a Beckham family feud

Nicola Peltz Beckham shares cryptic Instagram story amid ongoing rumours of a Beckham family feud

May 31, 2025
THE PHOENICIAN SCHEME Hilariously Quriky and One of Wes Anderson’s Best Movies — GeekTyrant

THE PHOENICIAN SCHEME Hilariously Quriky and One of Wes Anderson’s Best Movies — GeekTyrant

May 31, 2025
New Self New Life

Your source for entertainment news, celebrities, celebrity news, and Music, Cinema, Digital Lifestyle and Social Media and More !

Categories

  • Celebrity
  • Cinema
  • Devices
  • Digital Lifestyle
  • Entertainment
  • Music
  • Social Media
  • Softwares
  • Uncategorized

Recent Posts

  • Fantastic Four Star Vanessa Kirby Is Pregnant!
  • Inside Zendaya and Tom Holland’s Marvelous Love Story
  • Their Complete Relationship Timeline – Hollywood Life
  • Home
  • Disclaimer
  • DMCA
  • Privacy Policy
  • Cookie Privacy Policy
  • Terms and Conditions
  • Contact us

Copyright © 2021 New Self New Life.
New Self New Life is not responsible for the content of external sites. slotsfree  creator solana token

No Result
View All Result
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices

Copyright © 2021 New Self New Life.
New Self New Life is not responsible for the content of external sites.

online casino mobile