#Irumudi - One of the best movies of this year. Few scenes really stood out. Deserved blockbuster for @RaviTeja_offl after long time.@gvprakash songs and bgm terrific. Last few mins and Climax emotional.Sensational acting by Baby Nakshathra. Solid contender for National Award.
"YOU'RE NOT SUPPOSED TO PROMPT CLAUDE. YOU'RE SUPPOSED TO BUILD A SYSTEM THAT PROMPTS ITSELF."
Boris Cherny, who built Claude Code, said it plainly.
In 26 minutes he shows exactly how to build one from scratch, step by step.
Most people are still doing every part of this by hand.
Watch the session, then save the guide below.
Bookmark this. Follow @cyrilXBT
Anthropic engineer:
"You're not supposed to prompt Claude. You're supposed to build a system that prompts itself."
In 45 minutes she breaks down how Anthropic builds agents that remember, learn from their mistakes, and get smarter with every run.
Worth more than any paid course you'll find on building agents.
Watch the session, then read the guide on building loops below.
Clever recreation of the teaser of the upcoming Kamal Haasan and Rajinikanth reunion by flipping the leads to mother and wife, in service of the product being sold, diamonds by the Coimbatore-based jewellery store, Ocean Sapphire!
They probably missed an additional trick of showing multiple garage shop-floor male workers in shorts and banian (which is as normal as it can get in an automobile workshop), as a counter-cultural-commentary on the original teaser's much-reviled, much-debated part - showing scantily-clad women on the shop-floor as if the reunion of the two legendary stars was not enough.
Smart and topical work by the Coimbatore-based agency Flolapo (an English + Tamil word-play around 'Go in the flow', as in, 'FLO-la-போ').
#advertising #marketing
After appearing in 10+ top-company interviews, I noticed similarities in the problems asked in DSA and design rounds.
I have prepared a list of LeetCode problems quietly train you for system design.
1. LRU Cache
Design concepts: In-memory caching, CDN, eviction policies
2. Find Median from Data Stream
Design concepts: Live metrics, real-time aggregation
3. Top K Frequent Elements
Design concepts: Trending detection, frequency counting
4. Design Hit Counter
Design concepts: Rate limiting, time-based counters
5. Kth Largest Element in an Array
Design concepts: Leaderboards, ranking systems
6. Sliding Window Maximum
Design concepts: Time-windowed metrics, moving aggregates
7. Design File System
Design concepts: Metadata management, hierarchical namespaces
8. Meeting Rooms II
Design concepts: Resource allocation, interval scheduling
9. Random Pick with Weight
Design concepts: Traffic splitting, weighted routing
10. Task Scheduler
Design concepts: Job scheduling, fairness, throttling
11. Design Twitter
Design concepts: Feed generation, fan-out vs pull
12. Autocomplete System
Design concepts: Prefix indexing, low-latency read
It’s best to prepare with patterns. Prepare wisely!
Fell free to connect if you have any doubts.
This is a great list, adding some common backend interview questions that are essential!
1. Kth Largest Element in an Array
System design: Leaderboards, rankings
2. Top K Frequent Elements
System design: Trending systems
3. Find Median from Data Stream
System design: Live stats, monitoring
4. Sliding Window Maximum
System design: Rate limiting, metrics
5. LRU Cache
System design: In-memory cache, CDN
6. Design Hit Counter
System design: API rate limiting
7. Merge Intervals
System design: Calendar, booking systems
8. Meeting Rooms II
System design: Resource scheduling
9. Insert Delete GetRandom O(1)
System design: Load balancing, sharding
10. Design Twitter
System design: Feed generation
11. Task Scheduler
System design: Job schedulers
12. Logger Rate Limiter
System design: Log throttling
13. Find Duplicate File in System
System design: Storage deduplication
14. Design File System
System design: Metadata services
15. Word Search II
System design: Search suggestions, autocomplete
16. Consistent Hashing (LC: consistent hashing variants / practice via “Design Consistent Hashing”)
System design: Sharding, cache ring, rebalancing
17. Serialize and Deserialize Binary Tree
System design: RPC payloads, snapshotting state, schema evolution
18. Decode String / Encode-Decode (TinyURL style)
System design: URL shorteners, encoding schemes, id generation
19. Design Underground System
System design: Metrics pipelines, aggregates, correctness under concurrency
20. Design In-Memory File System (with search)
System design: Hierarchical metadata, indexing, permissions model
21. Design Search Autocomplete System
System design: Prefix indexes, hot key caching, ranking + freshness
22. LFU Cache
System design: Cache eviction at scale, “hot” vs “warm” data management
23. Number of Islands / Union Find patterns
System design: Dynamic connectivity, cluster membership, service discovery groups
24. Course Schedule I/II (Topological Sort)
System design: Dependency graphs (build systems, workflows, DAG schedulers)
25. Minimum Window Substring (advanced sliding window)
System design: Stream filtering, windowed joins, intrusion / anomaly detection
We covered Switzerland + Italy in 15 days, (round trip for 5 people) and it’s been one of the most scenic, chaotic, and memorable trips ever.
We booked all our Airbnbs well in advance, around ₹1L per place for 5 people, super fair for the views and location
Sharing our full itinerary + small travel tips that actually helped
If you don't want to solve 500 Leetcode questions like me, just solve these 35 questions
𝗔𝗿𝗿𝗮𝘆𝘀
1. Two Sum
2. Best Time to Buy and Sell Stock
3. Maximum Subarray
4. Container with Most Water
5. Rotate Array
𝗦𝘁𝗿𝗶𝗻𝗴𝘀
1. Reverse String
2. Valid Palindrome
3. Longest Substring Without Repeating Characters
4. Group Anagrams
5. Longest Palindromic Substring
𝗟𝗶𝗻𝗸𝗲𝗱 𝗟𝗶𝘀𝘁
1. Reverse Linked List
2. Merge Two Sorted Lists
3. Remove Nth Node From End of List
4. Linked List Cycle
5. Intersection of Two Linked Lists
𝗧𝗿𝗲𝗲𝘀
1. Maximum Depth of Binary Tree
2. Validate Binary Search Tree
3. Symmetric Tree
4. Binary Tree Level Order Traversal
5. Lowest Common Ancestor of a Binary Tree
𝗚𝗿𝗮𝗽𝗵𝘀
1. Number of Islands
2. Course Schedule
3. Word Ladder
4. Clone Graph
5. Network Delay Time
𝗦𝗲𝗮𝗿𝗰𝗵𝗶𝗻𝗴 & 𝗦𝗼𝗿𝘁𝗶𝗻𝗴
1. Merge Sort
2. Quick Sort
3. Binary Search
4. Search in Rotated Sorted Array
5. First Bad Version
𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴
1. Fibonacci Number
2. Climbing Stairs
3. Longest Increasing Subsequence
4. Maximum Subarray Sum
5. Coin Change
✨ Follow me for more coding prep tips & resources 🚀