class KarthikJanardhan:
def __init__(self):
self.name = "Karthik Janardhan"
self.role = "3rd Year IT Student @ SFIT Mumbai"
self.location = "๐ Mumbai, Maharashtra, India"
self.cgpi = 8.40
self.email = "karthikjanardhan5@gmail.com"
self.passion = ["๐ค AI/ML & GenAI", "๐ Full Stack Dev", "๐ Hackathons"]
self.philosophy = "Jack of all trades... but mastering them one by one ๐ช"
self.hackathons_won = ["Colloquium'25 ๐ฅ", "OpenAI x NextWave ๐ฅ"]
self.coffee_consumed = float('inf')
def get_current_projects(self):
return {
"๐ VendorConnect": "Street food vendor platform (Python, OpenAI, Android)",
"๐ Skillora": "Career growth platform (Django, MongoDB)",
"๐ฅ CodeMinds": "Fire detection & crowd management (Python, OpenCV)",
"๐๏ธ Itihaas": "Indian heritage tourism platform (Flask, SQLite)"
}
def get_achievements(self):
return [
"๐ฅ Winner โ Colloquium'25 Inter-College IT Hackathon",
"๐ฅ Runner-Up โ OpenAI ร NextWave Hackathon (1700+ teams)",
"โญ Top 50 Learner โ Google Cloud GenAI Academy (250K+ participants)",
"๐
Top 1 Performer โ Gen AI Academy, earning 800 points"
]โจ Click to explore my cosmic journey!
| ๐ Current Mission | ๐ Status | ๐ฏ Progress |
|---|---|---|
| ๐ Hackathon Prep & Grinding | ๐ข Active | โโโโโโโโโโ 80% |
| ๐ค GenAI & LLM Integration | ๐ข Active | โโโโโโโโโโ 80% |
| ๐ Full Stack Projects | ๐ก In Progress | โโโโโโโโโโ 60% |
| ๐ฑ Android Development | ๐ต Exploring | โโโโโโโโโโ 30% |
- ๐ I turn hackathon problems into award-winning solutions
- ๐ค Trained on Google Cloud GenAI, OpenAI, and IBM AI โ like a real AI myself
- โ I've consumed enough coffee to power a Mumbai local train
- ๐ก I believe Full Stack + AI = The future of everything
|
๐ฅ Colloquium'25 โ Inter-College IT Hackathon Winner |
โญ Google Cloud GenAI Academy โ Top 50 of 250K+ |
|
|
๐งฉ Click for today's coding challenge!
# Challenge: Find the longest palindromic substring
def longest_palindrome(s):
if not s:
return ""
start = 0
max_len = 1
for i in range(len(s)):
# Check for odd length palindromes
left, right = i, i
while left >= 0 and right < len(s) and s[left] == s[right]:
current_len = right - left + 1
if current_len > max_len:
start = left
max_len = current_len
left -= 1
right += 1
return s[start:start + max_len]
# Test it out!
print(longest_palindrome("babad")) # Output: "bab" or "aba"๐ฒ Random Tech Fact Generator
Did you know? The first computer bug was an actual bug! In 1947, Grace Hopper found a moth stuck in a Harvard Mark II computer, coining the term "computer bug."










