query: Scheme - Removing duplicates from nested lists
positive_passages.docid: 150119
positive_passages.text: Scheme removing nested duplicates
negative_passages.docid: 85230
negative_passages.text: What is the most elegant way to find index of duplicate items in C# List
negative_passages.docid: 61465
negative_passages.text: Java Remove Duplicates from an Array?
negative_passages.docid: 18387
negative_passages.text: How do I remove duplicate items from an array in Perl?
negative_passages.docid: 122887
negative_passages.text: Mathematica: issues storing nested list on disk
negative_passages.docid: 36545
negative_passages.text: Merge lists that share common elements
negative_passages.docid: 114884
negative_passages.text: Recursion - Removing Duplicates
negative_passages.docid: 25857
negative_passages.text: Remove lines based on duplicates within one column without sort
negative_passages.docid: 118828
negative_passages.text: Complicated FOR loop nesting. Having trouble cleaning up legacy code
negative_passages.docid: 14151
negative_passages.text: Checking for duplicates in a vector
negative_passages.docid: 112733
negative_passages.text: how do you split a string to create nested list?
negative_passages.docid: 94697
negative_passages.text: Grouping the first two elements in a list of ordered triples
negative_passages.docid: 97909
negative_passages.text: Sorting and Grouping Nested Lists in Python
negative_passages.docid: 125979
negative_passages.text: How to flatten a list to a list without coercion?
negative_passages.docid: 81031
negative_passages.text: How can one nested list be used to find the positions of those values in another nested list?
negative_passages.docid: 53625
negative_passages.text: Duplicate id in list
negative_passages.docid: 21871
negative_passages.text: In Python, what is the fastest algorithm for removing duplicates from a list so that all elements are unique *while preserving order*?