All
Easy
Medium
Hard
Completed
Attempted
Unattempted
Coding Challenges
MCQ Assignments

Two Sum

easy Arrays 50 pts

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Time: 5000ms • Memory: 256MB

Valid Palindrome

easy Strings 40 pts

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward.

Time: 5000ms • Memory: 256MB

Longest Substring

medium Strings 100 pts

Given a string s, find the length of the longest substring without repeating characters.

Time: 5000ms • Memory: 256MB

Recursive Cache Amplification

hard Hash Table 150 pts

Design a recursive cache invalidation scheme that maximizes amplification...

Time: 10000ms • Memory: 512MB

JavaScript Fundamentals Test

20 Questions • 30 Minutes

Data Structures Basics

15 Questions • 20 Minutes

TCS NQT Quantitative Aptitude

20 Questions • TCS PrepInsta Pattern

Two Sum easy
onclick="closeIDE()">
Description
Hints 0/2

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

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]
Python
JavaScript
C++ COMING SOON
Java COMING SOON
Console Output
> Ready to run...