HackerRank: Revising the Select Query II

PublishedDecember 6, 2025

•1 min read

Problem:

https://www.hackerrank.com/challenges/revising-the-select-query-2

Question:

Code:

SELECT 
    NAME
FROM CITY
WHERE COUNTRYCODE='USA'
    AND POPULATION>120000

Key Points:

What the Query Does

Retrieves the names of U.S. cities
Only cities with population > 120,000 are included

Key Conditions Used

COUNTRYCODE = 'USA' → filters for American cities
POPULATION > 120000 → ensures only larger cities are selected

Why It Works

Only the NAME column is selected as required
The WHERE clause applies both conditions correctly — using AND

Output

List of qualifying city names (may return multiple rows)

#hackerrank #sql

Comments

Join the discussion

No comments yet. Be the first to comment.

More from this blog

LeetCode: Contains Duplicate II

Problem: https://leetcode.com/problems/contains-duplicate-ii/ Code: class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: # window = k seen_in_window = set() for i in range(len(nums)): ...

Jan 9, 20262 min read

LeetCode: Rearrange Array Elements by Sign

Problem: https://leetcode.com/problems/rearrange-array-elements-by-sign/ Code: class Solution: def rearrangeArray(self, nums: List[int]) -> List[int]: non_neg_nums = [] neg_nums = [] result = [] # Segregated non-n...

Dec 26, 20252 min read

GeeksForGeeks: Array Leaders

Problem: https://www.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1 Code: class Solution: def leaders(self, arr): leads = [] n = len(arr) maximum = arr[-1] # till will handle negatives # we will colle...

Dec 26, 20252 min read

LeetCode: Intersection of Two Arrays

Problem: https://leetcode.com/problems/intersection-of-two-arrays/ Code: class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: result = set() n2 = set(nums2) for num in nums1: ...

Dec 24, 20252 min read

LeetCode: Repeated Substring Pattern

Problem: https://leetcode.com/problems/repeated-substring-pattern/ Code: class Solution: def repeatedSubstringPattern(self, s: str) -> bool: return s in (s + s)[1:-1] # Points to note: # - A repeated string will reappear ...

Dec 22, 20254 min read

LeetCode Shahwar

65 posts

I write LeetCode Explanations here

Command Palette