• Exercises
  • Multiple Choice
  • Articles
  • Open Problems
  • Login
1 items
Tagged:
  • searching x

Start over - to expand, or dig in by adding more tags and revising the query.

Sort By: trending ▼ date
0
Undergraduate
By Shiva Kintali on May 19, 2013 | Updated Dec. 6, 2017

Finding two elements

Design a \(\Theta(n{\log}n)\)-time algorithm that, given a set \(S\) of \(n\) integers and another integer \(x\), determines whether or not there exist two elements in \(S\) whose sum is exactly \(x\)…
  • Computer Science
  • Algorithms
  • searching
  • sorting
  • icon Sign In or Sign Up
  • icon Invite Friends
Post Something
x

Select What You'd Like To Post

POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION

Content Types

  • Articles
  • Open Problems
  • Exercises
  • Multiple-Choice Questions

Levels

  • High school
  • Undergraduate
  • Graduate

Subjects

  • Mathematics
  • Computer Science
  • Puzzles
  • Optimization

Trending tags

  • trees
  • dynamic programming
  • polynomials
  • infinite series
  • digraphs
  • fermats little theorem
  • asymptotic analysis
  • differentiation
  • integration
  • jee

Topics

  • Algebra
  • Algorithms
  • Approximation Algorithms
  • Calculus
  • Combinatorial Optimization
  • Combinatorics
  • Complexity Theory
  • Data Structures
  • Discrete Mathematics
  • Game Theory
  • Geometry
  • Graph Theory
  • Linear Algebra
  • Linear Programming
  • Logic
  • Mathematical Analysis
  • Mathematics
  • Matrix Theory
  • Number Theory
  • Optimization
  • Probability
  • Programming
  • Puzzles
  • Randomized Algorithms
  • Real Analysis
  • Trigonometry
Home
Team Terms of Service Privacy Policy Careers Contact Us
Tags Topics IIT JEE Problems International Mathematical Olympiad
Twitter Instagram Slack Telegram
Social learning platform. © 2016 True Group Inc. All Right Reserved