JobsJob TrackerJob alerts

Belzabar Software · 11 questions

All 11Coding 10
  • Belzabar numbers countCoding
  • Sorting and Tree pathCoding
  • Geometric intersection and array sumCoding
  • Multiprocessing, Normalization, SQL, Tournament rounds
  • Rearrange Positive and Negative NumbersCoding
  • Check Palindrome for Numbers and StringsCoding
  • Detect and Remove Loop in Linked ListCoding
  • Height Balanced Tree and Red Black TreeCoding
  • SQL Queries for Duplicates and Nth SalaryCoding
  • Next Greater ElementCoding
  • Find Greater Number Without ComparisonsCoding
← Belzabar Software questions
  1. Interview questions
  2. Belzabar Software
  3. Belzabar numbers count
Coding

Belzabar numbers count

Filed under Belzabar Software

The question

Given X, find count of numbers in form n(n-14) or n(n+14) where n is prime, less than or equal to X.

No write-up yet. Related questions below have one.

Related Belzabar Software questions

  • Sorting and Tree path
  • Geometric intersection and array sum
  • Rearrange Positive and Negative Numbers
  • Check Palindrome for Numbers and Strings
  • Height Balanced Tree and Red Black Tree
Sorting and Tree path →

Collected from public candidate posts and coding forums. Updated Nov 2026.