---
title: "Discussion on \"Daily Dose of DSA - Day 3\" | Hashnode"
description: "Discussion on \"Daily Dose of DSA - Day 3\". Number of greater elements for every array element using naive method (θ(n²)) , tree map (O(nlogn)) and upper bound method(O(nlogn))"
url: "https://hashnode.com/posts/daily-dose-of-dsa-day-3/63b9dc753167425f00875ab4"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Daily Dose of DSA - Day 3](https://legolas12hustle.dev/daily-dose-of-dsa-day-3?utm_source=hashnode&utm_medium=feed)

Number of greater elements for every array element using naive method (θ(n²)) , tree map (O(nlogn)) and upper bound method(O(nlogn))

Jan 7, 2023 · 2 min read · legolas12hustle.dev  
Read the article

-   [#stlinc](https://hashnode.com/tag/stlinc)
-   [#cpp](https://hashnode.com/tag/cpp)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#maps](https://hashnode.com/tag/maps)
-   [#programming-blogs](https://hashnode.com/tag/programming-blogs)

## Written by

[Atharva](https://hashnode.com/@Legolas12)

@Legolas12

  
[View profile](https://hashnode.com/@Legolas12)

Grind & Hustle

Hi, I'm Atharva Martiwar, a pre-final year student at National Institute of Technology Rourkela doing my bachelor's degree in Electronics and Electrical Engineering. As a Computer Science &amp; CP Enthusiast, I am keen on problem-solving and logical reasoning through coding. Love to learn DSA and solve coding questions. Good proficiency in C++, Dart, and Python. Currently exploring flutter for Android app development and python for Automation, building web, and Desktop Applications. Apart from my technical skills, I have a great experience in event management and planning. Through experiences and voluntary efforts, I have managed to develop leadership qualities and proficiency in speaking skills. PS: Love to play Badminton &amp; Table Tennis :D

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
