Also got hands-on with Git Bash and understood how to manage Python dependencies using a virtual environment.
Small progress, but a good start! ๐
#LearningInPublic
Started learning FastAPI with Python today! ๐
First understood what FastAPI is and why it's used to build APIs.
Excited to explore backend development! ๐ป
#Python#FastAPI
Wrapped up a solid revision session today ๐
๐น Revised my complete DSA
๐น Practiced multiple coding problems
๐น Used GeeksforGeeks for learning & revision
๐น Revised AI Basics โ ML, DL, Neural Networks & more
#DSA#INTERVIEWBIT
Todayโs DSA progress ๐
๐น Revised Binary Search from the basics
๐น Strengthened my understanding of the approach & logic
๐น Solved multiple Binary Search problems
๐น Practiced identifying search-space patterns and edge cases
#DSA#INTERVIEW BIT
๐ Linked List Progress!
Today I practiced multiple Linked List problems on LeetCode and learned:
๐น Rearranging nodes
๐น Detecting Linked List Cycle
๐น Deleting nodes
๐น Tortoise & Hare approach ๐ข๐
๐น Solved problems using the concepts I learned
#DSA#LinkedList#LeetCode
Today I learned how to insert an element at the head and at a specific position in a Linked List. ๐
Also solved a LeetCode problem and understood the code step-by-step.
Another solid step forward in DSA! ๐
#DSA#LinkedList#LeetCode#Python#Learning
Today I revised Linked List concepts in DSA. ๐
Learned:
โข Data & Nodes
โข Traversal method
โข Insert method
โข Append method
Also solved a Linked List problem on LeetCode. ๐ป
Slowly building stronger DSA fundamentals every day. ๐ฅ
Today I learned the basics of Linked Lists in DSA. ๐
โข Difference between Array, List & Linked List
โข Linked List as a Data Structure
โข Understanding Nodes and their structure
โข Data + Next (reference/address)
โข How "next" connects one node to the next in memory
Today I solved First & Last Occurrence using Lower Bound & Upper Bound with Binary Search. ๐
Learned how Lower & Upper Bound can be used to find exact positions efficiently.
O(log n) ๐
#DSA#Python#INTERVIEW BIT
Today I learned Floor & Ceil using Binary Search ๐
Understood how to find the largest element smaller than or equal to the target (Floor) and the smallest element greater than or equal to the target (Ceil) with Time complexity
#inrerview bit#DSA
Todayโs DSA progress ๐
โข Learned Lower Bound & Upper Bound
โข Implemented both using Binary Search
โข Solved InterviewBit questions
โข Solved a LeetCode problem
Slowly building strong DSA fundamentals every day. ๐ป๐ฅ
#DSA#BinarySearch#LeetCode#InterviewBit
Today I learned Binary Search ๐
I understood how we divide the search space into half, compare the middle element, and decide which half to search next. Also learned how Binary Search can be implemented using recursion.
Time Complexity: O(log n) ๐
Today I solved the 3Sum problem and learned a better approach with O(nยฒ) time complexity.
I also learned how to use sets with tuples, why lists are not hashable, and how sorting helps us build a more optimized solution.
Small improvement, but a big learning! ๐
#DSA#Python
While solving the 3- Sum problem I learned a new Python concept
I found out that a list cannot be added to a set because lists are not hashable. But tuples are hashable, so after sorting the array, I can convert the result into a tuple and store it in a set to avoid duplicate.
Today I solved the Maximum Non-Negative Subarray problem on LeetCode and learned how to handle continuous subarrays using a running sum.
Concepts I practiced:
โข Array traversal
โข Subarrays
โข Running sum
โข Maximum sum tracking
โข Handling negative elements
Todayโs DSA progress ๐
โ Learned how to print a matrix in spiral order
โ Solved InterviewBit questions
โ Solved LeetCode problems
โ Learned how to rotate a matrix by 90ยฐ
๐ฎ Started building a Stone Paper Scissors game
Learning, coding, and improving every day! ๐ป๐ฅ
Todayโs DSA progress ๐
Solved the Longest Consecutive Sequence problem on LeetCode, learned about 2D Lists & Matrices, and worked on Set Matrix Zeroes.
Along with that, solved questions on InterviewBit. Slowly building stronger problem solving skills ๐๐