Today

 Tesla Enters Indian Market, Launches Model 3 and Model Y New Delhi | September 4, 2025 Tesla Inc., the American electric vehicle (EV) manufacturer led by Elon Musk, has officially announced its entry into the Indian market. The company launched its operations with the introduction of two models — Model 3 and Model Y — aimed at catering to India’s growing demand for sustainable transportation. The launch event, held in Bengaluru, was attended by industry leaders, government officials, and EV enthusiasts. Speaking at the event, Elon Musk said, “India is a key part of our global mission to accelerate the transition to sustainable energy. We are committed to bringing cutting-edge technology and building local partnerships to support India’s EV ecosystem.” Pricing and Availability Tesla’s Model 3, the company’s most affordable sedan, will be available at a starting price of approximately ₹45–50 lakh (ex-showroom). The Model Y, a compact electric SUV, will be priced slightly higher, tar...

G. Strange Nim Game solution code In Python3 language 👇 import sys MOD = 10 ** 9 + 7 def main (): sys.setrecursionlimit( 1 << 25 ) max_x = 200000 grundy = [ 0 ] * (max_x + 1 ) for x in range ( 1 , max_x + 1 ): digits = set () tmp = x while tmp > 0 : d = tmp % 10 if d != 0 : digits.add(d) tmp = tmp // 10 s = set () for d in digits: if x >= d: s.add(grundy[x - d]) mex = 0 while mex in s: mex += 1 grundy[x] = mex max_pow = 2 * 10 ** 5 + 30 pow2 = [ 1 ] * (max_pow + 1 ) for i in range ( 1 , max_pow + 1 ): pow2[i] = (pow2[i- 1 ] * 2 ) % MOD class SegmentTreeNode : def __init__ ( self, l, r ): self.l = l self.r = r self.left = None self.right = None self.basis = [ 0 ] * 30 ...

F. Advitiya Security Vault solution code  In Python3 language  👇 MOD = 1000000007 inv2 = 500000004 import sys input = sys.stdin.read data = input().split() index = 0 T = int(data[index]) index += 1 results = [] for _ in range(T):     N = int(data[index])     K = int(data[index + 1])     A = list(map(int, data[index + 2: index + 2 + N]))     index += 2 + N     P = 1     for i in range(N):         if A[i] == 0:             P = P * K % MOD     Q = 1     for j in range(N):         i = N - 1 - j         if A[i] != 0:             if A[j] != 0 and A[j] != A[i]:                 Q = 0                 break         else:             if A[j] == 0:     ...

#include <vector> #include <string> #include <queue> #include <algorithm> #include <sstream> using namespace std; struct Event {     int timestamp;     int userId; }; struct CompareEvent {     bool operator()(const Event& a, const Event& b) const {         return a.timestamp > b.timestamp;     } }; class Solution { public:     vector<int> trackMentions(int totalUsers, vector<vector<string>>& eventLogs) {         // Sort events based on timestamp         sort(eventLogs.begin(), eventLogs.end(), [&](const vector<string>& a, const vector<string>& b) -> bool {             return stoi(a[1]) < stoi(b[1]);         });         // Initialize mentions and online status arrays         vector<int> mention...

GDS 6th merit list declared. Check now  Link here👇 https://indiapostgdsonline.gov.in/ #

Accenture Job Opportunity:  Application Developer   Check Details here: 👇 https://www.linkedin.com/jobs/view/4106959368