Skip to content
View zqh0421's full-sized avatar
😼
Coding
😼
Coding
2 followers · 1 following

Achievements

Achievement: QuickdrawAchievement: Pull Shark
BetaSend feedback

Achievements

Achievement: QuickdrawAchievement: Pull Shark
BetaSend feedback
Block or Report

Block or report zqh0421

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
zqh0421/README.md

Hi there! 👋 I'm Qianhui (Chloe),

a final year undergraduate student hoping to engage in Human-Computer Interaction area, currently based in Beijing, China. My research interest mainly focuses on Human-AI Collaboration, Intelligent User Interface, Human-Centered AI and User Experience.

  • 📫 How to reach me: chloezqh0421@gmail.com | qzhao3@nd.edu
  • 😄 Pronouns: she/her/they/them
  • ⚡️ Fun fact: Living with my pet🐱, a 5-year-old cute girl named 脸脸 (which means cute face).
  • 🌈 Briefly describe my personality: Empathetic, Energetic, forever in tune, always ready to explore something new soon!

Portfolio

Have a look at my personal website built with React & Astro here.

Stats

Popular repositories

  1. MuseumX MuseumX Public

    JavaScript 5 2

  2. codegpt codegpt Public

    TypeScript 2 1

  3. Find-Shortest-Path Find-Shortest-Path Public

    A shortest path finding project using BFS, DFS and A* algorithms, is developed with python3.9 and PyQt6.

    Python 1

  4. zqh0421.github.io zqh0421.github.io Public

    TypeScript 1

  5. byte-design-1 byte-design-1 Public

    Forked from zianlun/byte-design

    组件库设计

    TypeScript 1 1

  6. DataStructuresLab DataStructuresLab Public

    Forked from addy689/DataStructuresLab

    Graph Traversal (BFS & DFS), Single Source Shortest Path, Minimum Spanning Tree, RB Trees, B-Trees

    C