𝐓𝐡𝐞 𝐭𝐡𝐢𝐧𝐠 𝐰𝐢𝐭𝐡 𝐉𝐮𝐩𝐲𝐭𝐞𝐫 𝐧𝐨𝐭𝐞𝐛𝐨𝐨𝐤𝐬... In the beginning, everything is easy: testing code, visualizing data, implementing ideas immediately. But with every new feature, the complexity grows. At some point, #Jupyter notebooks reach their limits. Our data engineer Bianca Leßmann shares her experiences in the blog and explains when classic #Python scripts are the better choice: https://lnkd.in/gJsBfQyC #DataEngineering #JupyterNotebooks #DataScience #DigitalizationbyMM
When to use Python scripts over Jupyter notebooks
More Relevant Posts
-
Can you identify the data type of each variable below? x = 3.0 y = "true" z = False m = True z = 5 Share your answers in the comments! And if you’re not sure, you can check my page — I’ve explained it clearly in my video on Python Data Types. #ProgrammingInstructorForKids #KidsCoding #LearnPython #PythonForKids #CodingForKids #STEMEducation #TeachingKids #PythonBasics #FutureProgrammers #EdTech #WomenInTech #iSchool
To view or add a comment, sign in
-
Day 55 – Using finally to Clean Up Some actions should happen no matter what — like closing files or releasing resources. Use finally for that 👇 try: file = open("data.txt", "r") print(file.read()) except FileNotFoundError: print("File not found!") finally: print("Closing file...") file.close() ✅ finally always executes ✅ Essential for clean resource handling 🚨 Forgetting to close files or connections = potential memory leaks! 👉 Ever used finally in your code? #Python #ErrorHandling #BestPractices #100DaysOfCode
To view or add a comment, sign in
-
#Week2 | Mastering Trees: From Traversal to Validation This week, I dove deep into the world of tree data structures, specifically Binary Search Trees (BSTs). It was a fantastic exercise in understanding recursion and level-order logic. Here’s what I covered: * Implemented a BST from scratch, including node creation and value insertion. * Wrote functions for various traversal methods: inorder and level-order (BFS). * Built utility functions to search for values, find the minimum value, and calculate the tree's height. * Capped it off by creating a function to validate if a tree is a proper BST. Tech Stack: Python, Jupyter Notebook A key takeaway for me was seeing how an inorder traversal of a BST naturally produces a sorted list of its nodes. It’s a simple but powerful property! Next up: I’ll be moving on to another important data structure: Heaps! You can follow my progress and check out the code here: https://lnkd.in/gnJw38QM #AIJourney #DataStructures #Python #Trees #BST #LearningInPublic #12WeeksAIReset #CodingChallenge
To view or add a comment, sign in
-
-
Discover how deletion vectors can take Delta Lake performance to the next level. 🚀 In this 5-minute video, Youssef Mrini breaks down how deletion vectors speed up delete, update, and merge operations by marking rows logically—no need to rewrite entire files. He also shares real-world merge benchmarks and shows how this feature enhances Change Data Capture and streaming workloads. 𝗧𝗼𝗽𝗶𝗰𝘀 𝗰𝗼𝘃𝗲𝗿𝗲𝗱: 🔹 What deletion vectors are and how they work 🔹 Merge-on-read performance improvements 🔹 How to enable deletion vectors in Python and SQL 🔹 When to use deletion vectors for large datasets 🎥 Watch: https://lnkd.in/eHnuvxfT #deltalake #opensource #oss #deletionvectors #python #SQL
To view or add a comment, sign in
-
-
🚀 Day 46 of #100DaysOfDSA Solved LeetCode Problem #257 – Binary Tree Paths 🌿➡️🌿 📌 Problem Insight: Given the root of a binary tree, the task is to return all root-to-leaf paths as strings. Each path should follow the format: root -> child -> ... -> leaf This is a classic DFS + recursion problem that builds strong tree traversal skills. 💡 Key Learnings: Practiced Depth-First Search (DFS) to explore root-to-leaf paths. Understood how to accumulate path strings during recursive calls. Learned to identify leaf nodes and finalize completed paths. Time Complexity: O(n) — visit each node once. Space Complexity: O(h) — recursion stack height (h = tree height). 👉 Tree problems teach us to explore step by step — each decision builds the full path 🌳💡 #LeetCode #DSA #ProblemSolving #100DaysChallenge #Day46 #CodingJourney #Python #BinaryTree #DFS
To view or add a comment, sign in
-
-
💡 Python Tip of the Day 🧠 Remove Duplicates Using Sets Simplify your list instantly! ✅ Sets automatically remove duplicates — quick & clean! #PythonTips #SetTricks #DataCleaning #LearnPython #ProgrammingTips
To view or add a comment, sign in
-
-
💡 Python Tip of the Day 🧠 Using range() in Loops Loop with Numbers Like a Pro Use range() to repeat actions a set number of times. ✅ Perfect for counting or generating sequences! #PythonLoops #RangeFunction #CodingTips #LearnPython
To view or add a comment, sign in
-
-
Day 9 of #100DaysOfLeetCode Problem: 21. Merge Two Sorted Lists Category: Linked List / Two Pointers Today’s challenge focused on merging two sorted linked lists into a single sorted list. This problem was a great refresher on pointer management, conditional linking, and efficient traversal through nodes. 🧠 Key Learnings: Used two pointers to compare nodes from both lists and attach the smaller node to the merged list. Managed the traversal smoothly without losing reference to the new head node. Reinforced the concept of dummy nodes for cleaner list initialization. Strengthened confidence in working with linked data structures and node connections. 🎯 Takeaway: Linked lists teach the importance of precise pointer handling — one wrong reference can change the entire structure! #LeetCode #100DaysOfCode #ProblemSolving #CodingJourney #LinkedList #Pointers #Python #AIEngineer #Consistency
To view or add a comment, sign in
-
-
🎯 Day 54 of My Data Analytics Journey 📘 Today, I explored one of the core Python libraries for data handling — NumPy I learned about some powerful concepts that make data manipulation easy and efficient: 🔹 Reshaping — changing the structure of arrays to different dimensions 🔹 Resizing — adjusting array size dynamically 🔹 Stacking — combining multiple arrays together 🔹 Splitting — breaking arrays into smaller parts 🔹 Worked with 1D, 2D, and 3D arrays to understand how data transforms across dimensions GitHub:🔗 https://lnkd.in/ggHuzHSh 💡 Each topic helped me understand how NumPy forms the foundation for advanced data analysis and machine learning tasks. #DataAnalytics #NumPy #Python #LearningJourney #Day54 #DataScience #MachineLearning #ContinuousLearning #RamyaAnalyticsJourney
To view or add a comment, sign in
-
-
𝗦𝗲𝗺𝗮𝗻𝘁𝗶𝗰 𝗟𝗶𝗻𝗸 𝗟𝗮𝗯𝘀, 𝘁𝗵𝗲 𝗚𝗹𝘂𝗲 𝗕𝗲𝘁𝘄𝗲𝗲𝗻 𝗬𝗼𝘂𝗿 𝗗𝗮𝘁𝗮 𝗮𝗻𝗱 𝗜𝗻𝘀𝗶𝗴𝗵𝘁𝘀 🧪 Semantic Link Labs is an open-source Python library built upon the existing Semantic Links implementation in Microsoft Fabric. In our latest blog, we dive into how this library can automate processes, from table creations to visualizing dependencies. Explore our full post below 👇 and discover how you can use Semantic Link Labs to enhance your Fabric and Power BI setups! https://lnkd.in/eVjq6Rh5 #DataEngineering #MicrosoftFabric #SemanticLinkLabs #Blog
To view or add a comment, sign in
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