Prateek gupta

Claude vs. Claude Code vs. Cowork. If you've been confused about which one to use and when, this post will clear that up in under two minutes. Anthropic now offers three distinct ways to interact with Claude, and each one targets a fundamentally different workflow. Think of it as: Chat for thinking, Code for building, and Cowork for doing. Here's a quick breakdown: 1️⃣ Claude Chat This is the conversational AI assistant most people already know. You type a prompt, Claude responds, and you iterate together. - Turn rough ideas into structured plans through conversation - Write emails, reports, essays, and long-form content - Research and summarize complex topics in minutes - Analyze documents, PDFs, and images - Build interactive prototypes through Artifacts The key here is that everything happens through conversation. You're thinking with Claude, not delegating work to it. It's available on every device, has a free tier, and supports persistent memory across sessions. The tradeoff is that it has no direct access to your local files (upload only), and it can't generate raster images natively. 2️⃣ Claude Code This is a terminal-native coding agent. You describe what you want in plain English, and Claude reads your codebase, writes code, runs tests, fixes errors, and ships the result. - Build and debug entire features across the full codebase - Write, run, and fix tests automatically - Manage git workflows and create pull requests - Spawn multiple parallel agents working on different parts of a task simultaneously It handles the full development cycle end to end, from planning to execution to testing. With the CLAUDE(.)md configuration file, you can teach it your project's conventions, patterns, and constraints so it writes code the way your team expects. The tradeoff is a steeper learning curve compared to Chat, and token costs can add up during heavy sessions. 3️⃣ Claude Cowork This is the newest addition. Anthropic describes it as Claude Code for the rest of your work. It's an agentic desktop assistant that automates file management and repetitive tasks through a GUI. You describe an outcome, and Claude plans, executes, and delivers finished work: formatted documents, organized file systems, spreadsheets with working formulas, and synthesized research. - Direct local file access and editing (no upload/download cycle) - Schedule recurring tasks automatically - Assign tasks remotely via Dispatch from your phone - Computer Use lets Claude control your screen directly It runs inside a sandboxed virtual machine on your computer, so Claude can only access folders you explicitly grant. You don't need to know how to code to use it. The tradeoff is that your computer must stay awake for tasks to run, and it's still in research preview. Here's how to think about choosing between them: → If you need to think through a problem or get writing/research help, use Chat → If you're building software and want an autonomous coding partner, use Code → If you have a clearly defined deliverable that involves local files and desktop workflows, use Cowork All three are included in the same subscription starting at $20/month, which makes it one of the highest-leverage subscriptions in productivity software right now. I've put together a visual below that maps the workflow of each product side by side. If you want to go deeper into Claude Code specifically, I wrote a detailed article covering the anatomy of the .claude/ folder, a complete guide to CLAUDE(.)md, custom commands, skills, agents, and permissions, and how to set them all up properly. Link in the next tweet.

📂 DSA Roadmap (From Zero to Placement Ready) ┃ ┣ 📂 Foundations ┃ ┣ 📂 Time & Space Complexity ┃ ┣ 📂 Big-O Notation ┃ ┣ 📂 Recursion Basics ┃ ┗ 📂 Basic Math (GCD, Prime, etc.) ┃ ┣ 📂 Core Data Structures ┃ ┣ 📂 Arrays & Strings ┃ ┣ 📂 Linked List ┃ ┣ 📂 Stack & Queue ┃ ┣ 📂 Hashing (Map/Set) ┃ ┗ 📂 Sliding Window / Two Pointers ┃ ┣ 📂 Intermediate Algorithms ┃ ┣ 📂 Binary Search ┃ ┣ 📂 Sorting Techniques ┃ ┣ 📂 Prefix Sum ┃ ┣ 📂 Recursion + Backtracking ┃ ┗ 📂 Bit Manipulation ┃ ┣ 📂 Advanced Data Structures ┃ ┣ 📂 Trees (Binary Tree, BST) ┃ ┣ 📂 Heaps / Priority Queue ┃ ┣ 📂 Graphs (BFS, DFS) ┃ ┣ 📂 Tries ┃ ┗ 📂 Disjoint Set (Union-Find) ┃ ┣ 📂 Advanced Algorithms ┃ ┣ 📂 Dynamic Programming ┃ ┣ 📂 Greedy Algorithms ┃ ┣ 📂 Graph Algorithms (Dijkstra, Floyd) ┃ ┣ 📂 Topological Sort ┃ ┗ 📂 Shortest Path Problems ┃ ┣ 📂 Practice & Patterns ┃ ┣ 📂 LeetCode / Codeforces ┃ ┣ 📂 Pattern Recognition ┃ ┣ 📂 Timed Practice ┃ ┣ 📂 Mock Interviews ┃ ┗ 📂 Revision Strategy ┃ ┣ 📂 Placement Preparation ┃ ┣ 📂 Company-wise Questions ┃ ┣ 📂 System Design Basics ┃ ┣ 📂 Core CS (OS, DBMS, CN) ┃ ┗ 📂 Behavioral Questions Follow this consistently for 4–6 months and you’ll be ahead of 90% candidates ( save this! )