Gulshan Singh

Mark this — after 3 years and 11 months, I will retweet this when my network will be in the top 1%...🌟✨

@shydev69 Please refer me....

i can refer 1 person for a full stack dev role. decent pay. drop proof of work below. don't dm.

@_vatsalasingh Jai shree ram ❤️

अगर नीम करौली बाबा पर 1% भी विश्वास है, तो "राम राम" लिखें बिना आगे मत बढ़ना...

@BattaKashmiri Russia

Between Russia and America who do you consider as a more reliable ally for India and why ?

@INamoAgain Jai hind

हमारे सेना के जवान कठिन हालातों में भी अपना फर्ज निभाते हैं, आप समय निकाल कर जय हिंद🇮🇳 लिख़ कर एक लाइक ज़रूर करे ..!❤️

@IAjitDoval_IND Never ever

क्या पाकिस्तान पर भरोसा किया जा सकता है?

@IndianForce___ Yes

🇮🇳Do you stand with India? Yes or no?

@SJaishankarIND A

@LionsOfZion_ORG 🇮🇳

🇮🇱

@ManojNaravane Jai hind 🇮🇳🇮🇳

Abhi picture baki hai…

Difference between print() 🖨 and println() method in java ?? #Coding #Java

#loop #programming

Typecasting in a line means converting one data type to another in a single statement.

Print the largest and smallest string from the given array.??

Print and count all strings with an even number of characters from the given array.

Alternating Groups #leetcode3208 The algorithm tracks alternating color groups with a sliding window of size k, counting valid subarrays and shrinking the window by incrementing left to find all possible groups in the circular array. leetcode.com/problems/alter…

Minimum recolors to get K consec.. black block.. #Leetcode Iterate over substrings of length k, count 'W' blocks, track the minimum recolors, and return the smallest count. 🚀 Keep track of the minimum number of recolors required across all substrings. leetcode.com/problems/minim…

♨️Closest prime number in a range 1⃣ Find Primes: Loop through [left, right] and store primes. 2⃣ Find Closest Primes: Track smallest difference between consecutive primes. 3⃣ Return Result: Return closest primes or [-1, -1]. #leetcode leetcode.com/problems/close…

concise approach: 1. Iterate while n > 0. 2.Compute remainder = n % 3. 3. If remainder == 2, return false. 4. Update n = n / 3 to process the next ternary digit. 5. If the loop completes, return true. leetcode.com/problems/check…

@ThakurAbhay342 Hey I'm interested

My company is hiring. I want to refer few skilled candidates for SDE 1 and SDE 2, Don’t miss the opportunity ✅.