To the Top
File:  root - text - article - 2020 - 02 - absolute-path.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 662 Views, 20768 Search Bots | 78 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

Given a file path with folder names, '..' (Parent directory), and '.' (Current directory), return the shortest possible file path (Eliminate all the '..' and '.').

Example
Input: '/Users/Joma/Documents/../Desktop/./../'
Output: '/Users/Joma/'

def shortest_path(file_path):
# Fill this in.

print shortest_path('/Users/Joma/Documents/../Desktop/./../')
# /Users/Joma/
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 662 Views, 20768 Search Bots | 78 Words Subscribe to Feed Burner

Related Articles

  1. [Daily Problem] Remove k-th Last Element From Linked List
  2. Daily Interview Problem: Look and Say Sequence
  3. Non-decreasing Array with Single Modification
  4. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  5. Generate All IP Addresses
  6. Daily Interview Problem: Deepest Node in a Binary Tree
  7. 56 Bytes
  8. Algorithm Interview: No Adjacent Repeating Characters
  9. Most Frequent Subtree Sum
  10. YES!!

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />