786. K-th Smallest Prime Fraction | leetcode daily challenge | DSA | Hindi | shashwat | java

Problem Name:
786. K-th Smallest Prime Fraction

Problem Statement:
You are given a sorted integer array arr containing 1 and prime numbers, where all the integers of arr are unique. You are also given an integer k.

For every i and j where 0 = i j arr.length, we consider the fraction arr[i] / arr[j].

Return the kth smallest fraction considered. Return your answer as an array of integers of size 2, where answer[0] == arr[i] and answer[1] == arr[j].

Problem link:
https://leetcode.com/problems/k-th-smallest-prime-fraction/description/?envType=daily-question&envId=2024-05-10

Java Plus DSA Placement Course Playlist:
https://youtube.com/playlist?list=PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE

Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing

Notes:
https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course

Telegram Link:
https://shashwattiwari.page.link/telegramShashwat

Ultimate Recursion Series Playlist:
https://youtube.com/playlist?list=PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK

Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shashwatInsta

Samsung Interview Experience:
https://youtu.be/GrvlpBzphSU

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction

#ShashwatTiwari #coding​​ #problemsolving​

Видео 786. K-th Smallest Prime Fraction | leetcode daily challenge | DSA | Hindi | shashwat | java канала ShashCode