Sabitlenmiş Tweet
Sravya Reddy
3.1K posts

Sravya Reddy retweetledi

@CodeWithSravya Cursor is the move right now, honestly. Way faster than VS Code for AI assisted coding and the context awareness is crazy. 😂
English

@anupamrjp Agree, but vibe Coding without knowledge of coding is obviously crime
English

Meet Aryan C. (@aryanc403), one of the legends of Indian competitive programming 🇮🇳🐐
If you have been part of the Indian competitive programming community for a while, this is a name you have probably come across.
Codeforces Grandmaster
ICPC World Finalist
Asia West Champion
Former 7-star coder on CodeChef
Problem setter and tester for major programming contests And someone who continues to share his knowledge with the competitive programming community
What makes Aryan’s journey special is not just the ratings, ranks, or titles. It is the years of consistency required to reach that level of problem-solving ability.
Competitive programming at this level is brutal. You are competing against some of the best minds in the world, solving problems that require deep algorithmic thinking, creativity, speed, and the ability to perform under pressure.
Reaching Grandmaster is already an achievement that only a tiny fraction of competitive programmers ever accomplish.
Representing India at the ICPC World Finals and becoming part of the first Indian team crowned Asia West Champion makes the journey even more remarkable. 🇮🇳
And even today, he continues to participate in contests, solve problems, write editorials, discuss solutions, and contribute to the community.
For thousands of students who started competitive programming with the dream of becoming Candidate Master, Master, or Grandmaster someday, people like Aryan show just how far consistent problem solving can take you.
A true legend of the Indian competitive programming community. 🐐
Respect, @aryanc403. 🙌

English

@knowRowan Yeah exactly it's a good problem to test someone's graph knowledge
English

@CodeWithSravya Yeah this is a solid graph problem where you treat each station as a node and find shortest paths between them. Dijkstra with battery constraints works well here. 💯
English

This question was Cisco Online assessment
Drone Delivery with Battery Swap Stations
Problem Description:
An autonomous delivery drone fleet operates above a dense urban grid. Each drone must fly from a depot to a customer location, but its compact battery cannot last the full distance. The city has placed a sparse network of automated battery-swap kiosks on rooftops; passing over a kiosk lets a drone instantly swap in a charged battery, but only if it has an unused swap voucher allocated by the dispatch system. Vouchers are scarce and global per delivery, so the drone must plan when to swap and when to push through on remaining charge.
Find the minimum number of moves required to fly from the depot at (sr, sc) to the customer at (er, ec), given a battery capacity B, a list of M swap-kiosk cells, and a fixed budget of K swap vouchers for the trip. Report -1 if no feasible delivery exists.
Input
rows, cols are the grid dimensions
grid =rows x cols matrix of 0 (open airspace) and 1 (no-fly building)
(sr, sc) Depot (start) coordinates, guaranteed open
(er, ec) customer (end) coordinates, guaranteed open
B , battery capacity, in moves: the drone starts at full charge
M , number of battery-swap kiosk cells
stations , M distinct kiosk coordinates, each on an open cell
K , global swap-voucher budget for the trip
input format
rows cols
grid_row_0
grid_row_1
...
grid_row_(rows-1)
sr sc
er ec
B
M
station_0_r station_0_c
station_1_r station_1_c
...
station_(M-1)r station(M-1)_c
K
English

@CodeWithAmann I will choose chatgpt as its new 5.6 model is far better than any other models like Anthropic's fable or opus 4.8
English






























