Learning Journey
Data Structures & Algorithms
Step 1: Learn the basics30/31
Introduction to Data Structures✓
Time and Space Complexity✓
Big O Notation✓
Step 2: Learn Important Sorting Techniques3/7
Step 3: Solve Problems on Arrays [Easy → Medium → Hard]21/40
Step 4: Binary Search [1D, 2D Arrays, Search Space]0/32
Step 5: Strings [Basic and Medium]0/15
Step 6: Learn LinkedList [Single LL, Double LL, Medium, Hard Problems]0/31
Problem: Two Sum
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
CPP
Run your code to see output here