Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in Go

Problem: Find Duplicate File in System

Explore how to identify duplicate files in a file system by grouping paths based on file content. Understand how to parse directory strings, use hash maps for efficient grouping, and analyze algorithm complexity to handle large data effectively.

We'll cover the following...

Statement

You are given a list paths, where each element is a string representing directory information. Each string contains a directory path followed by one or more files along with their contents in the following format:

"root/d1/d2/.../dm f1.txt(f1_content) f2.txt(f2_content) ... fn.txt(fn_content)"

This indicates that there are n files (f1.txt, f2.txt, …, fn.txt) with contents (f1_content, f2_content, …, fn_content) respectively, all located in the directory "root/d1/d2/.../dm". Here, n ≥1\geq 1 and m ≥0\geq 0. When m =0= 0, the directory is simply the root directory. A single blank space separates the directory path from each file entry.

Your task is to identify all groups of duplicate files in the file system. A group of duplicate files consists of at least ...