thiendn160794 / assignment-5 Goto Github PK

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

Strings

• Read String Questions in Interviews.
  • Strings are immutable. To reverse string, we need a temporary variable.
  • We can use recursion for permutation of a string.
  • The most common interview questions:
    • Generate all permutations of a given String
    • Substrings of a given String
    • Determine if one string is a permutation of another
    • Reversing Strings
    • Replacements and Deletions
    • String Compression Will try to solve by myself after.
• Watch Memoization and Dynamic Programming video
  • Fibonaci function has big(O) = O(2^n).
  • We can improve by memorization with big(O) = O(n).
• Watch Anagram Problem Solution video
  • 2 strings are called anagrams: same letters, same counts, different orders.

Arrays

• Read Sorting Algorithms
  • I'm sorry but no link at 'Read Sorting Algorithms'. The only sort algorithm I remember is bubble sort. After view below video, I suddenly remember linear sort.
• Watch Introduction to Sorting video
  • Sort is a very useful feature nowaday.
• Watch Merge Sort video
  • Merge sort using recusion.
  • Merge(array){ Merge(arrayLeft); Merge(arrayRigiht); (Merge(arrayLeft) + Merge(arrayRight)).sortOrder; }

Coding

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

• 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