Gayatri Kini’s Post

#geeksforgeeks #drgviswanathan #100daysofcodechallenge Day 43:Given an array of N integers arr[] where each element represents the maximum length of the jump that can be made forward from that element. This means if arr[i] = x, then we can jump any distance y such that y ≤ x. Find the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then you cannot move through that element.

Day 86 of 100 #100daysofcode #drgvishwanathanchallenge Problem: Find the first non-repeating element in a given array arr of N integers. Note: Array consists of only positive and negative integers and not zero.

🚀 Day52 is successfully completed of #100daysofcodingchallenge of #geeksforgeeks Problem of the day:- Is to complete the function winner() that takes an array of strings arr, and length of arr n as parameters and returns an array of string of length 2. First element of the array should be the name of the candidate and second element should be the number of votes that candidate got in string format. #vitbhopal #vitbhopallions #drgvishwanathanchallenge #drgviswanathan

On this auspicious day of Krishna Janmashtami, may your lines of code be as elegant as Krishna's dance moves, and your debugging skills as sharp as his Sudarshana Chakra 🎊 Let's celebrate the birth of Lord Krishna with the same passion we bring to our projects. Wishing you a tech-tastic and joyful Janmashtami! 🎉🕉️ #KrishnaJanmashtami #codewithdevotion #festivalvibes #celebration #team #growwithvirtualcoders #virtualcoders

Day 77of #100daysofcode 🖥️ challenge. Problem-  . Unique Number of Occurrences Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Level: Easy Time Complexity : O(n) Shriram R #drgvishwanathanchallenge #DrGViswanathan #100daysoflearning #DrGViswanathan #vitbhopal #vitbhopallions #100daysofcode #DrGviswanathan #100daysofcode

What KL was to Kohli today, Dualite can be to you as a Dev. Just imagine. The ultimate support. Try it today at https://bit.ly/DUALITE #indvsban #figma #designtocode #lowcode

Day 58 of #100daysofcode challenge ... solved the daily DSA problem of #geeksforgeeks 58/100th day Love Babbar Sheet : Given an array of N integers arr[] where each element represents the maximum length of the jump that can be made forward from that element. This means if arr[i] = x, then we can jump any distance y such that y ≤ x. Find the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then you cannot move through that element. #vitbhopal #drgvishwanathanchallenge #vitbhopal #drgvishwanathan

🚀 Coding Challenge: Write a function that inverts an object by swapping keys and values. 🚀 💻 Sample Input: {a: 'apple', b: 'banana', c: 'cherry'} 📚 Expected Output: {'apple': 'a', 'banana': 'b', 'cherry': 'c'} I've created a code snippet to solve this problem. Check it out on CodePen: 👉 https://lnkd.in/gvYWJ6aw 👉 #JavaScript #CodingChallenge #WebDevelopment #frontenddeveloper #likesharecomment 🙌

3 things that God give us, the problem, the solution, the lesson face the problem, find the solution and never forget the lesson. 3998 entry = 1k pairing INSTANT and DAILY pay out.💵💰💰 #happymondayeveryone #thinkpositive #keepsmiling #keepthefaith #blackcode #momentumbuilder #riseandshine #TRISKELION #HOD #winnersattitude #PioneeringCompany #homeofdreamers

By jakaria_sks, contest: Codeforces Round 634 (Div. 3), problem: (A) Candies and Two Sisters, Accepted, //A. Candies and Two Sisters #include<bits/stdc++.h> using namespace std; int main() {   int t;   cin>>t;   int i=0;   while(i<t)   {     int n,way=0;     cin>>n;     if (n>2)       way=(n-1)/2;     cout<<way<<endl;     i++;   }   return 0; }