2523. Closest Prime Numbers in Range | leetcode daily challenge | faang | shashcode

Problem link: https://leetcode.com/problems/closest... Problem Statement: Given two positive integers left and right, find the two integers num1 and num2 such that: left = num1 num2 = right . Both num1 and num2 are prime numbers. num2 - num1 is the minimum amongst all other pairs satisfying the above conditions. Return the positive integer array ans = [num1, num2]. If there are multiple pairs satisfying these conditions, return the one with the smallest num1 value. If no such numbers exist, return [-1, -1]. Solution Link: https://github.com/Tiwarishashwat/Int... Custom Comparator:    • Lecture 12 How to Compare Objects | C...   Lambda Expression:    • L-1 Mind blowing Java 8 feature Lambd...   Dynamic Programming:    • Dynamic Programming in one shot | sha...   Graph Playlist:    • Graph Data Structure Series   Java Plus DSA Placement Course Playlist:    • Java and DSA Course Playlist : Online...   Java Plus DSA Sheet: https://docs.google.com/spreadsheets/... Notes: https://github.com/Tiwarishashwat/Jav... Telegram Link: https://shashwattiwari.page.link/tele... Ultimate Recursion Series Playlist:    • Recursion and Backtracking Ultimate S...   Instagram Handle: (@shashwat_tiwari_st) https://shashwattiwari.page.link/shas... Samsung Interview Experience:    • I cracked Samsung | SRIB Interview Ex...   Company Tags: Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung