6 kyu
Array.diff
118,868 of 301,220marcinbunsch
Description:
Implement a function that computes the difference between two lists. The function should remove all occurrences of elements from the first list (a) that are present in the second list (b). The order of elements in the first list should be preserved in the result.
Examples
If a = [1, 2] and b = [1], the result should be [2].
If a = [1, 2, 2, 2, 3] and b = [2], the result should be [1, 3].
Arrays
Fundamentals
Algorithms
Similar Kata:
Stats:
| Created | Sep 22, 2013 |
| Published | Sep 22, 2013 |
| Warriors Trained | 615344 |
| Total Skips | 63625 |
| Total Code Submissions | 989078 |
| Total Times Completed | 301220 |
| JavaScript Completions | 118868 |
| CoffeeScript Completions | 410 |
| Haskell Completions | 3255 |
| Ruby Completions | 10623 |
| Python Completions | 125517 |
| C# Completions | 14927 |
| Rust Completions | 3403 |
| Clojure Completions | 424 |
| PHP Completions | 6696 |
| Groovy Completions | 144 |
| Julia Completions | 215 |
| Nim Completions | 68 |
| R Completions | 398 |
| Elixir Completions | 417 |
| F# Completions | 185 |
| Prolog Completions | 79 |
| C Completions | 2343 |
| Java Completions | 12183 |
| Crystal Completions | 32 |
| Scala Completions | 490 |
| TypeScript Completions | 4603 |
| COBOL Completions | 18 |
| Go Completions | 2004 |
| Total Stars | 4091 |
| % of votes with a positive feedback rating | 88% of 26479 |
| Total "Very Satisfied" Votes | 20896 |
| Total "Somewhat Satisfied" Votes | 4897 |
| Total "Not Satisfied" Votes | 686 |
