본문 바로가기 메뉴 바로가기

Jaime's 기술 블로그

프로필사진
  • 글쓰기
  • 관리
  • 태그
  • 방명록
  • RSS

Jaime's 기술 블로그

검색하기 폼
  • All (499)
    • IntelliJ IDEA (8)
    • SpringBoot (83)
      • Web Application 만들기 (71)
      • JWT 튜토리얼 (5)
    • Java (19)
    • JPA (33)
    • Querydsl (14)
    • SRE (7)
    • gRPC (10)
    • macOS (7)
    • Docker (1)
    • Linux (5)
    • R (5)
    • Test (3)
    • ETC (13)
    • Algorithm (265)
      • LeetCode (258)
    • Retrospect (4)
    • git (1)
    • Architecture (8)
    • Book (10)
      • 함께 자라기 (7)
      • 프로그래머의 뇌 (3)
    • Essay (1)
  • 방명록

All (499)
[LeetCode] 139. Word Break

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary may be reused multiple times in the segmentation. Example 1: Input: s = "leetcode", wordDict = ["leet","code"] Output: true Explanation: Return true because "leetcod..

Algorithm/LeetCode 2023. 7. 12. 00:27
[LeetCode] 3. Longest Substring Without Repeating Characters

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with..

Algorithm/LeetCode 2023. 7. 11. 00:36
[LeetCode] 49. Group Anagrams

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","t..

Algorithm/LeetCode 2023. 7. 10. 03:37
[LeetCode] 1143. Longest Common Subsequence

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "a..

Algorithm/LeetCode 2023. 7. 9. 03:00
[LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree. Example 1: Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7] Output: [3,9,20,null,null,15,7] Example 2: Input: preorder = [-1], inorder = [-1] Output: [-1] C..

Algorithm/LeetCode 2023. 7. 8. 01:49
[LeetCode] 45. Jump Game II

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where: 0

Algorithm/LeetCode 2023. 7. 7. 04:31
[LeetCode] 199. Binary Tree Right Side View

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: Input: root = [1,2,3,null,5,null,4] Output: [1,3,4] Example 2: Input: root = [1,null,3] Output: [1,3] Example 3: Input: root = [] Output: [] Constraints: The number of nodes in the tree is in the..

Algorithm/LeetCode 2023. 7. 6. 03:31
[LeetCode] 152. Maximum Product Subarray

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. Example 1: Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: nums = [-2,0,-1] Output: 0 Explanation: The result cannot be 2, because [-..

Algorithm/LeetCode 2023. 7. 5. 02:21
[LeetCode] 72. Edit Distance

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three operations permitted on a word: Insert a character Delete a character Replace a character Example 1: Input: word1 = "horse", word2 = "ros" Output: 3 Explanation: horse -> rorse (replace 'h' with 'r') rorse -> rose (remove..

Algorithm/LeetCode 2023. 7. 4. 03:54
[LeetCode] 146. LRU Cache

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return -1. void put(int key, int value) Update the value of the key if the key exists. Ot..

Algorithm/LeetCode 2023. 7. 3. 03:24
이전 1 2 3 4 5 6 7 ··· 50 다음
이전 다음
공지사항
최근에 올라온 글
최근에 달린 댓글
Total
Today
Yesterday
링크
  • github
TAG
  • spring boot app
  • 함께 자라기 후기
  • spring boot jwt
  • 스프링 부트 회원 가입
  • r
  • JPA
  • gRPC
  • Spring Boot JPA
  • 스프링 부트 애플리케이션
  • 클린 아키텍처
  • 스프링 데이터 jpa
  • 알고리즘
  • Spring Data JPA
  • intellij
  • leetcode
  • Spring Boot Tutorial
  • 스프링부트
  • Java
  • Spring Boot
  • QueryDSL
  • 스프링 부트 튜토리얼
  • Linux
  • JSON
  • Jackson
  • 함께 자라기
  • 스프링 부트
  • proto3
  • 헥사고날 아키텍처
  • spring boot application
  • @ManyToOne
more
«   2025/07   »
일 월 화 수 목 금 토
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31
글 보관함

Blog is powered by Tistory / Designed by Tistory

티스토리툴바