728x90
๋ฐ์ํ
1209. Remove All Adjacent Duplicates in String II
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together. We repeatedly make k duplicate removals on s until we no longer can. Return the final string after all such duplicate removals have be..
Algorithm/LeetCode Daily Challenge
2022. 5. 19. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 83,835
- Today
- 55
- Yesterday
- 439
๋งํฌ
TAG
- @ManyToOne
- Spring Boot Tutorial
- leetcode
- leetcode bst
- spring boot application
- Spring Data JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot app
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ jwt
- leetcode stack
- JPA
- ์๊ณ ๋ฆฌ์ฆ
- spring boot jwt
- QueryDSL
- Jackson
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- intellij
- Java
- r
- gRPC
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- JSON
- leetcode binary search
- Linux
- Spring Boot