Daily Challenge
October 6, 2025
Two Sum
Find two numbers in an array that add up to a target sum.
Problem Statement
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.
Examples
Input:
nums = [2,7,11,15], target = 9Output:
[0,1]Explanation:
Because nums[0] + nums[1] == 9, we return [0, 1].
Input:
nums = [3,2,4], target = 6Output:
[1,2]Explanation:
Because nums[1] + nums[2] == 6, we return [1, 2].
Previous Daily Challenges
Personal Finance Tracker
Build a comprehensive personal finance tracking application.
E-commerce Inventory Management System
Build a complete inventory management system for an e-commerce platform.
Chat Application with Real-time Features
Build a real-time chat application with user authentication and message history.
Longest Common Subsequence
Find the length of the longest common subsequence between two strings.
Build a URL Shortener
Create a URL shortening service like bit.ly with analytics and custom domains.
Social Media Analytics Dashboard
Build a comprehensive social media analytics dashboard with data visualization.