Skip to main content

Linked List in Java - Collections Framework- DSA

Gist:

A Linked list is dynamic array where a group of object can be stored while following the insertion order and allow duplicates, the 2 type of linked list is singly and double linked lists, the default one is single linked list where the elements can be traversed only in forward direction this is because unlike array here the elements are stored at random locations and only the node of each element knows the address of the next element. A simple example would be our circut board here a point X may be connection to Y and Y connectioned to pont Z here the insertion order is preserved and we can know the next point only by following the signals from the previous point.

Same as the example but in Linked list each element has 2 parts in singly linked list where 1 part is the node with the adress to the next node and the other which is the actua data of that element like a post letter the envelop has the address and inside the contents. but in doubly linked list there are 3 parts 2 of them are nodes which has the address of previous and next element and the other one is the actual data of that element.

The insertion or deletion are in constant time so compared to arrayList the mega process will be avoided. 


Hierarchical order





Type of constructors

  • Empty argument constructor or the default constructor is the same as invoking any other objectobjectobjectobject here a new linked list object will be careated, do note that there is no scope for reserving memory for the number of elements as we add new element the size is maintained dynamically a new Li ked list is empty list. 

    LinkedList = new LinkedLis() ;

  • Conversion of other Collections like ArrayList, Vector, etc...to an linked List is possible with the following constructor.

  • LinkedList arraysFromVector = new LinkedList( VariableNameOfTheCollection );

  • //here any collection will be converted into an Linkedlist

Important Points

  • By default an empty LinkedList is created. 
  • Is Dynamically Growable and Shrinkable. 
  • Heterogeneous Objects are allowed.
  • There is no initial capacity 
  • No load factor is applicable here. 
  • Order of insertion is preserved
  • We can also use generic data-type such that the array acts like a homogenous.
  • Random acess interface is not implemented. 
  • Ideal if the operations are Insertion or deletion. 

Implementing Interfaces

  • Serializable
  • Cloneable
  • Iterable <E>
  • Collection <E>

Methods available to only the Arraylist object. 

  • .addFirst(Element) -> adds the element in the front of the ArrayList. 
  • .addLast(Element) -> add an element in the last part of the ArrayList. 
  • getFirst() --> returns the Object at the front of the Linked List. 
  • getLast() --> returns the last object in the linked list.
  • removeFirst() -> returns the object in the first and removes it from the linked list
  • removeLast() --> returns the last objects and removes the object from the linked list. 
Pros Cons
Ideal if insertion or deletion operations are more. Worst if there are lots of search operations as it needs to iterate through all the other elements. 
By default the elements can be traversed through forwad direction. Java LinkedList class is non-synchronized. 
Can hold duplicate elements. Does not implement random access interface.
Can hold null values.
The process of insertion or deletion is simple and fast.
Labels:

Comments

Post a Comment

Continue reading my other posts

Chocolate Feast - Problem Solving - Hacker Rank Solution.

The expectation is to find the total number of choclate one can consume by taking full advantage of the offer, Here there are 3 inputs n which holds the value of initial amount of money for buying choclate, c is the cost price of each candy if paid by cash and m is the exchange rate for the candy. Inputs n Initial cash to buy candy. c Coast of each candy if paid by cas.h m Exchange rate for a new candy in offer. The initial count of choclate will be the cash / coast and the wrappers in hand will be the same value of choclate, and from there we loop through until the wrap count is less than the exchange rate, inside the loop the choclate count will still hold the same fourmula as before but divided with exchange rate. The wrap count is the tricky part... the wrap will be wrap/ exchange rate(the no. choclate) + the remainder of this division(THIS IS VERY IMPORTANT) because for example if the count of wrapper is 3 and the exchange rate is 2 you can only buy 1 c
Post a Comment
Read more

Designer PDF Viewer - HackerRank Problems

Difficulty: EASY Problem : The objective here is to find the size of the highlighted area, and we are given the size's of all the alphabets, we have to find the largest alphabet in the highlighted word and then calculate the size of the rectangle so if the tallest character is 3 then the size of the box will be 3 * number of characters given. Visual representation of the selection : abc def ghij Inputs An array with the sizes of all alphabets a-z in order. A String of highlighted words. Important points to note The array which holds the height of each character in ascending order which means the arrays 0th index will have the height of a 1st index will have the height of b and so on and so forth in the end the hight of z will be there so it's easy to locate each character. A String with the highlighted word. This means we have got the characters inside the rectangle, all we have to find is
Post a Comment
Read more

Delving Deeper into ViewModel - AndroidNotes

While building apps i have often incorporate ViewModels without fully grasping their intricacies. I made some common mistakes, like creating ViewModel instances within a remember block and such silly mistakes,but this journey has prompted me to dig a little deeper into understanding ViewModels and their internal workings. The primary questions we are going to address are as follows: What is a ViewModel? How to create a ViewModel? What is the difference between ViewModel and AndroidViewModel? What is a ViewModelFactory? What is viewModelScope? When is the ViewModel dropped by the ViewModelStore? What is onCleared() in the ViewModel ? lets begin our journey.... What is a ViewModel? ViewModel is a simple class that is part of the Android Architecture Components and its primary purpose is to store and manage UI-related data in a lifecycle-conscious manner caching its value during the lifecycle of the activity It helps us to avoid loading dat
Post a Comment
Read more