#LSPPDay51 I upgraded my backend database layer to SQLAlchemy 2.0, learning the modern ORM approach using Mapped, mapped_column() and select() queries. Also implemented proper table relationships for scalability.
#LearningWithLeapfrog#60DaysOfLearning2026]
@lftechnology
#LSPPDay49 I learnt to write and edit data in a real SQLite database using db.add() and db.commit() to insert new records and setattr() with exclude_none to partially update existing ones without overwriting other fields. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay47 I learned database integration for my FastAPI backend using SQLAlchemy and SQLite, setting up engine, creating a session factory, and defining tables with foreign key relationships so data persists. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay48 I migrated my CRM backend from an in-memory dict to SQLite database using SQLAlchemy, replacing dictionary operations with proper db sessions, queries and commits so data remains even after server restart. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay46 I built a full CRM UI with React and Tailwind connected to my FastAPI backend, featuring a customer list, stats dashboard, search and filter, customer detail panel with notes, and form for create and edit. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay45 Today, I built a basic CRM API with FastAPI covering full CRUD, nested routes for customer notes, query parameter filtering, proper error handling with HTTPException and a stats aggregation endpoint. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay42 Today, I implemented Dijkstra's shortest path algorithm in C++ using a min heap priority queue with adjacency list representation to find shortest distances from a source node in O((V+E) log V). #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay40 Today, I learned bit manipulation in C++, covering set, clear, toggle, check bits, counting set bits, power of 2 check, XOR swap, finding the odd one out in an array, and multiply/divide using bit shifts. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay39 Today, I started dynamic programming by solving the 0/1 knapsack problem, building a 2D DP table to maximize value within a weight capacity and backtracking through it to find which items were selected. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay38 Today, I extended my BST implementation with level order traversal using a queue, tree serialization and deserialization using preorder with null markers, and identity checking between two reconstructed trees. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay37 Today, I learnt to implement node deletion, preorder, postorder and level order traversals, finding the lowest common ancestor, validating the BST structure, and counting total nodes in binary tree in C++. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology
#LSPPDay35 Today, I solved two backtracking problems in C++. One is a maze solver that backtracks dead end paths to find a valid route and other is string permutations by swapping characters recursively at each position. #LearningWithLeapfrog#60DaysOfLearning2026@lftechnology