allcoding1

Send Questions Astrome & IBM.....

Goat Grazing Astrome Java Telegram:-  @allcoding1

Send A your Questions @allcoding1_official @allcoding1_official

from itertools import permutations def unique_permutations(nums): unique_perms = set(permutations(nums)) return [list(perm) for perm in unique_perms] # Take input for nums nums_input = input("Enter a list of numbers separated by spaces: ") nums = [int(num) for num in nums_input.split()] # Get and print unique permutations output = unique_permutations(nums) print(output)

Saks subarray product✅ long long solve(vector& nums, int k) {     if (k <= 1) return 0;     int n = nums.size();     long long p = 1;     int i = 0, j = 0;     long long ans = 0;     while (j < n) {         p *= nums[j];         while (i <= j && p > k) {             p /= nums[i];             i++;         }         ans += j - i + 1;         j++;     }     return ans; }

#include <iostream> #include <vector> #include <unordered_map> class Main { public:     static long getZeroBitSubarrays(const std::vector<int>& arr) {         int n = arr.size();         long totalSubarrayCount = static_cast<long>(n) * (n + 1) / 2;         long nonzeroSubarrayCount = 0;         std::unordered_map<int, int> windowBitCounts;         int leftIdx = 0;         for (int rightIdx = 0; rightIdx < n; rightIdx++) {             int rightElement = arr[rightIdx];             if (rightElement == 0) {                 windowBitCounts.clear();                 leftIdx = rightIdx + 1;                 continue;             }             std::vector<int> setBitIndices = getSetBitIndices(rightElement);             for (int index : setBitIndices) {                 windowBitCounts[index]++;             }             while (leftIdx < rightIdx && isBitwiseAndZero(rightIdx - leftIdx + 1, windowBitCounts)) {                 for (int index : getSetBitIndices(arr[leftIdx])) {                     windowBitCounts[index]--;                     if (windowBitCounts[index] == 0) {                         windowBitCounts.erase(index);                     }                 }                 leftIdx++;             }             nonzeroSubarrayCount += (rightIdx - leftIdx + 1);         }         return totalSubarrayCount - nonzeroSubarrayCount;     } private:     static std::vector<int> getSetBitIndices(int x) {         std::vector<int> setBits;         int pow2 = 1;         int exponent = 0;         while (pow2 <= x) {             if ((pow2 & x) != 0) {                 setBits.push_back(exponent);             }             exponent++;             pow2 *= 2;         }         return setBits;     }     static bool isBitwiseAndZero(int windowLength, const std::unordered_map<int, int>& bitCounts) {         for (const auto& entry : bitCounts) {             if (entry.second >= windowLength) {                 return false;             }         }         return true;     } }; DE Shaw ✅ C++ Telegram:- @allcoding1

🎯TCS National Qualifier Test (TCS NQT) 2024 Location: Across India Qualification: B.E / B.Tech / M.E / M.Tech / M.Sc / MCA / Any Graduate / Under Graduate / Diploma Batch: 2018/2019/2020/2021/2022/2023/2024 Apply Now:- www.allcoding1.com Telegram:- @allcoding1

package Graph; import java.util.*; public class Largest_Sum_Cycle { public static int solution(int arr[]) {   ArrayList<Integer>sum=new ArrayList<>();     for(int i=0;i<arr.length;i++)   {       ArrayList<Integer>path=new ArrayList<>();       int j=i;       int t=0;      while(arr[j]<arr.length&&arr[j]!=i&&arr[j]!=-1&&!path.contains(j))   {    path.add(j);    t+=j;    j=arr[j];    if(arr[j]==i)    {     t+=j;     break;    }   }   if(j<arr.length&&i==arr[j])    sum.add(t);   }   if(sum.isEmpty())    return -1;     return Collections.max(sum);   } public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); int testcases=sc.nextInt(); for(int loop=0;loop<testcases;loop++) { int numofBlocks=sc.nextInt(); int arr[]=new int[numofBlocks]; int src,dest; for(int i=0;i<numofBlocks;i++) { arr[i]=sc.nextInt(); } System.out.println(solution(arr)); } } } Juspay ✅ Telegram:- @allcoding1

import java.util.Scanner; import java.util.*; public class metting {     public static void helperFunction()     {         Scanner sc = new Scanner(System.in);         int n = sc.nextInt();         int[] edges = new int[n];                 for (int i = 0; i < n; i++)         {             edges[i] = sc.nextInt();         }                 int C1 = sc.nextInt();         int C2 = sc.nextInt();         // int ans=minimumWeight(n,edges,C1,C2);         // System.out.println(ans);   //  public static int minimumWeight(int n, int[] edges, int C1, int C2) {         List<List<Integer>> list = new ArrayList<>();         for (int i = 0; i < n; i++) {             list.add(new ArrayList<Integer>());         }         for (int i = 0; i < n; i++) {             if (edges[i] != -1) {                 list.get(i).add(edges[i]);             }         }         long[] array1 = new long[n];         long[] array2 = new long[n];         Arrays.fill(array1, Long.MAX_VALUE);         Arrays.fill(array2, Long.MAX_VALUE);         juspay(C1, list, array1);         juspay(C2, list, array2);         int node = 0;         long dist = Long.MAX_VALUE;         for (int i = 0; i < n; i++) {             if (array1[i] == Long.MAX_VALUE || array2[i] == Long.MAX_VALUE)                 continue;             if (dist > array1[i] + array2[i]) {                 dist = array1[i] + array2[i];                 node = i;             }         }         if (dist == Long.MAX_VALUE)         System.out.print(-1);             //return -1;        // return node;          System.out.print(node);     }     private static void juspay(int start, List<List<Integer>> graph, long[] distances)     {         PriorityQueue<Integer> pq = new PriorityQueue<>();         pq.offer(start);         distances[start] = 0;         while (!pq.isEmpty())         {             int curr = pq.poll();             for (int neighbor : graph.get(curr))             {                 long distance = distances[curr] + 1;                 if (distance < distances[neighbor])                 {                     distances[neighbor] = distance;                     pq.offer(neighbor);                 }             }         }     }     public static void main(String[] args) {      metting m = new metting();         metting.helperFunction();     } } Nearest meeting Cell Juspay ✅ Telegram:- @allcoding1

🎯TCS National Qualifier Test (TCS NQT) 2024 Location: Across India Qualification: B.E / B.Tech / M.E / M.Tech / M.Sc / MCA / Any Graduate / Under Graduate / Diploma Batch: 2018/2019/2020/2021/2022/2023/2024 Apply Now:- www.allcoding1.com Telegram:- @allcoding1

string make_string_S_to_T(string S) {     string T=“programming”;     bool possible = false;     int M = T.length();     int N = S.length();     for (int i = 0; i <= M; i++) {         int prefix_length = i;         int suffix_length = M - i;         string prefix = S.substr(0, prefix_length);         string suffix = S.substr(N - suffix_length, suffix_length);         if (prefix + suffix == T) {             possible = true;             break;         }     }     if (possible)         return "YES";     else         return "NO"; } Deleting substring ✅ Zeta Telegram:- @allcoding1

#include <bits/stdc++.h> using namespace std; vector<int> solution(vector<int> a, int n, int k) {     vector<int> v;     deque<int> dq;     for (int i = 0; i < n; i++) {         while (!dq.empty() && dq.front() <= i - k)             dq.pop_front();         while (!dq.empty() && a[dq.back()] <= a[i])             dq.pop_back();         dq.push_back(i);         if (i >= k - 1)             v.push_back(a[dq.front()]);     }     return v; } int main() {     int n, k;     cin >> n >> k;     vector<int> a(n);     for (int i = 0; i < n; i++)         cin >> a[i];     vector<int> result = solution(a, n, k);     for (int i = 0; i < result.size(); i++)         cout << result[i] << " ";     return 0; }.  //cricket match ✅ Zeta Telegram:- @allcoding1

class Solution { public:      void bfs(vector<vector<int>>&vis,vector<vector<char>>&grid,int i,int j,int n,int m)     {         vis[i][j]=1;         queue<pair<int,int>>q;         q.push({i,j});         while(!q.empty())         {             int row=q.front().first;             int col=q.front().second;             q.pop();             int delrow[4]={1,0,-1,0};             int delcol[4]={0,1,0,-1};                    for(int k=0;k<=3;k++){                     int nrow=row+delrow[k];                     int ncol=col+delcol[k];                     if(nrow>=0 and nrow<n and ncol>=0 and ncol<m and grid[nrow][ncol]=='1' and !vis[nrow][ncol])                     {                         vis[nrow][ncol]=1;                         q.push({nrow,ncol});                     }                 }             }         }     int numIslands(vector<vector<char>>& grid) {     int n=grid.size();         int m=grid[0].size();         vector<vector<int>>vis(n,vector<int>(m,0));         int cnt=0;         for(int i=0;i<n;i++)         {             for(int j=0;j<m;j++)             {                 if(!vis[i][j] and grid[i][j]=='1')                 {                     cnt++;                     bfs(vis,grid,i,j,n,m);                 }             }         }         return cnt;     } }; Zeta ✅ Telegram:- @allcoding1

class Solution { public:      void bfs(vector<vector<int>>&vis,vector<vector<char>>&grid,int i,int j,int n,int m)     {         vis[i][j]=1;         queue<pair<int,int>>q;         q.push({i,j});         while(!q.empty())         {             int row=q.front().first;             int col=q.front().second;             q.pop();             int delrow[4]={1,0,-1,0};             int delcol[4]={0,1,0,-1};                    for(int k=0;k<=3;k++){                     int nrow=row+delrow[k];                     int ncol=col+delcol[k];                     if(nrow>=0 and nrow<n and ncol>=0 and ncol<m and grid[nrow][ncol]=='1' and !vis[nrow][ncol])                     {                         vis[nrow][ncol]=1;                         q.push({nrow,ncol});                     }                 }             }         }     int numIslands(vector<vector<char>>& grid) {     int n=grid.size();         int m=grid[0].size();         vector<vector<int>>vis(n,vector<int>(m,0));         int cnt=0;         for(int i=0;i<n;i++)         {             for(int j=0;j<m;j++)             {                 if(!vis[i][j] and grid[i][j]=='1')                 {                     cnt++;                     bfs(vis,grid,i,j,n,m);                 }             }         }         return cnt;     } }; Zeta ✅ Telegram:- @allcoding1

any paid promotion DM :- @Priya_i

Fake #scammer This not my ID @allcoding1_officiaI

KPMG Off Campus Drive Hiring 2024 | Front End Developer | 4 LPA+ Job Title : Front End Developer Qualification : B.E / B.Tech Batch : Any Batch Package : 4 LPA+ Apply Now:- www.allcoding1.com Telegram:- @allcoding1

SELECT   category,   title,   total_stock FROM (   SELECT     p.category,     p.title,     SUM(w.quantity) AS total_stock   FROM     products p   JOIN     warehouse w ON p.product_id = w.product_id   GROUP BY     p.category, p.title   HAVING     total_stock > 10 ) AS filtered_data ORDER BY   category ASC, title ASC, total_stock DESC; IBM✅ Telegram:- @allcoding1

IBM✅ SQL Telegram:- @allcoding1