ritik@dev: cat identity.json{
"name" : "Ritik Pandey",
"location" : "India 🇮🇳",
"role" : "Full Stack Developer + AI Builder",
"stack" : ["MERN", "FastAPI", "PyTorch", "OpenCV"],
"currently_shipping": "AI-powered real-time web apps",
"dsa_grind" : "Daily LeetCode + Codeforces 🔥",
"looking_for" : ["Hackathon teammates", "Startup co-founders"],
"ask_me_about" : ["MERN Stack", "AI/ML", "Competitive Programming"],
"fun_fact" : "git blame never points to me 😎",
"status" : "⚡ Open to Collaborate"
}ritik@dev: uptime
Always coding. Rarely sleeping. Constantly debugging.💡 A programmer who doesn't know their algorithms is like a chef who doesn't know their knives.
// Ritik's go-to DFS template — clean, reusable, fast
void dfs(int node, vector<vector<int>>& adj, vector<bool>& visited) {
visited[node] = true;
for (int neighbor : adj[node]) {
if (!visited[neighbor])
dfs(neighbor, adj, visited); // explore the unknown
}
}
// Time: O(V + E) | Space: O(V)
// Currently exploring: Graph DP + Dijkstra 🚀# Binary Search — because O(log n) > O(n), always
def binary_search(arr: list, target: int) -> int:
lo, hi = 0, len(arr) - 1
while lo <= hi:
mid = lo + (hi - lo) // 2 # avoids overflow (yes, it matters)
if arr[mid] == target: return mid
elif arr[mid] < target: lo = mid + 1
else: hi = mid - 1
return -1
# Time: O(log n) | favourite pattern for problem solvingritik@dev:~$ ls -la ./current_projects/drwxr-xr-x AI-powered-chat-app/ → Real-time messaging with LLM integration
drwxr-xr-x dsa-grind/ → Daily LeetCode + Codeforces problems
drwxr-xr-x ml-vision-project/ → OpenCV + PyTorch object detection
drwxr-xr-x hackathon-prep/ → Next hackathon: T-minus unknown days
-rw-r--r-- side_project_idea.txt → Classified 🤫
"First, solve the problem. Then, write the code. Then, spend three hours wondering why it was working before." — Ritik Pandey, every Sunday at 2am
"Any fool can write code that a computer can understand. Good programmers write code that humans can understand." — Martin Fowler (and also Ritik, after code review)