Ho ho ho! Season 2 has arrived. ❄️
You guys know what to do... 💪
But something crazy... 🤯
We are TRIPLING the rewards. YES, 3X. Bc we still have more to distribute based on allocated reward boxes. 🎁
Missed Season 1? NP. But this is your last chance. ❤️
Make sure you follow all & complete Season 2 Tasks. 📝
Let's go! Ain't got much time left. ⏳
👉 nexira.ai/airdrops
PS. To be fair, we will re-verify all X-follows & tasks at unlock. ONLY for the loyals.
#Nexira#RubyUprising#3XRewards#LastChance$NEXI
I have decided to donate my match fees from this tournament to support our Armed Forces and the families of the victims who suffered from the Pahalgam terror attack. You always remain in my thoughts 🙏🏽
Jai Hind 🇮🇳
AI Travel Planner!
Google Gemini (Generative AI) for smart itinerary generation
SerpAPI to fetch real-time travel research and top destinations
Features:
Personalized day-by-day itineraries based on your preferences
Check it out live here:[ai-travel-planner-project.st…]
Sure! Here's a short and crisp version:
Your roadmap to AI mastery!
Data Science, ML, and NLP—mapped out and simplified.
Pick your path. Start building.
#AI#DataScience#MachineLearning#NLP#CareerRoadmap
Day 2(DSA )!
Best Time to Buy and Sell Stock
You are given an array prices where prices[i] is the price of a given stock on the ith day.
You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock
Day 1(DSA PROBLEM)!
trapping rain water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Example 1:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6