package en.javarush.task.jdk13.task08.task0817;

import java.util.HashMap;
import java.util.Map;
import java.util.ArrayList;
import java.util.*;

/*
We don't need repeats
*/

public class Solution {
    public static Map<String, String> createMap() {
       Map <String, String> map = new HashMap <String, String> ();
    map.put ("O", "Cristi");
    map.put ("A", "Vanea");
    map.put ("B", "Liusea");
    map.put ("E", "Bogdan");
    map.put ("P", "Evrei");
    map.put ("R", "Mutuzea");
    map.put ("T", "Kukuruzea");
    map.put ("I", "Kiriusa");
    map.put ("N", "Cristi");
    map.put ("M", "Cristi");
    return map;
    }

    public static void removeFirstNameDuplicates(Map<String, String> map) {
     Map <String, String> copyOfMap = new HashMap <>(map);
     List <String> values = new ArrayList <String>(copyOfMap.values());

     for (String checkValues : values) {
     if (copyOfMap.containsValue(checkValues)) {
     removeItemFromMapByValue(map, checkValues);
     }
     }

    }

public static void removeItemFromMapByValue(Map<String, String> map, String value) {
  Map<String, String> copy = new HashMap<>(map);
        for (Map.Entry<String, String> pair : copy.entrySet()) {
            if (pair.getValue().equals(value)) {
                map.remove(pair.getKey());
            }
        }
    }

    public static void main(String[] args) {

    }
}