forward list In C++ 

in order to get the unique elements in a list we can first sort the list in order to get the adjacent unique elements.....and then use unique function.

forward_list::unique( ) is a function in c++ standard library function which is used to remove the all duplicate (**adjacent**) elements from forward list. Notice that an element is only removed from the forward_list container if it compares equal to the element immediately it. Thus, this function is especially useful for sorted lists.

Sir, your way of explaining by putting in comments is simply unique.

Hi! 😁 It was very helpful. I hardly considered forward lists for use, but they can be helpful and they're STL! Thank you, it was quick and to the point overview of its methods. 😊

we need to sort the list first and then use unique alogorithm to make the list uniquie

the "over acting" actually makes it fun to watch

You have made life so much easy.. Thanks for the great work. It will help us all. 👏👏

Your explanation is soo easy to catch up with please keep making videos...😀

Good job Rupesh👍

Can we get headNode of singly linked list?

i upvote at start because i know video is going to be good.

forward_listsl1; sl1.insert_after(sl1.begin()+8,10); why this is not possible? I am getting an error for this.

Is the complexity of unique O(n) as its just checking adjacent element ?

God You;

Time complexity of insert after in forward list?

whats the meaning of A(const A& lhs)

A(int x=0): x{x} means what ?

If i want to enter the elements by taking input from user, what would be the procedure?

Amazing explaination sir.thank you so much sir.

Bro can we use this direct list in STL in coding interviews?

Fantastic :)

good work bro

It's great learning, thanks,but you are overreacting too much☺️☺️☺️

for actual unique, simply do a sort and then unique! Just saying..haha

Sir, no offense , but do you really have an accent or you're just faking it.

Don't do over-acting....