# Find the length of a set in Ruby

**Finding length of a set**: Here, we are going to learn **how to find the length of a set in Ruby programming language?**

Submitted by Hrithik Chandra Prasad, on October 15, 2019

We know the way to declare the instance of the set class in Ruby. Most of the time, we may need to **find the length of the set** or you can say that we may need to **find the number of elements in the specific set**. Ruby is very rich in library and it provides you a method known as **Set.length() method** which returns the **number of elements present in the Set**. But, we should know how to solve things without method also? We will focus on two ways through which we can **find the length of the Set**. The first one is without using method and the second one is with the help of the method.

**Methods used:**

**Set.each**: It is used to traverse the set. It processes the elements of the set one by one.**Set.length**: This method is a predefined method in Ruby’s library which is purposefully defined to find the number of elements present in the set. The return type of this method is an integer which is equivalent to the length of the set from which it has been invoked.**Set.merge**: This method merges two sets and stores the resultant set in that set from which it has been invoked. The return type of this method is Set.

**Variables used:**

- Vegetable: This is an instance of Set class.
- Fruits: This is an instance of Set class.
- Count: It is acting as a counter variable. It is counting the number of elements present in the Set.

**Example 1:**

=begin Ruby program to find the length of the set. =end require 'set' Vegetable=Set.new(["potato","brocolli","broccoflower","lentils","peas","fennel","chilli","cabbage"]) Fruits = Set.new(["Apple","Mango","Banana","Orange","Grapes"]) Vegetable.merge(Fruits) count = 0 Vegetable.each do |element| count = count + 1 end puts "The number of elements present in the set are #{count}"

**Output**

The number of elements present in the set are 13

**Explanation:**

In the above code, we are trying to **find the length of the resultant set**. First, we have declared two sets and then carrying out the merging process. We are passing the elements of a resultant set into **Set.each** loop. Inside **Set.each** loop, we are incrementing the count variable by 1. count variable is initialized with 0. At last, we are getting the number of elements present in the set.

**Example 2:**

=begin Ruby program to find the length of the set. =end require 'set' Vegetable=Set.new(["potato","brocolli","broccoflower","lentils","peas","fennel","chilli","cabbage"]) Fruits = Set.new(["Apple","Mango","Banana","Orange","Grapes"]) Vegetable.merge(Fruits) puts "The number of elements present in the set are #{Vegetable.length}"

**Output**

The number of elements present in the set are 13

**Explanation:**

In the above code, we have declared two instances or objects of Set class. We are first merging them and storing the result in the Vegetable set. We are then **finding the length of the resultant set** with the help of **Set.length** method which is a predefined method in Ruby.

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions