Leetcode Day 2: Check If Two String Arrays are Equivalent

preview_player
Показать описание
Leetcode #1662
Рекомендации по теме
Комментарии
Автор

Day 2 down, forgot to speak on the time and space complexity. The time complexity of this would be O(n) because of the .join function going through n strings in the array. The space complexity would be O(1). Have a good one yall

leetcodeaday
visit shbcf.ru