Finding Distinct Elements In A Data Structure Using C#

In this blog, you will learn how to find distinct elements in a data structure using c#.

In computer science, while coding, it is one thing to learn the language. Learning the language involves remembering the basic syntax and forming a “Hello World” code. After that comes solving problems. A good programmer is one who can solve a problem by multiple methods, pun intended. Some of them are easy to understand but tardy and time-consuming while others are simple two-liners but with an implementation that is very difficult to comprehend.

 

At the end of the day, our aim is to solve a problem and find the simplest way to do it, but in order to reach that level, one has to do it through the long way. Each difficult problem can be divided into sub-problems. Finding distinct objects is also a kind of sub-problem that we usually come across while solving programming questions in placement exams.

 

C# provides a very sleek feature for this functionality, which we will discuss later. Firstly solving this issue with the tedious approach will help us understand coding at a deeper level.

 

The Long Way

 

So, when removing duplicates we assume that we have an empty box and we go through all the items in the group sequentially. There is one condition to enter the box, that is if the box has anything like you, it won’t let you in. Iterating this alogrithm will simply provide us all the distinct elements in any data structure.

 

For Numbers,

using System;
using System.Collections;

public class Program{
    public static void Main(){
        int[] arr = {1,3,1,4,7,4,2,1,5,5,3};

    //Find only Unique Elements

        //Declaring the Empty Box
        ArrayList sol = new ArrayList();


        for(int i=0;i<arr.Length;i++){
            //Mandatory Entry Condition
            if(sol.Contains(arr[i])==false){
                sol.Add(arr[i]);
            }
        }

        //ONLY FOR DISPLAYING OUTPUT
         Console.Write("Original Array : ");

        foreach(var a in arr){
            Console.Write("{0} ",a);
        }

        Console.Write("\n");

        Console.Write("Modified Array : ");
        //Checking the Output
        foreach(var j in sol){
            Console.Write(j+ " ");
        }
    }
}

Note

I used ArrayList as the Empty box data type to avoid the need to declare the initial size of the array, as ArrayList is dynamic in that form.

 

OUTPUT

 

 

For String or Characters,

using System;
using System.Text;

public class Program{
    public static void Main(){
        String s = "aasjnajsnascnsdchhede";

        //Declaring Empty Box
        StringBuilder sb = new StringBuilder();

       foreach(char c in s){
           //Checking at the Entry
           if(sb.ToString().Contains(c.ToString())==false){
               sb.Append(c.ToString());
           }
       }

       //Our Modified Output
       Console.Write(sb.ToString());
    }
}

Note

We used StringBuilder data type to insinuate that even the data types that do not support function Contains() can be manipulated to perform according to our requirements.

 

OUTPUT

 

 

The Short Way

 

Even though the above-mentioned examples seem short, Appling the box algorithm and manipulating data in competitive programming become an overhead, both for memory and time. In C# we can avoid all the hassle by simply removing duplicate items using the Distinct() method. This implementation is straightforward and thus very easy to remember.

using System;
using System.Linq;

public class Program{
    public static void Main(){
        int[] arr = {1,2,1,2,2,3,4,2,5,7,5,1};

        var q = arr.Distinct();
        foreach(var v in q){
          Console.Write(v + " ");
        }
    }
}

OUTPUT