filmov
tv
Two sum problem in Swift #swift #datastructuresandalgorithms #twosum
Показать описание
Hey! Welcome to The Dummy Programmer! Thrilled to have you here!
I am working through all the problems on Leetcode to prepare for my technical interviews and I am recording these videos so I can chart my progress. The solutions are in Swift! I hope it helps you too! If it does, please like the video. Thank you for tuning in!
In this video, I have worked on two sum problem. I forgot to mention the time and space complexity. Since we walk through the array once here the time complexity is O(n) where n is the number of items in the input array. The time complexity is also O(n) because we use a dictionary to store the complement of every number in the array. In the worst case where no pairs exist, the dictionary will have as many elements as in the input array i.e., n.
I am working through all the problems on Leetcode to prepare for my technical interviews and I am recording these videos so I can chart my progress. The solutions are in Swift! I hope it helps you too! If it does, please like the video. Thank you for tuning in!
In this video, I have worked on two sum problem. I forgot to mention the time and space complexity. Since we walk through the array once here the time complexity is O(n) where n is the number of items in the input array. The time complexity is also O(n) because we use a dictionary to store the complement of every number in the array. In the worst case where no pairs exist, the dictionary will have as many elements as in the input array i.e., n.
0:17:33
0:00:42
0:03:58
0:05:00
0:03:44
0:08:12
0:02:02
0:15:03
0:10:31
0:08:23
0:06:46
0:09:01
0:08:23
0:08:00
0:01:54
0:08:41
0:10:42
0:01:47
0:13:24
0:03:55
0:11:01
0:03:33
0:03:37
0:09:42