Use of Lamda Expression and Functional Interface in JAVA 8

In this blog, we are going to discuss one of the most important features of JAVA 8 which is Lamda Expression and Functional Interface.

As per java doc, "Lamda Expression enables Functional Interface" that means Lamda Expression allows us to write Functional Programming.

Please note that Lamda Expression takes or accepts only those interfaces which are having only one abstract method.

So What is Functional Interface?

A functional interface is an interface which is having only one abstract method. For example, we can consider as

• java.util.Comparator interface
• Java.lang.Runnable interface

We have created one customize Functional Interface MathHelper which is having only one method as sum(int val1, int val2).

Please note, annotation @FunctionalInterface is used to tell us that this interface will be used as Functional Interface.

Now what will happen if we add one more method multiply(int val1, int val2) like below,

Well, above scenario will not work here, compiler will give us an error as Functional Interface can not contain more that one abstract method. To overcome this problem, we can have a number of default methods like below:

What is Lamda Expression?

We are familiar with Functional Interface now but question is how can we use this functional interface in our code.

Well, the answer is Lamda Expression. Lamda expression is introduced in Java 8 and it is an Instance of Functional Interface.

Let us think that if Lamda Expression would not have introduced, then how can we implement the MathHelper Interface in Java 7. So we need to have One class lets say MathHelperImpl which implements MathHelper interface like below.














So does not it look like little lengthy because just to achieve the sum() function, we have to implement the Interface and have to Instantiate the class.

But question is why do we need to create the object? Can't we do this as a function without implementing or creating a new Object.

We can write a block of code to a variable and where ever this variable goes, this block of code also goes with that. Lets see below example,

String country= "India" // here india is assigned to a variable called country.

Double piVal="3.14" // here 3.14 is assigned to a variable called piVal.

As per above example, where ever we will use country, piVal variables in our code its value also passes with it.

If we can write a block of function like below where entire function is assigned to a variable then we can solve the above problem.

lamdaVal={
         .................. our functional code comes here............
         ..........................
                   }
So let us write the sum() method like below:
lamdaVal=public int sum(int val1, int val2) {
        return val1 +val2;}
    }

But we can get rid of couple of things from the above block like:
public - This is really not required while writing a block of code because we are writing this block inside some class or method only.
int- We don't need to mention return type as compiler can understand the return type by seeing the functional interface.
sum - For a block of code, we don't need to mention any name just like anonymous method. 

So finally the above block will look like:

lamdaVal=(int val1, int val2) {
        return val1 +val2;
    }
Even we can more specify it as below
lamdaVal=(val1, val2) {
        return val1 +val2;
    }
So the syntax is pretty much same for the Lamda Expression except one addition which is:
lamdaVal=(val1, val2) -> { val1 +val2 ;
    }
If we have only one line of code in that case we can re write the above the code as 
lamdaVal=(val1, val2) -> val1 +val2 ;

So finally we can re write our above Java 7 code using Lamda Expression in Java 8 as below:

    







Complete Example of Lamda && Functional Interface:

Couple of things we can see from the above Lamda code...

1. We don't implement the MathHelper Interface here rather than we are using it as a functional way.

2. Using Lamda Expression we can write very less code which can not be done in Java 7.

That's all for Java 8 Functional Interface and Lamda Expression. I keep it as simple as I can. Hope you like it. I would love to see your comment and feedback.

Java Program to check a String contains all alphabet or not.

This question can be asked in different ways like " tell if a String contains a-z character or not" and "How can we check a String contains only Alphabet".

To solve a String contains all the alphabet or not, we will take set. We will Iterate the String and every time we will add the iterated character into the Set.

If the set size is 26 that means the String contains all the alphabet.

Here is the code snippet:

public class AllAlphabetInString {

public static void main(String[] args) {
int noOfAlphabet=26;
String text="We promptly judged antique ivory buckles for the next prize";
Set<String> alphaSet=new HashSet<>();

//uses regular expression to filter out special character from the String..
Pattern pattern=Pattern.compile("[A-Za-z]");
Matcher matcher=pattern.matcher(text);
boolean findAll=false;

while(matcher.find()&&!findAll)
{
String s=matcher.group().toLowerCase();
alphaSet.add(s);
if(alphaSet.size()==noOfAlphabet)
{
findAll=true;
}
}
System.out.println("Result: "+findAll);
}
}

How to remove Duplicate elements from a Sorted Array

This is another popular coding interview question. I had faced this question during my interview with Reliance Jio.

You are given a sorted array like { 2,2,2,2}, so the final array would be {2}.

Examples: 

Input:       arr[]={5,5,5,5}
Output:    arr[]={5}

Input:       arr[]={1, 2, 2, 3, 4, 4, 4, 5, 5}
Output:    arr[]={1,2,3,4,5}

Logic: To solve this problem, we will take another variable as j. Every time we will check i th element with i+1 th element. If it does not match, will increase j with j+1.

Program:

public class DuplicateArrayElement {
static int removeDuplicates(int arr[], int n)
    {
        if (n == 0 || n == 1)
            return n;
        
        //Taking extra index which will be increased based on iTh and i+1 Th index
        int j = 0;
      
        for (int i = 0; i < n-1; i++)
            if (arr[i] != arr[i+1])
                arr[j++] = arr[i];
      
        arr[j++] = arr[n-1];
      
        return j;
    }

//** Main method to test the method removeDuplicates()**//

    public static void main (String[] args) 
    {
        int arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5};
        int n = arr.length;
         
        n = removeDuplicates(arr, n);
  
        for (int i=0; i<n; i++)
           System.out.print(arr[i]+" ");
    }
}

How to create or design your own HashMap in JAVA

One of my friends had recently faced this question during his interview with JP Morgan. You can expect this kind of questions in every product based company.

To design our own HashMap, we should know how java.util.HashMap internally works. HashMap has DEFAULT_SIZE of 16 that means DEFAULT capacity of HashMap is 16 buckets and load factor is 0.75.

Internally HashMap has Entry class, which contains Key and Value.

Every time when we put some value into the HashMap, internally it will calculate the hashCode() of the given key to find out the correct bucketId to place that object inside that index.

Every time when we get() some value based on key, it will calculate the hashCode of that key and go to the correct basketId and returns the  object.

Here is the implementation of Entry class:

package design.own.hashmap;

public class Entry<K,V> {
K key;
V value;
Entry<K,V> next;
public Entry(K key, V value)
{
this.key=key;
this.value=value;
next=null;
}

public K getKey() {
return key;
}
public void setKey(K key) {
this.key = key;
}
public V getValue() {
return value;
}
public void setValue(V value) {
this.value = value;
}
public Entry<K, V> getNext() {
return next;
}
public void setNext(Entry<K, V> next) {
this.next = next;
}
}

**********Implementation of complete HashMap***********

package design.own.hashmap;

public class HashMap<K,V> {
private int DEFAULT_SIZE=16;
private Entry<K,V>[] entryBucket;
public HashMap(){
entryBucket=new Entry[DEFAULT_SIZE];
}
public HashMap(int capacity){
entryBucket=new Entry[capacity];
}
public void put(K key, V value)
{
int bucketIndex=getBucketindex(key);
Entry<K,V> entry=entryBucket[bucketIndex];
if(entry!=null){
boolean done=false;
while(!done)
if(key.equals(entry.getKey())){
entry.setValue(value);
done=true;
}else if(entry.getNext()==null)
{
entry.setNext(new Entry<K,V>(key, value));
}
entry=entry.getNext();

}else{
entryBucket[bucketIndex]=new Entry<K,V>(key, value);
}
}
/**
* this method returns the basketId based on applying hashCode on given key
* @param key
* @return
*/
public int getBucketindex(K key)
{
int val=key.hashCode()%10;
return val;
}
public V get(K key) {
Entry<K, V> entry = entryBucket[getBucketindex(key)];
while (entry != null && !key.equals(entry.getKey()))
entry = entry.getNext();
return entry != null ? entry.getValue() : null;
}

}


**************************Test Class************************

package design.own.hashmap;

public class HashMapTest {
public static void main(String[] args) {
HashMap<Integer,Integer> map=new HashMap<>();
map.put(1,10);
map.put(2,20);
map.put(11,30);
System.out.println("Val is: "+ map.get(1));
}

}

*****************End of Custome HashMap Implementation***************

So as per our above implementation, when we put key as 1, it will calculate its hashCode and return bucketIndex as 1 so 10 will be kept inside 1 bucketIndex.

Next time we put 2 as key, so it will calculate its bucket index and put 20 inside 2 bucketIndex.

Now we put 11 as key and its bucket index is 1, but 10 is already there inside bucketIndex 1, so this time it will create one more Entry node which will be next to node 10.

Please see the below Image, we assumed we have 16 buckets and based on our above main class, it will be like:

You may also like:

Singleton Design pattern, a complete guide
Determine if a String has all unique character or not in JAVA
Converting String to Integer without using any Standard Library in JAVA