Topics: Strings and Arrays

• Arrays: ordered lists of items often used for sequential lists
• Strings: sequences of character data.

Required tasks

Strings

• [ x] Read String Questions in Interviews.
  • Using a few sentences, describe what you've learned.
• Watch Memoization and Dynamic Programming video
  • Using a few sentences, describe what you've learned.
    • By using memoization we can speed up our program by storing results of functions that will be repeted multiple times. Instead of running the function each time we store the result and we recall it later when needed.
• [ x] Watch Anagram Problem Solution video
  • Using a few sentences, describe what you've learned.

Arrays

• Read Sorting Algorithms
  • Can you memorize one algorithm? What is it?
• [ x] Watch Introduction to Sorting video
  • Using a few sentences, describe what you've learned.
    • the importance of sorting is to allow faster searches. we can classify them by time and space complexity, by stability and by internal and external sort and recursive and non recursive
• [x ] Watch Merge Sort video
  • Using a few sentences, describe what you've learned
    • a merge sort works by dividing the list to sort into smaller units and compare each one of them with the adjacent one and then merge them, repeating this process until all the list is sorted

Coding

• [ x] Set up exercism and complete at least 2 exercises using exercism submit.

Optional tasks

• Do more tasks on exercism
• Set up an account on Interviewbit.com and start the Programming course
• Finish Time Complexity chapter in Level 1 of Interviewbit
• Finish Arrays chapter in Level 2 of Interviewbit
• Finish Math chapter in Level 2 of Interviewbit.

Optional