Dart provides several built-in collection types to store and manipulate groups of objects. Here are the different types of collections available in Dart:

* List : A List represents an ordered collection of objects, where each object can be accessed by its index. Lists in Dart are similar to arrays in other programming languages. They can grow or shrink dynamically and allow duplicates.

* Set : A Set represents an unordered collection of unique objects. Sets do not preserve the order of elements, and they automatically remove duplicate values when adding elements.

* Map : A Map is a collection of key-value pairs, where each key is unique. Maps provide an efficient way to look up values based on their associated keys. The keys and values can be of any type.

* Queue : A Queue is a collection that allows adding elements at the end and removing elements from the front. It follows the First-In-First-Out (FIFO) principle, where the element added first is the first one to be removed.

* Stack : A Stack is a collection that allows adding elements at the top and removing elements from the top. It follows the Last-In-First-Out (LIFO) principle, where the element added last is the first one to be removed.

* LinkedHashMap : A LinkedHashMap is a Map implementation that maintains the order of key-value pairs based on their insertion order. It combines the properties of a Map and a LinkedList.

* HashSet : A HashSet is a specialized implementation of Set that provides constant-time performance for basic operations such as adding, removing, and checking for the existence of an element.

* LinkedList : A LinkedList is a collection that represents a sequence of elements, where each element has a reference to the next and previous elements. It provides efficient insertion and deletion operations at both ends of the list.

These collection types in Dart offer different behaviors and performance characteristics, allowing you to choose the one that best fits your specific use case.