0% found this document useful (0 votes)
5 views5 pages

LeetCode Problem Tracking Guide

The document outlines problems from LeetCode related to object-oriented programming and daily problem-solving. It includes instructions for finding prime numbers in diagonals of a matrix and determining perfect numbers, both categorized as easy. Additionally, it mentions two hard problems: calculating the minimum difference in sums after element removal and finding the median from a data stream.

Uploaded by

xdnik76
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views5 pages

LeetCode Problem Tracking Guide

The document outlines problems from LeetCode related to object-oriented programming and daily problem-solving. It includes instructions for finding prime numbers in diagonals of a matrix and determining perfect numbers, both categorized as easy. Additionally, it mentions two hard problems: calculating the minimum difference in sums after element removal and finding the median from a data stream.

Uploaded by

xdnik76
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

LEETCODE TRACK

OOPS
 Prime in Diagonal (LC – 2614) EASY
So in these we have find prime element in the diagonal so for solve this in the for
loop we have to check is it prime or not in the left diagonal (\) nums[i][i] and right
diagonal nums[i][n-1-i].
and is prime we check until sqrt (n). base case will be n==1.

 Perfect number (LC – 507) EASY


To solve this first we have to know what is perfect number then see we can go till
sqrt(n) with addition after that from sqrt n till n>=1 and we can check for n/i == 0
then we will add in the sum .
Daily Problem solving
 Minimum Difference in Sums After Removal of Elements (Lc
– 2163) hard
S

 Find Median from Data Stream (Lc – 2163) hard


S

You might also like