꾸준함이 실력입니다.

• [시스템 설계 (System Design) - 한번에 인터뷰 합격하기] 2강 : 빅데이터를 활용한 작업

  2023-06-20

  goodGid

  SystemDesign
  • 메시지 큐
    • SQS (Simple Queue Service)

  이 글은 강의 내용을 토대로 작성하였습니다.

  ---

  메시지 큐

  

  SQS (Simple Queue Service)

  • ex) AWS SQS 서비스
  Read All

  ---

• [시스템 설계 (System Design) - 한번에 인터뷰 합격하기] 1강 : 확장 가능한 시스템 설계

  2023-06-19

  goodGid

  SystemDesign
  • ACID 준수와 CAP 정리

  이 글은 강의 내용을 토대로 작성하였습니다.

  ---

  ACID 준수와 CAP 정리

  

  • 일관성 (Consistency)

    = Write 이후 Read 시 바로 값을 조회할 수 있느냐?

  • 가용성 (Availability)

    = 단일 고장 점(single point of failure, SPOF)이 존재하는가?

  • 분할 허용성 (Partition Tolerance)

    = 수평 스케일링이 쉽게 가능한가?

  Read All

  ---

• LeetCode : 448. Find All Numbers Disappeared in an Array

  2023-06-17

  goodGid

  LeetCode
  • 448. Find All Numbers Disappeared in an Array
    • Problem

  448. Find All Numbers Disappeared in an Array

  Problem

  Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
  
  Follow up: Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
  

  Read All

  ---

• LeetCode : 209. Minimum Size Subarray Sum

  2023-06-10

  goodGid

  LeetCode
  • 209. Minimum Size Subarray Sum
    • Problem

  209. Minimum Size Subarray Sum

  Problem

  Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarray, return 0 instead.
  

  Read All

  ---

• LeetCode : 1189. Maximum Number of Balloons

  2023-06-10

  goodGid

  LeetCode
  • 1189. Maximum Number of Balloons
    • Problem

  1189. Maximum Number of Balloons

  Problem

  Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.
  You can use each character in text at most once. Return the maximum number of instances that can be formed.
  

  Read All

  ---

• LeetCode : 658. Find K Closest Elements

  2023-06-04

  goodGid

  LeetCode
  • 658. Find K Closest Elements
    • Problem

  658. Find K Closest Elements

  Problem

  Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
  
  An integer a is closer to x than an integer b if:
  
  |a - x| < |b - x|, or
  |a - x| == |b - x| and a < b
  

  Read All

  ---