Project: Built and deployed an end-to-end Sentiment Analysis web application using modern ML and backend tools. Model: DistilBERT Dataset Source: Kaggle : 🔗 https://lnkd.in/g-4v3TUv TechStack: Python Hugging Face Transformers DistilBERT FastAPI uvicorn HTML, CSS, JavaScript Git & GitHub 🔗 GitHub Repository: https://lnkd.in/g9XymNHv #machinelearning #python #huggingface #sentimentanalysis #fastapi #uvicorn
Deploying Sentiment Analysis with DistilBERT and FastAPI
More Relevant Posts
-
What if you could write multi-condition logic without nested function calls? pandas requires np.where() for conditional columns, which breaks method chaining and becomes nested fast. The apply() alternative is slow and also breaks the DataFrame workflow. Polars replaces nested np.where() with readable when().then().otherwise() chains that scale cleanly to any number of conditions. Better yet, you can combine them with any other Polars expression like string or date operations. 🚀 Article comparing pandas, polars, and DuckDB: https://bit.ly/4qfdtDd ☕️ Run this code: https://bit.ly/4qKPn3H #Python #Polars #DataScience #pandas
To view or add a comment, sign in
-
-
✅ Day 2 of #DSAPrep > Problem: Two Sum > Platform: LeetCode > Concept: HashMap/ Dictionary Used a dictionary to store elements and their indices. For each number, checked whether (target - current number) exists in the map to find the required pair. Optimized the brute-force O(n²) solution to O(n). > Time Complexity: O(n) > Space Complexity: O(n) Accepted ✅ Improving logical thinking and efficiency with every problem. #DataStructures #Algorithms #Python #ProblemSolving #CodingJourney
To view or add a comment, sign in
-
-
🚀 Day 44 of #100DaysOfCode 📌 Problem: 762 – Prime Number of Set Bits in Binary Representation Today I solved an interesting bit manipulation problem on LeetCode that combines binary representation with prime number logic. 🔎 Problem Summary: Given two integers left and right, count how many numbers in that range have a prime number of set bits (1s) in their binary form. 💡 Key Insight: The maximum number of set bits for numbers ≤ 10⁶ is 20. So we only need to check prime numbers up to 20: {2, 3, 5, 7, 11, 13, 17, 19} For each number, count the set bits using: Python Copy code num.bit_count() ✅ Python Solution: Python Copy code class Solution: def countPrimeSetBits(self, left: int, right: int) -> int: primes = {2, 3, 5, 7, 11, 13, 17, 19} count = 0 for num in range(left, right + 1): if num.bit_count() in primes: count += 1 return count ⏱ Time Complexity: O(n) 🧠 Concepts Used: Bit Manipulation | Prime Numbers | Set Every day I’m getting more comfortable with binary operations and optimization techniques. #LeetCode #Day42 #CodingJourney #Python #ProblemSolving #BitManipulation #100DaysOfCode
To view or add a comment, sign in
-
-
Browsers have evolved into immensely powerful computational environments and are quietly becoming the default layer for modern engineering and R&D. Without leaving the browser you can now initialize a Python environment, select libraries (numpy, matplotlib, scisuit), and run the exact deterministic code generated by the platform. From Web UI → to Python code → to exploration #engineering #web #statistics #dataanalysis #python #reproducibility
To view or add a comment, sign in
-
-
🚀 Day 51 of #100DaysOfCode ✅ Solved: 1689. Partitioning Into Minimum Number of Deci-Binary Numbers Today’s problem looked tricky at first, but the solution turned out to be beautifully simple once the pattern was understood. 🔎 Problem Insight: A deci-binary number contains only digits 0 or 1. To form a number like "82734", think about each digit: If a digit is 8, we need at least 8 deci-binary numbers contributing 1 at that position. If a digit is 3, we need at least 3 deci-binary numbers at that position. 👉 So the minimum number of deci-binary numbers required is simply: 📌 The maximum digit in the given number 💡 Example: Input: "82734" Output: 8 🧠 Python Code: Python Copy code class Solution: def minPartitions(self, n: str) -> int: return int(max(n)) ⏱ Time Complexity: O(N) 💾 Space Complexity: O(1) This problem is a great example of how understanding the pattern simplifies the solution dramatically. #LeetCode #ProblemSolving #Python #DataStructures #CodingJourney #100DaysOfCode
To view or add a comment, sign in
-
-
🐍 Day 60 — Bar Charts in Matplotlib Day 60 of #python365ai 📊 Bar charts compare categories. Example: plt.bar(["A", "B", "C"], [5, 7, 3]) plt.show() 📌 Why this matters: Bar charts are common in reports and dashboards. 📘 Practice task: Create a bar chart for three products. #python365ai #BarChart #DataAnalysis #Python
To view or add a comment, sign in
-
-
A teammate recently ran into this Pandas error: TypeError: argument of type 'float' is not iterable The code looked correct: df.query("Overseas Collection in Crores == 0") The issue? The column name had spaces. query() evaluates the condition as a Python expression. Because the column name contained the word in, Pandas interpreted it as the membership operator. The Fix: df.query("`Overseas Collection in Crores` == 0") Or: df[df["Overseas Collection in Crores"] == 0] Clean column naming conventions help prevent subtle bugs. #Python #Pandas #DataEngineering
To view or add a comment, sign in
-
LeetCode Problem 19: "Given the head of a linked list, remove the nth node from the end of the list and return its head." The below implementation is simple and clear- Approach Double traverse the list, once to calculate the length of the list and second time to find the position of the node to be deleted. Maintain two pointers at each iteration, one to keep track present node and second to keep track of previous node. position is calculated by using the formula: pos = (len of list-n)+1 Complexity Time complexity: O(m) where m is length of list Space complexity: O(1) i.e. constant #Python #LeetCode #CompetitiveProgramming #TwoPointers #ProblemSolving #LinkedList #Algorithms #DataStructures
To view or add a comment, sign in
-
-
🧠 Python Feature That Makes Type Checking Smarter: typing.Protocol Duck typing… but official 🦆✨ 🤔 The Problem 💻 Python is dynamically typed. 💻 But sometimes you want structure without inheritance. ❌ Traditional Way class Bird: def fly(self): ... def start_flying(bird: Bird): bird.fly() This forces inheritance. ✅ Pythonic Way with Protocol from typing import Protocol class Flyable(Protocol): def fly(self) -> None: ... def start_flying(obj: Flyable): obj.fly() 💫 Now ANY object with fly() works. 💫 No inheritance required 🎯 🧒 Simple Explanation 🦆 If it quacks like a duck and walks like a duck… 🦆 it doesn’t need to be a Duck class. 🦆 That’s Protocol. 💡 Why This Is Powerful ✔ Structural typing ✔ Cleaner architecture ✔ Better static analysis ✔ Used heavily in modern Python frameworks ⚡ Real Example class Drone: def fly(self): print("Flying") start_flying(Drone()) # Works! 🐍 Python believes in behavior, not hierarchy 🐍 typing.Protocol makes duck typing formal and powerful. #Python #PythonTips #PythonTricks #AdvancedPython #CleanCode #LearnPython #Programming #DeveloperLife #DailyCoding #100DaysOfCode
To view or add a comment, sign in
-
More from this author
Explore related topics
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development