• Skip to primary navigation
  • Skip to content
  • Skip to footer
Thomas Ngo Thomas Ngo Crafting Elegant Solutions Through Code
  • Home
  • Journal
  • Tags
  • About

    Thomas Ngo

    Software Engineer

    • Stanton, California
    • Email
    • GitHub
    • Resume

    SQL problem - Not Boring Movies

    February 9, 2024 less than 1 minute read

    Page Navigation

    • Problem
    • My Query
    • Editorial Solution
    1 min read 106 words

    Problem

    problem-620

    My Query

    SELECT *
    FROM Cinema AS c
    WHERE c.id % 2 != 0 AND c.description != 'boring'
    ORDER BY rating DESC
    

    Editorial Solution

    select *
    from cinema
    where mod(id, 2) = 1 and description != 'boring'
    order by rating DESC
    ;
    

    Tags: SQL

    Updated: February 9, 2024

    Share on

    X Facebook LinkedIn Bluesky
    Previous Next

    Leave a comment

    You may also enjoy

    Mastering SemaphoreSlim for Async Concurrency in C# .NET 10

    6 minute read

    Learn how to use SemaphoreSlim to throttle parallel asynchronous operations in C# .NET 10, preventing resource exhaustion and improving application stability.

    Staying Free: Throttling Google Geocoding API with C# .NET 10

    4 minute read

    Learn how to control your API usage and stay within the Google Geocoding free tier using SemaphoreSlim in C# .NET 10.

    Copy List with Random Pointer in C#

    5 minute read

    Learn how to create a deep copy of a linked list where each node contains an additional random pointer using hash map and space-optimized interweaving approa...

    Remove N-th Node From End of List in C#

    2 minute read

    Learn how to remove the n-th node from the end of a singly-linked list using the two-pointer approach in C#.

    • Follow:
    • GitHub
    • LinkedIn
    © 2026 Thomas Ngo.