Extract unique objects by attribute from array of objects
Last Updated :
21 Apr, 2024
Given an array of objects and the task is to return the unique object by the attribute.
Examples:
Input:
[
{ name: 'Geeks', id: 10 },
{ name: 'GeeksForGeeks', id: 10 },
{ name: 'Geeks', id: 20 },
{ name: 'Geeks', id: 10 }
]
Output:
[
{ name: 'Geeks', id: 10 },
{ name: 'GeeksForGeeks', id: 10 }
]
Approach: Let's assume that name is an attribute that differentiates the objects and needs the object with a minimum id number if multiple objects exist for the same name. Use the map to store objects and check whether similar objects were seen or not.
- Initialize an empty map.
- Iterate through the array using the filter() method.
- Check if there is any entry in the map with the same name as of current object.
- If true: i.e. there exists an entry with the same name then, check if its id is less than the current object's id.
- If true: i.e current object's id is less than the id of the object returned by the map then delete the map entry and enter the current object and return true.
- if false: i.e. id of the current object is greater than the id of the object returned by the map then return false.
- If false: i.e. there is no entry in a map with the same name then enter the current object into the map.
- Print unique objects.
Example: In this example, we will extract unique objects by attribute from an array of objects.
C++
#include <iostream>
#include <vector>
#include <unordered_map>
struct Object {
std::string name;
int id;
};
int main() {
std::vector<Object> objects = {
{"Geeks", 10},
{"GeeksForGeeks", 10},
{"Geeks", 20},
{"Geeks", 10}
};
std::unordered_map<std::string, int> mymap;
std::vector<Object> unique;
for (const auto& el : objects) {
if (mymap.find(el.name) != mymap.end()) {
if (el.id < mymap[el.name]) {
mymap[el.name] = el.id;
unique.push_back(el);
}
} else {
mymap[el.name] = el.id;
unique.push_back(el);
}
}
for (const auto& obj : unique) {
std::cout << "Name: " << obj.name << ", ID: " << obj.id << std::endl;
}
return 0;
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class UniqueObjectsFilter {
public static void main(String[] args) {
// Given objects array
List<Map<String, Object>> objects = new ArrayList<>();
objects.add(Map.of("name", "Geeks", "id", 10));
objects.add(Map.of("name", "GeeksForGeeks", "id", 10));
objects.add(Map.of("name", "Geeks", "id", 20));
objects.add(Map.of("name", "Geeks", "id", 10));
// Initialize a map to store the minimum 'id' for each 'name'
Map<String, Integer> myMap = new HashMap<>();
// Initialize a list to store unique objects
List<Map<String, Object>> unique = new ArrayList<>();
// Loop through each object in the 'objects' list
for (Map<String, Object> el : objects) {
// Check if 'name' is already in the map
if (myMap.containsKey(el.get("name"))) {
// If yes, compare the current 'id' with the stored minimum 'id'
if ((int) el.get("id") < myMap.get(el.get("name"))) {
// If the current 'id' is smaller, update the minimum 'id' in the map
myMap.put((String) el.get("name"), (int) el.get("id"));
// Add the current object to the list of unique objects
unique.add(el);
}
} else {
// If 'name' is not in the map, add it with the current 'id'
myMap.put((String) el.get("name"), (int) el.get("id"));
// Add the current object to the list of unique objects
unique.add(el);
}
}
// Print the list of unique objects
System.out.println(unique);
}
}
# Given JavaScript code to filter unique objects based on 'name' with the minimum 'id'
objects = [
{"name": "Geeks", "id": 10},
{"name": "GeeksForGeeks", "id": 10},
{"name": "Geeks", "id": 20},
{"name": "Geeks", "id": 10}
]
# Initialize an empty dictionary to store the minimum 'id' for each 'name'
mymap = {}
# Initialize an empty list to store unique objects
unique = []
# Loop through each object in the 'objects' array
for el in objects:
# Check if 'name' is already in the dictionary
if el["name"] in mymap:
# If yes, compare the current 'id' with the stored minimum 'id'
if el["id"] < mymap[el["name"]]:
# If the current 'id' is smaller, update the minimum 'id' in the dictionary
mymap[el["name"]] = el["id"]
# Add the current object to the list of unique objects
unique.append(el)
else:
# If 'name' is not in the dictionary, add it with the current 'id'
mymap[el["name"]] = el["id"]
# Add the current object to the list of unique objects
unique.append(el)
# Print the list of unique objects
print(unique)
let objects = [{
name: 'Geeks',
id: 10
}, {
name: 'GeeksForGeeks',
id: 10
}, {
name: 'Geeks',
id: 20
}, {
name: 'Geeks',
id: 10
}];
let mymap = new Map();
let unique = objects.filter(el => {
const val = mymap.get(el.name);
if (val) {
if (el.id < val) {
mymap.delete(el.name);
mymap.set(el.name, el.id);
return true;
} else {
return false;
}
}
mymap.set(el.name, el.id);
return true;
});
console.log(unique);
Output[ { name: 'Geeks', id: 10 }, { name: 'GeeksForGeeks', id: 10 } ]
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read