Skip to content

daily 30일차 2Q 지호 #99

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: main
Choose a base branch
from
Open

daily 30일차 2Q 지호 #99

wants to merge 5 commits into from

Conversation

jihostudy
Copy link
Member

Day-30 / 김지호

문제 번호

  1. Leetcode_4. Median of Two Sorted Arrays
  2. Leetcode_34. Find First and Last Position of Element in Sorted Array

(Optional) 공유하고 싶은 내용

4번이 Hard문제인데.. 상태가????

@jihostudy jihostudy linked an issue Jul 30, 2024 that may be closed by this pull request
Copy link

우측에 있는 Projects, Milestone, Development를 확인 후 할당 해주세요~! 🙇

Copy link
Contributor

@summer2788 summer2788 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

왕왕 그런경우가 있죠 . 수고하셨습니다

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Status: No status
Development

Successfully merging this pull request may close these issues.

[DAILY] 30일차
2 participants