Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Databases Querying Relational Databases Set Operations Set Operations

Luis Brito
Luis Brito
24,527 Points

Querying Relational Databases , Challenge Task 4 of 6

There are two tables Fruit and Vegetable table. The Fruit table has a FruitID and a Name column and the Vegetable table has a VegetableID and Name column. Create an alphabetical list of produce that is considered both a fruit and a vegetable.

Struggling with this challenge, does someone know the answer for this, would appreciate

2 Answers

Steven Parker
Steven Parker
230,024 Points

Here's a hint: the solution will be similar to previous tasks but instead of UNION you might use INTERSECT this time.

If you need more help, give it your best shot and show your code, and we can make suggestions on how to fix it.

Hey Luis, I was struggling with this myself. The best way/efficient method I used to tackle it was by following the pattern of the prior challenges to have a better understanding. The answer cane be found below..

SELECT Name FROM Fruit INTERSECT SELECT Name FROM Vegetable ORDER BY Name ASC;

We had to use INTERSECT as opposed to UNION to get common result from both rows. Below is a helpful article on that..

https://www.c-sharpcorner.com/article/the-complete-reference-set-operations-in-ms-sql-union-all-intersect-excep/#:~:text=UNION%20ALL%20combines%20two%20or,in%20the%20second%20result%20set.