class AnushkaKotal:
def __init__(self):
self.name = "Anushka Kotal"
self.role = "3rd Year IT Engineering @ SFIT Mumbai"
self.location = "🌍 Mumbai, Maharashtra, India"
self.email = "askotal07@gmail.com"
self.passion = ["🌐 Full Stack Dev", "🎨 Design", "🧩 Problem Solving"]
self.philosophy = "Every line of code is brewed to perfection ☕"
self.brew_of_choice = "Cold brew, no sugar"
def current_projects(self):
return {
"💰 FitBit": "Web-based fitness tracker (JavaScript, HTML, CSS)",
"☕ Sip & Savor": "Coffee lounge with reservations (HTML, CSS, Node.js)",
"🤖 Career-Chatbot": "Smart career advisor (Python, NLP)",
"🔥 Torchbearer": "Event discovery for travellers (Java, MySQL)"
}
def what_drives_me(self):
return [
"🌱 Learning something new every single day",
"💻 Interfaces that feel effortless to use",
"🧩 Turning everyday annoyances into small useful tools",
"🎯 Open-source contributions & real-world impact"
]☕ Pour a cup and read on...
| Currently Brewing | Strength | Progress |
|---|---|---|
| 🌐 Full Stack Web Projects | 🟢 Strong | 🟫🟫🟫🟫⬜ 80% |
| ⚛️ React & Node.js Deep Dive | 🟢 Strong | 🟫🟫🟫⬜⬜ 70% |
| 🤖 Python & NLP Experiments | 🟡 Medium | 🟫🟫🟫⬜⬜ 60% |
| 🎨 UI/UX & Design Systems | 🟤 Light | 🟫🟫⬜⬜⬜ 40% |
- My code runs better paired with coffee and lo-fi beats
- I care as much about how it looks as how it works
- Good design is invisible; good code should be too
- Clean design + solid engineering = software people actually enjoy
👉 More brewing over in my repositories
|
🎖️ What I've Done 🚀 Built multiple full-stack projects solving real problems |
🎯 What's Next 🌐 Deeper full stack architecture |
|
🌐 Full Stack Development
|
🎨 Design & Problem Solving
|
|
|
|
|
|
🫘 The Science of Coffee & Code
My code runs better when paired with coffee and lo-fi beats. The optimal debugging formula:
Perfect Code = Coffee² + Lo-fi Beats + Late Night Sessions + ∞ Patience
Did you know? The first computer bug was an actual bug — in 1947 Grace Hopper found a moth stuck in a Harvard Mark II, and the name stuck.
🧩 Today's coding challenge
# Find the longest palindromic substring
def longest_palindrome(s):
if not s:
return ""
start, max_len = 0, 1
for i in range(len(s)):
# Expand around each centre
left, right = i, i
while left >= 0 and right < len(s) and s[left] == s[right]:
if right - left + 1 > max_len:
start, max_len = left, right - left + 1
left -= 1
right += 1
return s[start:start + max_len]
print(longest_palindrome("babad")) # "bab" or "aba"











