Sequential Search For Two Data Variables In Linked List

I just trying to find the most efficient way to do this. I read in a csv file into a linked list and then I split the linked list into sections based on category for each element. Of course I used an array to split each element of the list. However I can do the sequential search by either ID and Name by using hashmap and making the key = name + ID and then doing key.contains(charSequence);. However I feel like this is inefficient and I would like to use the linked list instead of a hashmap which could be done by splitting the user input and used for method overloading by passing an int in one and a string in another. I feel like this approach is a little more redundant and maybe their is a better approach for searching for id and name. Below is an example of the elements in a linked list.

note: their are more elements than this.

element 1

name: George
address: 4410 something dr.
phone number: 978-888-6666
id: 43

element 2

name: Karla
address: 339 something dr.
phone number: 334-338-6556
id: 23