yuuu
    • Create new note
    • Create a note from template
      • Sharing URL Link copied
      • /edit
      • View mode
        • Edit mode
        • View mode
        • Book mode
        • Slide mode
        Edit mode View mode Book mode Slide mode
      • Customize slides
      • Note Permission
      • Read
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Write
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Engagement control Commenting, Suggest edit, Emoji Reply
    • Invite by email
      Invitee

      This note has no invitees

    • Publish Note

      Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

      Your note will be visible on your profile and discoverable by anyone.
      Your note is now live.
      This note is visible on your profile and discoverable online.
      Everyone on the web can find and read all notes of this public team.
      See published notes
      Unpublish note
      Please check the box to agree to the Community Guidelines.
      View profile
    • Commenting
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
      • Everyone
    • Suggest edit
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
    • Emoji Reply
    • Enable
    • Versions and GitHub Sync
    • Note settings
    • Note Insights
    • Engagement control
    • Transfer ownership
    • Delete this note
    • Save as template
    • Insert from template
    • Import from
      • Dropbox
      • Google Drive
      • Gist
      • Clipboard
    • Export to
      • Dropbox
      • Google Drive
      • Gist
    • Download
      • Markdown
      • HTML
      • Raw HTML
Menu Note settings Versions and GitHub Sync Note Insights Sharing URL Create Help
Create Create new note Create a note from template
Menu
Options
Engagement control Transfer ownership Delete this note
Import from
Dropbox Google Drive Gist Clipboard
Export to
Dropbox Google Drive Gist
Download
Markdown HTML Raw HTML
Back
Sharing URL Link copied
/edit
View mode
  • Edit mode
  • View mode
  • Book mode
  • Slide mode
Edit mode View mode Book mode Slide mode
Customize slides
Note Permission
Read
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Write
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Engagement control Commenting, Suggest edit, Emoji Reply
  • Invite by email
    Invitee

    This note has no invitees

  • Publish Note

    Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

    Your note will be visible on your profile and discoverable by anyone.
    Your note is now live.
    This note is visible on your profile and discoverable online.
    Everyone on the web can find and read all notes of this public team.
    See published notes
    Unpublish note
    Please check the box to agree to the Community Guidelines.
    View profile
    Engagement control
    Commenting
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    • Everyone
    Suggest edit
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    Emoji Reply
    Enable
    Import from Dropbox Google Drive Gist Clipboard
       owned this note    owned this note      
    Published Linked with GitHub
    Subscribed
    • Any changes
      Be notified of any changes
    • Mention me
      Be notified of mention me
    • Unsubscribe
    Subscribe
    # 2024 年「[資訊科技產業專案設計](https://hackmd.io/@sysprog/info2024/https%3A%2F%2Fhackmd.io%2F%40sysprog%2Finfo2024-homework1#REACTO-%E6%AD%A5%E9%A9%9F)」課程作業 3 > contributer > [yuyuan0625](https://github.com/yuyuan0625) ## [【2025 TSMC RDSS & AO】Information Technology Engineer (IT)](https://careers.tsmc.com/en_US/careers/JobDetail?jobId=5017&source=External%2BCareer%2BSite#) ::: spoiler Job Description #### **Job Responsibilities** You will be tasked with one or more of the following responsibilities: 1. Development and integration of Factory Automation Systems. 2. Development and integration of Advanced Technology. 3. Development and integration of Office Automation Systems. 4. Development and integration of Cloud Computing, Kubernates or BigData Analytics Systems. 5. Build/Development Scalable Platform for managing container applications. #### **Job Qualifications** 1. Major in IT, Computer Engineering, Software Engineering, Computer Science or related fields. 2. Familiar with with one or more of the following : (1) Development of C/C++ or JAVA Programming. (2) Microservices Architecture Pattern, DevOps. (3) Web Applications for PC and Mobiles. (4) Hadoop, Spark and Parallel Computing. 3. The ones with multiple above skill sets and experience is a plus. 4. Experience in large-scale system integration, cloud computing, social networking for factory automation is a plus. 5. Self-motivated, integrity, and result-oriented personality. ::: #### 工作內容分析 1. **工廠自動化**系統開發與整合 2. **先進技術**開發與整合 3. **辦公室自動化**系統開發與整合 4. **雲端運算、Kubernetes**與大數據分析系統 5. **可擴展容器應用管理**平台建置 #### 符合技術能力 - Major in IT, Computer Engineering, Software Engineering, Computer Science or related fields. - Familiar with with one or more of the following : - Development of C/C++ or JAVA Programming. - Web Applications for PC and Mobiles. - Self-motivated, integrity, and result-oriented personality. #### 不符合 - Microservices Architecture Pattern, DevOps. - Hadoop, Spark and Parallel Computing. - Experience in large-scale system integration, cloud computing, social networking for factory automation is a plus. ## [Google Software Engineer, University Graduate, 2025](https://www.google.com/about/careers/applications/jobs/results/137721392706527942-software-engineer-university-graduate-2025?q=%22Software%20Engineer%22&location=Taiwan&src=Online/House%20Ads/BKWS_LOC5&gad_source=1) ::: spoiler Job Description #### About the job We're looking for engineers who bring fresh ideas from all areas, including **information retrieval, distributed computing, large-scale system design, networking and data storage, security, artificial intelligence, natural language processing, UI design and mobile**; the list goes on and is growing every day. As a software engineer, you will work on a specific project critical to Google’s needs with opportunities to switch teams and projects as you and our fast-paced business grow and evolve. We need our engineers to be versatile, display leadership qualities and be enthusiastic to take on new problems across the full-stack as we continue to push technology forward. As a key member of a small and versatile team, you **design, test, deploy and maintain software solutions**. Due to business needs, we are **prioritizing candidates that are available to start this position before the end of 2025**. This role is eligible for visa sponsorship. #### **Minimum qualifications:** Bachelor's degree in Computer Science, related technical field, or equivalent practical experience. Experience in computer science, data structures, algorithms, and software design. Experience in Software Development and coding in a general purpose programming language. #### **Preferred qualifications:** Master's degree or PhD in Computer Science or a related technical field. Experience programming in C, C++, Java, or Python. Experience with Unix/Linux or Windows environments, distributed systems, machine learning, information retrieval, and TCP/IP. #### **Responsibilities** - Build our platforms, systems, and networking infrastructure using experience with distributed systems, OS/kernel, network system design, and large-scale storage systems. - Build internal systems used by Googlers globally. - Mitigate reliability failures in a component or system. - Create and support a productive and innovative team, including working with peers, managers, and teams. ::: #### 符合技術能力 - Bachelor's degree in Computer Science - Experience in computer science, data structures, algorithms, and software design. - Experience with Unix/Linux or Windows environments, distributed systems, machine learning, information retrieval, and TCP/IP. #### 不符合 - Experience with Unix/Linux or Windows environments, distributed systems, machine learning, information retrieval, and TCP/IP. ## [2025校招/研發替代役/應屆預聘正職_軟韌體開發] #### **About the job** - 資工/資管/電子/電機/電信/通訊/電控相關研究所背景 - 對行動通訊、無線及寛頻連結、家庭娛樂晶片解決方案有濃厚興趣的2025年應屆畢業生 職缺: 1. [Embedded System software](https://careers.mediatek.com/eREC/JobSearch/JobDetail/MTK120240902008?returnUrl=%2FeREC%2FJobSearch%3FsortBy%3D%26order%3D%26page%3D1%26searchKey%3D%26category%3D9020%26workExp%3D0011%26branch%3D%26program%3D30) :::spoiler Job description #### **Minimum qualifications:** - 嵌入式系統 (Embedded System) / Computer Organization & Architecture (計算機組織 & 結構) / 作業系統 (Operating System) / 資料結構 (Data Structure) / 程式語言 (Programming Language #### **Preferred qualifications:** - RTOS (Real-time Operating System) / Linux / Android ::: #### 符合技術能力 - 具備: 嵌入式系統 (Embedded System) / Computer Organization & Architecture (計算機組織 & 結構) / 作業系統 (Operating System) 相關課程經驗 #### 不符合 - 缺少: Android 相關課程經驗 2. [Camera/ Smart Display /Multimedia/Audio/Video](https://careers.mediatek.com/eREC/JobSearch/JobDetail/MTK120240902001?returnUrl=%2FeREC%2FJobSearch%3FsortBy%3D%26order%3D%26page%3D3%26searchKey%3D%26category%3D%26workExp%3D0011%26branch%3D0000009256%26program%3D) :::spoiler Job description #### **Minimum qualifications:** - 多媒體相關課程(Multi-Media)、影像處理原理 (Image Processing)、作業系統原理(Operation system)、物件導向程式設計(C++)、Computer Vision、Image Processing、Software Engineering、Data Structure、Algorithm、Operation system、Multi-Thread Programming 、Digital Signal Processing、Computer Architecture #### **Preferred qualifications:** - 有 Linux kernel driver開發或Linux kernel/open source upstream經驗者佳 ::: #### 符合技術能力 - 具備: 影像處理原理 (Image Processing)、作業系統原理(Operation system)、物件導向程式設計(C++) #### 不符合 - 缺少: 多媒體相關課程(Multi-Media)、Multi-Thread Programming Skill、Computer Graphics 相關課程經驗 ### 自我評估與改進方向 #### 需加強的能力 - 每一個職缺都十分重視 C/C++ ,因此仍需要每天刷題並熟練經典的資料結構和演算法等基礎能力 - [grid75](https://www.techinterviewhandbook.org/grind75/) - [Top Interview 150](https://leetcode.com/studyplan/top-interview-150/) - [你所不知道的 C 語言系列講座](https://hackmd.io/@sysprog/c-prog/%2F%40sysprog%2Fc-programming) - 對於Hadoop, Spark等 **Parallel Computing** 技術不熟 - 沒有系統整合、雲端計算之相關經驗 - 對於 UNIX/Linux 系統沒有真正接觸過大型專案,後續有時間會嘗試投入 open source ## 模擬面試 interviewer: 你會將使用哪種資料結構來尋找是否有重組字?例如如果資料庫中存在單字“top”,則對“pot”的查詢應該列出該單字。 interviewee: 讓我確認一下題目的要求,我需要在一個資料庫中找到所有和要查詢單字使用相同字母組合的單字,例如資料庫中有"top",查詢"pot"時應該要能找到"top",基本上就是要能快速找出所有字母相同但排序不同的單字是嗎? interviewer: 是的,你的理解很正確 interviewee: 我直覺的想法是使用 hash map 來做為主要資料結構,其中 key 為排序後的單字, value 為擁有相同字母的單字集合。查詢時,先將查詢的單字做字母排序,再用這個排序後的字串當key去查找。這樣的作法插入和查詢的時間複雜度為 $O(KlogK + 1)$,因為對於長度為 $K$ 的單字 排序需要 $O(KlogK)$,而最後查詢單字是否在 hash map 中需要 $O(1)$,另外空間複雜度: O(N),其中 N 是所有單字的總長度。 以下為我的實作: ```c class AnagramIndex { private: unordered_map<string, vector<string>> wordMap; // 將單字轉換成排序後的形式 string getSortedStr(const string& word) { string sorted = word; sort(sorted.begin(), sorted.end()); return sorted; } public: // 插入單字到索引中 void insert(const string& word) { string sorted = getSortedStr(word); wordMap[sorted].push_back(word); } // 查詢單字的所有重組字 vector<string> query(const string& word) { string sorted = getSortedStr(word); if (wordMap.find(sorted) != wordMap.end()) { return wordMap[sorted]; } return vector<string>(); } }; ``` interviewer: 這個實作沒有問題,不過我認為更改成其他資料結構可以只需 $O(K)$,請問你有麼想法嗎? interviewee: 剛才的實作效能瓶頸主要來自於排序,不過英文字母只有 26 個,如果我們將排序改為使用大小為 26 的陣列計數,並將這個計數陣列轉換成一個特殊的字串作為 key,就可以將 $O(KlogK)$ 降低至 $O(logK)$,空間複雜度維持 O(N)。 具體實作如下: ```c class AnagramIndex { private: unordered_map<string, vector<string>> wordMap; // 將單字轉換成頻率字串 string getFrequencyStr(const string& word) { vector<int> freq(26, 0); // 假設只處理小寫字母 // 計算每個字母出現的次數 for (char c : word) { freq[c - 'a']++; } // 將頻率陣列轉換成字串 // 使用 '#' 作為分隔符,避免 "1,1" 和 "11" 這樣的衝突 string key; for (int count : freq) { key += to_string(count) + '#'; } return key; } public: // 插入單字到索引中 void insert(const string& word) { string key = getFrequencyStr(word); wordMap[key].push_back(word); } // 查詢單字的所有重組字 vector<string> query(const string& word) { string key = getFrequencyStr(word); if (wordMap.find(key) != wordMap.end()) { return wordMap[key]; } return vector<string>(); } }; ``` ## 相關面試題目 #### 台積電 主要面試流程分為: 1. HackerRank 測驗(需達 125 分硬性門檻) - median, 50 Score - median, 50 Score - Hard, 75 Score 2. 主管面試 3. 實廠適性、英文測驗 (5 年內有考過 TOEIC 相關英文證照則免考英文) 4. HR 面試 5. 資歷審核 ## 參考資料 - [2022 台積電 TSMC IT 面試經驗 (BSID/TSID)](https://blog.jhdev.pro/posts/2024-06-01-2022-tsmc-it-interview/) - [面試時的反問](https://github.com/NeroCube/reverse-interview-zh-tw) - [台灣Google FW 面試分享](https://www.dcard.tw/f/tech_job/p/255865389?cid=751E1D5A-8226-4894-980F-7F5DA2D4D61A) - [台積電 IT Engineer 面試經驗紀錄 [失敗案例供參]](https://hackmd.io/@zz8yeJXcQYOjqL6CsPNdlg/SJLwCLC-3) - [TSMC Diary](https://hackmd.io/@ZzYkZtacRfym2ZnnPS4GzA/Bki1GwvM5)

    Import from clipboard

    Paste your markdown or webpage here...

    Advanced permission required

    Your current role can only read. Ask the system administrator to acquire write and comment permission.

    This team is disabled

    Sorry, this team is disabled. You can't edit this note.

    This note is locked

    Sorry, only owner can edit this note.

    Reach the limit

    Sorry, you've reached the max length this note can be.
    Please reduce the content or divide it to more notes, thank you!

    Import from Gist

    Import from Snippet

    or

    Export to Snippet

    Are you sure?

    Do you really want to delete this note?
    All users will lose their connection.

    Create a note from template

    Create a note from template

    Oops...
    This template has been removed or transferred.
    Upgrade
    All
    • All
    • Team
    No template.

    Create a template

    Upgrade

    Delete template

    Do you really want to delete this template?
    Turn this template into a regular note and keep its content, versions, and comments.

    This page need refresh

    You have an incompatible client version.
    Refresh to update.
    New version available!
    See releases notes here
    Refresh to enjoy new features.
    Your user state has changed.
    Refresh to load new user state.

    Sign in

    Forgot password

    or

    By clicking below, you agree to our terms of service.

    Sign in via Facebook Sign in via Twitter Sign in via GitHub Sign in via Dropbox Sign in with Wallet
    Wallet ( )
    Connect another wallet

    New to HackMD? Sign up

    Help

    • English
    • 中文
    • Français
    • Deutsch
    • 日本語
    • Español
    • Català
    • Ελληνικά
    • Português
    • italiano
    • Türkçe
    • Русский
    • Nederlands
    • hrvatski jezik
    • język polski
    • Українська
    • हिन्दी
    • svenska
    • Esperanto
    • dansk

    Documents

    Help & Tutorial

    How to use Book mode

    Slide Example

    API Docs

    Edit in VSCode

    Install browser extension

    Contacts

    Feedback

    Discord

    Send us email

    Resources

    Releases

    Pricing

    Blog

    Policy

    Terms

    Privacy

    Cheatsheet

    Syntax Example Reference
    # Header Header 基本排版
    - Unordered List
    • Unordered List
    1. Ordered List
    1. Ordered List
    - [ ] Todo List
    • Todo List
    > Blockquote
    Blockquote
    **Bold font** Bold font
    *Italics font* Italics font
    ~~Strikethrough~~ Strikethrough
    19^th^ 19th
    H~2~O H2O
    ++Inserted text++ Inserted text
    ==Marked text== Marked text
    [link text](https:// "title") Link
    ![image alt](https:// "title") Image
    `Code` Code 在筆記中貼入程式碼
    ```javascript
    var i = 0;
    ```
    var i = 0;
    :smile: :smile: Emoji list
    {%youtube youtube_id %} Externals
    $L^aT_eX$ LaTeX
    :::info
    This is a alert area.
    :::

    This is a alert area.

    Versions and GitHub Sync
    Get Full History Access

    • Edit version name
    • Delete

    revision author avatar     named on  

    More Less

    Note content is identical to the latest version.
    Compare
      Choose a version
      No search result
      Version not found
    Sign in to link this note to GitHub
    Learn more
    This note is not linked with GitHub
     

    Feedback

    Submission failed, please try again

    Thanks for your support.

    On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

    Please give us some advice and help us improve HackMD.

     

    Thanks for your feedback

    Remove version name

    Do you want to remove this version name and description?

    Transfer ownership

    Transfer to
      Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

        Link with GitHub

        Please authorize HackMD on GitHub
        • Please sign in to GitHub and install the HackMD app on your GitHub repo.
        • HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.
        Learn more  Sign in to GitHub

        Push the note to GitHub Push to GitHub Pull a file from GitHub

          Authorize again
         

        Choose which file to push to

        Select repo
        Refresh Authorize more repos
        Select branch
        Select file
        Select branch
        Choose version(s) to push
        • Save a new version and push
        • Choose from existing versions
        Include title and tags
        Available push count

        Pull from GitHub

         
        File from GitHub
        File from HackMD

        GitHub Link Settings

        File linked

        Linked by
        File path
        Last synced branch
        Available push count

        Danger Zone

        Unlink
        You will no longer receive notification when GitHub file changes after unlink.

        Syncing

        Push failed

        Push successfully