All is Possible :)

All is possible!

udemy: Ace Your Coding Interview & Land Your Dream Programming Job

Leave a comment


Online Course를 찾아보던 중에 발견한 사이트. Udemy

여러 사이트들이 있는데, 내가 원하는 Course가 있는 사이트. (다른 Online Course들도 많은데, 더 알아보기!)

그리고 바로 구입한 “Ace Your Coding Interview & Land Your Dream Programming Job”

다행이 아래 링크를 통해서 들어가면 25$ 밖에 안함.

오늘부터 100% 수강이 될 때까지, 공부하면서 정리하도록 하자!

그리고 강의 참고물들도 꼼꼼하게 보면서 내 것으로 만들 수 있도록!

오늘 내용 정리:

  • Establishing an Online Presence
    • Linkedin : Ask for recommendations as you leave positions
  • Choosing a Programming Language for Interviews
    • If you’re going with Java, for example, and applying to Amazon, where Java is used heavily, consider reading through some of the best practices material.
    • Amazon: Java, Javascript, Ruby, Python, Perl (

수업 내용 중 기억에 남는 말들:

“You should plan on working 60 hours per week. The first 40 are for your employer. The remaining 20 are for you. During this remaining 20 hours you should be reading, practicing, learning, and otherwise enhancing your career.” – “Uncle” Bob Martin, author of Clean Code

  • Section6 Data Structures
    • Linked Lists, Arrays, BST, Tries
    • Hash Table Problem 1. Ransom note
      • public boolean canRansom(String ransom, String magazine);
  • Section7 Algorithms
    • Tree Traversals
      • DST : 스택 이용 또는 recursive function
        • preorder : Tree를 copy데 사용
        • inorder : BST를 특정 순서로 출력하는데 사용
        • postorder
      • BST : 큐 이용
      • Grapsh와 Tree의 차이점 : Cycle 존재 여부, 때문에 visit 할 때 visit 여부를 체크해야 한다
    • Sort : Merge Sort, Quick Sort
  • Section8 Algorithmic Problem Solving
    • Recursion : Divide and Conquer
      • 1) Sub problem breakdown : 몇 개의 step으로 나눠지는지
      • 2) base case : null, empty 체크 등
      • recursively defined data structures : BST, Linked list
      • Approach : Bottom-up, Top-down
      • recursive vs iterative
        • speed 안 좋음, overhead 존재
        • space 많이 필요
        • repeating work -> dynamic programming
      • Examples :Fibonacci
    • Dynamic Programming
      • Recusive한 방법을 memoization을 통해 dynamic으로 해결 할 수 있다
    • Bit Manipulation : And, OR, XOR, NOT, LEFT SHIFT, RIGHT SHIFT
  • Section9 Design Patterns and Architecture
    • Singleton, Factory
  • Section10 Software Concepts
  • Section11 Quick Wrap up

Author: hyogij

All is Possible!

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s