Day 3/45
Data Structure and Algorithms
Solved leetcode 1455 which was to find if a given word is a prefix of any word in the sentece. We did it by storing each word of the given sentence in a vector and then iterating over each character of each word checking if its possible ornot
Web development
Learned about primitive and non-primitive data types in js, why is primitive is immutable and why non-primitive in mutable/ How are they stored in the memory, the concept of heap and stack memory, and how exactly js stores data in heap and stack, what is a symbol table