Find Duplicate File in System
Problem
Each input is a directory line: 'dir f1.txt(content1) f2.txt(content2) …'. Group all file paths sharing the same content.
['root/a 1.txt(abc) 2.txt(def)','root/c 3.txt(abc) 4.txt(def)'][['root/a/1.txt','root/c/3.txt'],['root/a/2.txt','root/c/4.txt']]def find_duplicate(paths):
from collections import defaultdict
g = defaultdict(list)
for line in paths:
parts = line.split(); d = parts[0]
for f in parts[1:]:
i = f.index('('); name, content = f[:i], f[i+1:-1]
g[content].append(d + '/' + name)
return [v for v in g.values() if len(v) > 1]function findDuplicate(paths) {
const g = new Map();
for (const line of paths) {
const [d, ...files] = line.split(' ');
for (const f of files) {
const i = f.indexOf('('), name = f.slice(0, i), content = f.slice(i+1, -1);
(g.get(content) ?? g.set(content, []).get(content)).push(d + '/' + name);
}
}
return [...g.values()].filter(v => v.length > 1);
}List> findDuplicate(String[] paths) {
Map> g = new HashMap<>();
for (String line : paths) {
String[] parts = line.split(" "); String d = parts[0];
for (int i = 1; i < parts.length; i++) {
int p = parts[i].indexOf('(');
String name = parts[i].substring(0, p), content = parts[i].substring(p+1, parts[i].length()-1);
g.computeIfAbsent(content, k -> new ArrayList<>()).add(d + "/" + name);
}
}
List> out = new ArrayList<>();
for (var v : g.values()) if (v.size() > 1) out.add(v);
return out;
} vector> findDuplicate(vector& paths) {
unordered_map> g;
for (auto& line : paths) {
stringstream ss(line); string d, f; ss >> d;
while (ss >> f) {
int p = f.find('(');
string name = f.substr(0, p), content = f.substr(p+1, f.size()-p-2);
g[content].push_back(d + "/" + name);
}
}
vector> out;
for (auto& [k, v] : g) if (v.size() > 1) out.push_back(v);
return out;
} Explanation
Files are duplicates when they share the same content, no matter where they live. So we group every file path by its content string and keep the groups that hold more than one file.
Each input line starts with a directory, followed by entries like name.txt(content). We split the line, then for each file entry we pull out the name (before the () and the content (inside the parentheses). The full path becomes dir + "/" + name.
We use a hash map keyed by content, appending each full path to the list for that content. This naturally clusters every file with identical content together.
Finally we keep only groups whose list has more than one path, since a lone file is not a duplicate of anything.
Example: root/a/1.txt and root/c/3.txt both have content abc, so they land in the same group. The output groups them as [root/a/1.txt, root/c/3.txt], and likewise the two def files.