GeeksForGeeks - POTD | GFG POTD Answer
关闭频道
1 218
订阅者
无数据24 小时
-97 天
-5730 天
帖子存档
8th November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution
{
public:
//Function to return list of integers visited in snake pattern in matrix.
vector snakePattern(vector > matrix)
{
vector result;
int n = matrix.size();
for (int i = 0; i < n; i++)
{
if (i % 2 == 0)
{
for (int j = 0; j < n; j++)
{
result.push_back(matrix[i][j]);
}
} else {
for (int j = n - 1; j >= 0; j--)
{
result.push_back(matrix[i][j]);
}
}
}
return result;
}
};
7th November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution
{
public:
//Function to return sum of upper and lower triangles of a matrix.
vector sumTriangles(const vector >& matrix, int n)
{
int sumU=0,sumL=0,sumD=0;
for(int i=0;ii){
sumU+=matrix[i][j];
}
else{
sumL+=matrix[i][j];
}
}
}
return {sumU+sumD,sumL+sumD};
}
};
6th November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution{
public:
int calc(int i, int j,int n, int m, vector> &mat, int k){
int sum=0;
for(int l=i-k;l<=i+k;l++){if(j>=k and l>=0 and l=0 and l=k and l>=0 and l=0 and l matrixSum(int n, int m, vector> mat, int q, vector qr[])
{
vectorans(q);
for(int i=0;i
5th November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution {
public:
vector topK(vector& nums, int k) {
// Code here
map mp;
vector> ans;
vector rans;
for(int i=0; i(n-k-1); i--){
rans.push_back(ans[i].second);
}
return rans;
}
};
4th November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution
{
public:
int transitionPoint(int arr[], int n) {
for(int i=0;i
3rd November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution{
public:
bool checkTriplet(int arr[], int n) {
mapmp;
int x=1;
for(int i=0;i
2nd November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution{
public:
int minDist(int a[], int n, int x, int y) {
int mini = INT_MAX;
int l = -1 , r = -1;
for(int i = 0 ; i
1st November : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution{
public:
void frequencyCount(vector& arr,int N, int P)
{
vectorfreq(N,0);
for (int i = 0; i < N; i++){
if (arr[i]-1 < N){
freq[arr[i]-1]++;
}
}
for (int i = 0; i < N; i++){
arr[i] = freq[i];
}
}
};
31st October : C++ Solution ☝🏼
—————————————————————
🙋🏻♂️Discussion ⁉️
Join ✅ @GFG_Answer
class Solution{
public:
void pushZerosToEnd(int a[], int n) {
int i=0, j=0;
while(j
