• Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard
CSEstack

What do you want to Learn Today?

  • Programming
    • Tutorial- C/C++
    • Tutorial- Django
    • Tutorial- Git
    • Tutorial- HTML & CSS
    • Tutorial- Java
    • Tutorial- MySQL
    • Tutorial- Python
    • Competitive Coding Challenges
  • CSE Subject
    • (CD) Compiler Design
    • (CN) Computer Network
    • (COA) Computer Organization & Architecture
    • (DBMS) Database Management System
    • (DS) Data Structure
    • (OS) Operating System
    • (ToA) Theory of Automata
    • (WT) Web Technology
  • Interview Questions
    • Interview Questions- Company Wise
    • Interview Questions- Coding Round
    • Interview Questions- Python
    • Interview Questions- REST API
    • Interview Questions- Web Scraping
    • Interview Questions- HR Round
    • Aptitude Preparation Guide
  • GATE 2022
  • Linux
  • Trend
    • Full Stack Development
    • Artificial Intelligence (AI)
    • BigData
    • Cloud Computing
    • Machine Learning (ML)
  • Write for Us
    • Submit Article
    • Submit Source Code or Program
    • Share Your Interview Experience
  • Tools
    • IDE
    • CV Builder
    • Other Tools …
  • Jobs

[Solved] Minimum Arrows Required to Burst Balloons

Aniruddha Chaudhari/7671/2
CodePython

Problem Statement: “Minimum arrows required to burst balloons”

Given an array A, where A[i] represents the height of the balloon from the ground. You are shooting arrows from left to right direction, once you shoot an arrow, if it hits the balloon at height x, the trajectory of the arrow decreases by 1.

Find the minimum number of arrows required to burst all the balloons.

Example

Input = [6, 5, 1, 4, 5]
Output = 3

Note: This question was asked in Petasense coding interview rounds.

Explanation:

It will require three arrows to burst all the balloons.

  • With the first arrow, the balloons having heights 6, 5, and 4 will burst.
  • With the second arrow, the balloon having a height of 1 will burst.
  • The third arrow will burst the balloon at a height of 5.

When the arrow hits the balloon, we are updating the height of the balloon in the array as -1. This will help us to track the burst balloons.

While traversing the array, if the value is -1, we are skipping that balloon considering it has already burst.

Remember, the order of the balloons is important here. The arrow always shoots the balloons from the left to the right direction.

Python Program

I’m solving this coding question in Python. You can choose any other programming language of your choice. The logic to solve this problem will be the same.

Prerequisite:

  • if-else statement in Python
  • Python list
  • range() function in Python

Code:

def burst_balloon(arr):
    out = 0
    len_arr = len(arr)
    for i in range(len_arr):
        v = arr[i]
        if v == -1:
            continue;
        v -= 1
        out = out +1
        arr[i] = -1
        for j in range(i+1, len_arr):
            if arr[j] == v:
                arr[j] = -1
                v -= 1
    return out

balloons = [6, 5, 1, 4, 5]
out  = burst_balloon(balloons)
print(out)

Output:

3

Complexity

If you are asked this question in the interview, you also have to explain the complexity of your program.

In the above Python program, we traverse the array two times recursively. So, the time complexity of the problem is O(n^2).

Check other competitive coding questions asked in the interview for practice.

This is all about the Python program to find the minimum arrows required to burst balloons. If you know of any other optimized solution, kindly share it in the comment.

Python Interview Questions eBook

coding challengePython
Aniruddha Chaudhari
I am complete Python Nut, love Linux and vim as an editor. I hold a Master of Computer Science from NIT Trichy. I dabble in C/C++, Java too. I keep sharing my coding knowledge and my own experience on CSEstack.org portal.

Your name can also be listed here. Got a tip? Submit it here to become an CSEstack author.

Comments

  • Reply
    santhosh
    August 25, 2022 at 9:24 am

    Can we solve it in O(n) using a map?

    • Reply
      Aniruddha Chaudhari
      August 25, 2022 at 10:31 pm

      Do you have any solution in your mind to solve it in O(n) time?

Leave a Reply Cancel reply

Why?

Why Competitive Programming Important?

Coding Challenges for Practice

  1. Count Common Factor
  2. Does it Divide
  3. Sum of Sub Arrays
  4. Pair of Desired Sum
  5. Remove Duplicate Char from String
  6. Sort String by Char Freq (Python)
  7. Sort String by Char Freq (Java)
  8. Split Array into Equal Sum Subarray
  9. Validate IP Address
  10. Validate PAN Card Number
  11. Validate Sudoku
  12. Sort Circular Rotated Array
  13. String Permutations
  14. Min Arrow to Burst Bubbles
  15. Min Cost to Paint All Houses [Amazon]
  16. HourGlass with Max Sum
  17. Max Profit by Buying/Selling Stocks
  18. Hailstone Sequence
  19. Reverse String without affecting Special Characters
  20. Secure Conversation by Encry/Decry
  21. Special Elements in Matrix
  22. Next Greater No with Same set of Digits
  23. Smallest Subarray with Sum Greater than Given Number
  24. Group Anagrams
  25. Find Duplicates in Array in O(n)
  26. Find Two Unique Numbers from Array in O(n)
  27. Number Patterns & Finding Smallest Number
  28. First Unique Element in a Stream
  29. Flip Equivalent Binary Trees [TeachMint]
  30. Minimum Cost of Merging Files [Amazon]
  31. Minimum Distance for Truck to Deliver Order [Amazon]
  32. Longest Sequence of URLs
  33. Order Task for Given Dependencies
  34. Design Music Player
  35. Multilevel Parking System Design
  36. Minimum Coins Required
  37. Max Sum Subarray
  38. Max Avg Sum of Two Subsequences
  39. Merge Overlapping Intervals
  40. Longest Balanced Substring
  41. Longest Path in a Weighted Tree
  42. Generate Balanced Parentheses
  43. PostOrder Traversal Without Recursion

© 2022 – CSEstack.org. All Rights Reserved.

  • Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard