How to Solve the 2 sums Challenge in c++ (Brute Force)
I did this video a while back and did not expect to re-upload this making it the first video on this channel. I also like to think I am not a very good teacher so I do apologize in advance. This is not only to help you but to help me as well to make sure I understand and mostly remember what I do.
This challenge is to find the 2 indexes of a given array that equal a target. This video covers the brute force way of solving it.
For example: given an array [1, 3, 7, 8], we want a target of 9, meaning two indexes must equal 9. That would be 0 and 3 in this case, so we would return 0, 3 for the challenge.
My videos are uploaded to Youtube as well.
This video: https://youtu.be/T9TlCJlywQg
*******Support the Channel*******
My Website : https://jstroup.dev/blog
Buy on Amazon : https://amzn.to/38rl8Y2
-
10:17
Jeff Stroup
3 years agoHow to Solve the 2 sums Challenge in c++ (Improvement)
16 -
2:43
ericntunctu
2 years agoLeetcode solving 1837 Sum of Digits in Base K
2 -
1:49
ericntunctu
2 years ago1508 Range Sum of Sorted Subarray Sums
2 -
1:11
GameHounds
11 months agoC Program 5 : Summing N Numbers using WHILE Loop
1 -
3:23
ericntunctu
1 year agoleetcode 1524 Number of Sub arrays With Odd Sum
4 -
1:48
ericntunctu
2 years agoLeetcode 373 Find K Pairs with Smallest Sums
-
2:53
ericntunctu
2 years agoLeetcode 1524 Number of Sub arrays With Odd Sum
5 -
1:24
ericntunctu
2 years agoLeetcode 2180 Count Integers With Even Digit Sum
6 -
13:35
FullMontyCoding
2 years agoTwo Sum Leetcode Python
172 -
1:50
ericntunctu
2 years agoLeetcode solving: 1287 Element Appearing More Than 25% In Sorted Array
1