Please enable JavaScript.

Coggle requires JavaScript to display documents.

Cracking the coding interview: 150 questions and solutions - Coggle Diagram

- - - - build side project
        
        expand network
        
        build website/portfolio
        showcasing
        
        focus work on "meaty" project
    - - try to add on
        one more project
        
        create draft of resume and
        send it out for resume review
        
        make target list of
        preferred companies
        
        read intro sections of Cracking the coding interview
        
        begin practicing
        interview questions
        
        form mock interview group with
        friends to interview each other
    - - Do mini-projects to solidify
        understanding of key concepts
        
        Do several mock interviews
        
        Create list to track mistakes
        you've made solving problems.
    - - create interview prep grid
        
        review/update resume.
        
        re-read intro to CtCi, especial tech & behavioral section,
        
        practice questions, writing code on paper
    - - onsite interview
        
        phone interview
        
        Do a final mock interview
        
        rehearse stories from the interview prep grid
        
        re-read 5 algorithm approaches
        
        continue to practice interview questions
        
        1 more item...
    - - Rehearse each story from interview prep grid once.
        
        continue to practice questions &
        review your list of mistakes
        
        re-read 5 algorithm approaches.
        Make sure remember them
        
        review powers of 2 list. Print list if a phone screen
    - - be on time and confident
    - - Write thanks you note to recruiter
        
        check in after 1 week
        if not information from recruiter
        
        if no offer, ask when you can re-apply. don't give up hope
- - - - "Tell me about a time when you...,"
        
        Most Challenging
        
        What You Learned
        
        Most Interesting
        
        Hardest Bug
        
        Enjoyed Mos
        
        Conflicts with Teammates
    - - Genuine Questions
      - Insightful Question
      - Passion Question
  - - - S.A.R. (Situation, Action, Result)
- - - - try to solve problem by your own
      - write on the paper
      - test you code on paper
      - type your paper cade as is into a computer
    - - must-have to knowledge table
      - powers of 2 table
  - - - Correct
      - Efficient
      - Simple
      - readable
      - maintainable
- - - - hash tables
      - string buffer
      - array list (Dynamically resizing array)
    - - Creating a Linked List
      - Deleting a node
      - the runner technique
      - recursive problems
    - - implementing a stack
      - implementing a queue
    - - Potential Issues to Watch Out For
        
        Binary Tree vs. Binary Search Tree
        
        Balanced vs. Unbalanced
        
        Full and Complete
      - Binary Tree Traversal
      - Tree Balancing: Red-Black Trees and AVL Trees
      - Tries
      - Graph Traversal
        
        Breadth First Search
        
        Depth First Search (DFS)
  - - - Bit Manipulation By Hand
      - Bit Facts and Tricks
      - Common Bit Tasks: Get, Set, Clear, and Update Bit
    - - Prime Numbers
        
        Divisibility
        
        Checking for Primality
      - Probability
        
        A and B
        
        A or B
        
        Independence
        
        Mutual Exclusivity
    - - How to Approach OOD Questions
        
        step1: handle ambiguity ( six Ws: who, what, where, when, how, why)
        
        step 2: Define the core objects
        
        step 3: analyze, relationships
        
        step4: Investigate actions
      - Design patterns
        
        singleton
        
        factory
    - - How to Approach Recursion
        
        Bottom-Up Recursion
        
        start solve to simplest case
        
        Top-down
        
        think about dividing problem for case in into sub problems with overlap between case
      - Dynamic Programming problem
      - Recursive vs. Iterative Solutions
    - - The Step-By-Step Approach
        
        Step 1: Make Believe
        
        Step 2: Get Real
        
        Step 3: Solve Problems
      - : Information, Strategies and Issues
        
        A Typical System
        
        Dividing Up Lots of Data
        
        By Order of Appearance
        
        Hash Value
        
        Actual Value
        
        Arbitrarily
    - - Common Sorting
        
        Bubble Sort \ 0(n2) average and worst case. Memory: 0(1).
        
        Selection Sort \ 0(n2) average and worst case. Memory: 0(1).
        
        Merge Sort \ 0(n Log(n)) average and worst case. Memory: Depends.
        
        Quick Sort | Runtime: 0(n Log (n)) average, 0(n2) worst case. Memory: 0( Log (n) )
        
        Radix Sort Runtime: 0(kn)
      - Searching
        
        binary search
    - - interviewers want to test the following
        
        Big Picture Understanding
        
        Knowing How the Pieces Fit Together Organizatio
        
        Organization
        
        Practicality
      - Testing a Real World Object
        
        Step 1: Who will use it? And why
        
        Step 2: What are the use cases?
        
        Step 3: What are the bounds of use?
        
        Step 4: What are the stress/failure conditions?
        
        Step 5: How would you perform the testing?
      - Testing a Piece of Software
      - Testing a Function
      - Troubleshooting Question
  - - - SQL Syntax and Variations
      - Denormalized vs. Normalized Databases
      - SQL Statements
      - Small Database Design
      - Large Database Design