Skip to content

EasyAlgorithms

Algorithms, Data Structures, Software Engineering

  • Home
  • Contact

Category: multiset

Problem: Find all pairs

May 16, 2019May 16, 2019 ~ Lukasz Buczynski ~ Leave a comment

This is a simple but interesting problem, which can be easily solved with O(n2) time complexity, but it demands to reverse your logic to solve it in O(n) time. Problem: Let's say, there is an array arr=[1, 2, 3, 4, 6, 7, 8, 2, 5] Now we need to find all pairs of numbers, which … Continue reading Problem: Find all pairs

Follow EasyAlgorithms on WordPress.com

Categories

  • algorithms
  • arrays
  • divide and conquer
  • multiset
  • recursion
  • sorting
  • Uncategorized

Archives

  • May 2019

Recent Comments

Blog Stats

  • 147 hits
Create a free website or blog at WordPress.com.
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here: Cookie Policy
  • Subscribe Subscribed
    EasyAlgorithms

    Have a WordPress.com account? Log in now.

  • EasyAlgorithms
    View site in Reader
    Manage subscriptionsSign upLog in
    Report this content
    Collapse this bar
Create your own website, free on WordPress.com.Create your own website.
Start free