Welcome back,
keep the streak alive.
A
Ananya Singh
@ananya_codes
🔥 180
Day streak
Don't break it now!
R K P V
50,000+ coders coding every day
Welcome back 👋
New to CodeCult? Create a free account →
or sign in with CodeCult ID
👁

By signing in, you agree to our Terms and Privacy Policy

Start Day 1.
Build to 1000.
Your journey begins with:
✓ A public streak portfolio
✓ Daily coding reel uploads
✓ Discord-style community access
✓ Skill-based coder discovery
✓ Auto-generated portfolio page
R K P V
Join 50,000+ students today
Create your account 🚀
Already a member? Sign in instead →
or create with email
This will be your public profile URL: codecult.dev/@handle
👁
Use 8+ characters with letters, numbers & symbols

100% free. No credit card. Start your streak today.

Build Consistency.
Show Your Journey.
Get Discovered.

The social platform built for Tier-2 & Tier-3 engineering students — where daily coding reels, streak tracking, and community power your growth.

0Active Coders
0Daily Reels
0Streaks Maintained
0Colleges Represented
The Problem

65% of students quit coding
within 3–6 months

Without consistency, visibility, or a community, most aspiring engineers from Tier-2 & Tier-3 colleges never reach their potential. The resources exist — but the accountability and belonging don't. CodeCult changes that.

What You Get

Everything you need to
code consistently

Daily Coding Reels

Upload 60-second video updates on what you coded today. Build a public proof-of-work timeline that recruiters and peers can discover.

Streak Tracking

Never lose your momentum. Visual streak counters, fire animations, and milestone rewards keep you showing up every single day — 0 to 1000+.

Dynamic Portfolio

Your activity auto-generates a living portfolio — skills, streaks, projects, and reels — that updates as you grow. Share one link, show everything.

Skill-Based Discovery

Find and follow coders working on DSA, Web Dev, AI/ML, CP, and more. Get discovered by mentors and companies based on what you actually build.

Community

Real-time chat channels for every coding domain. Ask doubts, share solutions, pair program, prep for interviews — together.

Peer Mentorship

Get validated by seniors who've been through the same journey. Give back once you level up. A flywheel of growth built on earned trust.

The Process

How CodeCult Works

01

Sign Up & Set Skills

Create your profile, choose your focus areas and set your daily goal.

02

Upload Daily Reels

Record a quick 60-second video of what you coded today. Build your streak.

03

Join the Community

Dive into skill-based channels. Ask questions, review code, grow together.

04

Get Discovered

Your auto-built portfolio gets indexed. Recruiters find consistent coders.

Community Voices

Students just like you

"Before CodeCult, I'd code for a week and stop. Now I'm on a 180-day streak. Seeing others' reels every morning just pulls you in."

A
Ananya Singh
MIET Meerut • DSA

"Got my first internship after sharing my 90-day coding streak portfolio. The recruiter literally said they found me through CodeCult."

R
Rohan Verma
LNCT Bhopal • Web Dev

"The DSA Hub community solved my interview prep crisis. Real-time doubt solving at midnight before my Google interview. I got the offer."

P
Priya Kumari
BBDU Lucknow • CP

Your first streak starts
today.

Join 50,000+ engineering students building in public, every day.

Good morning, Rahul 👋 Sunday, March 1, 2026

🔥

10 Day Streak!

You're on fire. Don't break it today.

Best: 10 days  |  Total reels: 2
2Total Reels
10Current Streak
10Best Streak
82%Consistency
Recent Activity Feed View All →
📹
▶
Ananya Singh
Solved Longest Increasing Subsequence using patience sorting — O(n log n)!
DSADPDay 4
👍 4💬 8🔗 Share
📹
▶
Priya Kumari
Built a full REST API with JWT auth in Express.js — Day 63 of #100DaysOfCode
WebDevNode.jsDay 6
👍 3💬 1🔗 Share
📹
▶
Arjun Mehta
Trained my first PyTorch model on MNIST — 99.2% accuracy! 🎯
AI/MLPyTorchDay 22
👍 6💬 2🔗 Share
Learning Progress
DSA & Algorithms72%
Web Development58%
AI / Machine Learning34%
Competitive Programming45%
CC
CodeCult Home
💬
General Coding
🔷
3
DSA Hub
🌐
Web Dev
🤖
AI / ML
⚡
7
CP Arena
📱
Mobile Dev
🔧
Dev Tools
📚
Resource Share
💼
2
Interview Prep
＋

DSA Hub

⌄
Master Data Structures & Algorithms together
📢 Text Channels −
#general
#announcements
#leetcode-discussion@3
#doubt-solver
#code-reviews
#resources
#mock-interviews
#job-openings
#showcase
🔊 Voice Channels −
🔊General Study12
ananya_s
karan_dev
priya_codes
🔊DSA Study Room8
🔊Web Dev Collab4
🔊Pair Programming6
🔊Mock Interview Room2
👨‍💻 Coding Channels −
#competitive-programming
#project-help
#internship-prep
#placement-questions
#system-design
R
rahul_codes
Online
🎤
🔊
⚙️
# leetcode-discussion
Daily DSA problems, discussions, and solutions
124 online / 450 members
🔍
📌
🔔
👥
TODAY — MARCH 1, 2026
S
Sarah Chen10:42 AM
Just solved my first Hard DP problem! 🎉 Anyone need help with "Edit Distance"?
👍12
❤️3
🚀5
R
Rahul Kumar10:45 AM
@Sarah Chen Congrats! Can you share your approach? I'm stuck on this one for 2 days 😅
😂4
💪2
S
Sarah Chen10:47 AM
Sure! Here's the O(m×n) DP solution: 
# Edit Distance - DP Solution
def minDistance(word1, word2):
    m, n = len(word1), len(word2)
    dp = [[0] * (n + 1) for _ in range(m + 1)]

    for i in range(m + 1): dp[i][0] = i
    for j in range(n + 1): dp[0][j] = j

    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if word1[i-1] == word2[j-1]:
                dp[i][j] = dp[i-1][j-1]
            else:
                dp[i][j] = 1 + min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])

    return dp[m][n]
python
Key insight: dp[i][j] = min cost to convert word1[:i] → word2[:j]
🙏18
🔥24
💡9
A
Arjun Dev10:52 AM
This is gold 🙌 Btw I just figured out sliding window finally after 3 weeks of confusion. The "two pointers, expand right, shrink left when invalid" mental model just clicked.
🎉11
💯7
P
Priya Kumari11:03 AM
@Arjun Dev YES that mental model is everything. I'd add: "maintain a valid window" is the invariant. Once you internalize that, medium sliding window becomes easy mode 💪

Also — does anyone know if Neetcode's DP playlist covers 2D DP?
👆8
V
Vikram S11:07 AM
@Priya Kumari Yes it does! There's a whole section on 2D DP — knapsack, coin change variants, LCS family. Highly recommend going through TLE Eliminators sheet alongside it.

Anyone doing Codeforces Div 2 tonight? Can form a virtual team? 🏆
✋6
🎮3
M
Mentor_Raj 🏆11:31 AM
Great discussion today 🔥 Pinning Sarah's solution — it's textbook clean.

Daily Challenge: Implement Edit Distance in O(n) space by observing you only need the previous row. Who can get it done and post here by EOD? 🎯
💪29
🔥17
📎 😊 GIF ➤
Online — 124
M
Mentor_Raj
🏆 Mentor
S
Sarah Chen
🔥 180 days
R
Rahul Kumar
🔥 47 days
A
Arjun Dev
🔥 33 days
P
Priya Kumari
🔥 63 days
V
Vikram S
🔥 91 days
Offline — 326
D
Divya Rao
🔥 22 days
A
Amit Patel
🔥 120 days
Hey there! 👋 I'm CultBot. Want to know about CodeCult?