DSA Visualizations | Hello Interview

Triangle Numbers

DESCRIPTION (credit Leetcode.com)

Write a function to count the number of triplets in an integer array nums that could form the sides of a triangle. The triplets do not need to be unique.

EXAMPLES

Input:


nums = [11,4,9,6,15,18]

Output:

Explanation: Valid combinations are...

4, 15, 18
6, 15, 18
9, 15, 18
11, 15, 18
9, 11, 18
6, 11, 15
9, 11, 15
4, 6, 9

Run your code to see results here

Solution


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

valid triangle numbers

0 / 26

Explanation

In order for a triplet to be valid lengths of a triangle, the sum of any two sides must be greater than the third side. By sorting the array, we can leverage the two-pointer technique to count all valid triplets in O(n²) time and O(1) space.

The key to this question is realizing that if we have 3 numbers, such as 4, 8, 9, arranged from smallest to largest, and the sum of the two smallest numbers is greater than the largest number, then we have a valid triplet ( 4 + 8 > 9).

But not only that, triplets where the smallest number is between 4 and 8 are also valid triplets.

This means that if we sort the input array, and then iterate from the end of the array to the beginning, we can use the two-pointer technique to efficiently count all valid triplets.

The pointers i, left, and right represent the current triplet we are considering. If nums[i] + nums[left] >= nums[right], then we know there are a total of right - left valid triplets, since all triplets between left and right are also valid triplets. We can then decrement right to check for the valid triplets that can be made by decreasing the middle value.


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

valid triangle numbers

0 / 5

When nums[i] + nums[left] < nums[right], we know that all triplets between left and right are also invalid, so we increment left to look for a larger smallest value.


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

Count:

move right pointer

0 / 1

Each time left and right cross, we decrement i and reset left and right to their positions at opposite ends of the array. This happens until i is less than 2, at which point we have counted all valid triplets.


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

Count:

move left pointer

0 / 20

Next: Move Zeroes

Your account is free and you can post anonymously if you choose.

Sort By

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

3-Sum

Move Zeroes

Triangle Numbers

DESCRIPTION (credit Leetcode.com)

Write a function to count the number of triplets in an integer array nums that could form the sides of a triangle. The triplets do not need to be unique.

EXAMPLES

Input:


nums = [11,4,9,6,15,18]

Output:

Explanation: Valid combinations are...

4, 15, 18
6, 15, 18
9, 15, 18
11, 15, 18
9, 11, 18
6, 11, 15
9, 11, 15
4, 6, 9

Run your code to see results here

Solution


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

valid triangle numbers

0 / 26

Explanation

But not only that, triplets where the smallest number is between 4 and 8 are also valid triplets.

This means that if we sort the input array, and then iterate from the end of the array to the beginning, we can use the two-pointer technique to efficiently count all valid triplets.


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

valid triangle numbers

0 / 5

When nums[i] + nums[left] < nums[right], we know that all triplets between left and right are also invalid, so we increment left to look for a larger smallest value.


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

Count:

move right pointer

0 / 1


def triangleNumber(nums):
  nums.sort()

  count = 0
  for i in range(len(nums) - 1, 1, -1):
    left = 0
    right = i - 1
    while left < right:
      if nums[left] + nums[right] > nums[i]:
        count += right - left
        right -= 1
      else:
        left += 1

  return count

Count:

move left pointer

0 / 20

Next: Move Zeroes

Your account is free and you can post anonymously if you choose.

Sort By

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA Guided Practice Hello Interview Premium

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103