Solve LeetCode - 2418. Sort the People - Java & C++ Solutions | July Challenge

Поделиться
HTML-код
  • Опубликовано: 14 окт 2024
  • 🚀 Join our Daily LeetCode Challenge for July!
    🔗 Problem & Solutions:
    LeetCode 2418 - Sort the People: Dive deep into our comprehensive solutions in Java and C++.
    Problem Statement: [Link]
    (leetcode.com/p...)
    Code Walkthrough: [Leetcode Post]
    (leetcode.com/p...)
    Code Walkthrough: [GitHub Repository]
    (github.com/Ahl...)
    📊 Understand the Complexity:
    Input Size vs. Time Complexity: Learn how input size affects performance with detailed analysis. [Read More](www.geeksforge...)
    🛠️ Techniques and 🗂️📊🧩 Data Structures Used:
    Array: Master this data structure to solve problems faster. [Learn More] (www.geeksforge...)
    🌐 Stay Connected:
    Mayur Programming Club on LinkedIn: [Follow Us]( / mayur-programming-club )
    Connect with Me on LinkedIn: [Abhishek Ahlawat]( / abhishek-ahlawat-667aa... )
    📱 Explore Our Apps:
    Watch on RUclips: [Mayur App Studios]( / @mayurappstudios ) | Check out our apps available on the Google Play Store!
    🎬 Discover how to tackle programming challenges effectively in our latest video!

Комментарии • 3

  • @mayurprogrammingclub1001
    @mayurprogrammingclub1001  2 месяца назад +1

    We apologize for the oversight. The time complexity is O(nlogn) instead of O(n) due to the use of inbuilt sorting.
    Regards,
    Mayur Programming Club (MPC) 😊

  • @liukang1240
    @liukang1240 2 месяца назад +1

    What if we have people with the same height?

    • @mayurprogrammingclub1001
      @mayurprogrammingclub1001  2 месяца назад +1

      As per the constraints in problem: "All the values of heights are distinct." So the problem does not remains the same if these constraints change