17/12/2023

Starting the #100DaysOfCode challenge today!

My main focus will be on #DSA

• Reason: building good coding habits through consistency

Arrays: Day 1 of #100DaysOfCode

with a fresh dive into data structures, starting with arrays!

• Solved a massive sum problem and Compare the Triplets on HackerRank
• Both with tc of O(n) and sc of O(1)

Day 2 of #100DaysOfCode

• Learned Big O notation time complexity

Arrays:

• Solved Find Peak Element medium level problem on leetcode in tc of O(n) linear and sc of O(1) constant

Day 3 of #100DaysOfCode

• Learned Object Big O time complexity and Array Big O time complexity
• Optimized portfolio backend reduced response time by 1.2s

Arrays and Math:

• Solved fibGenerator problem on leetcode in tc of O(n) linear

Day 4 of #100DaysOfCode

• Learned Big O Math algorithms

• Structured Case studies page for my portfolio website

• Started #Codemonk on @HackerEarth

Math:

• GCD, Factorial Of Number, Prime Number, pow of 2

day 5 of #100DaysOfCode

• learned about brute approach and optimal solution
• learned about two pointer approach
• added loading skeleton to blogs page of my portfolio website

Arrays:

• Solved Rotate Array to k step medium level problem on leetcode

day 6 of #100DaysOfCode

• learned about Matrics Arrays
• learned about Inversions in Arrays
• learned rational expression(regExp)
• learned and used string-searching algorithms

Arrays:

• Solved Matrics Inversions problem on HackerEarth in brute and optimal with O(n^2)
• Solved Rotate String problem on leetcode in brute and optimal approach with O(1)

day 7 of #100DaysOfCode

• learned more about Matrics Arrays
• learned about Math object and how it affects the time and space complexity

Arrays:

• Solved Find All Peaks on leetcode in tc of O(n) and sc of O(1)
• Solved Diagonal Difference with tc of linear O(n) on HackerRank
• Solved Diagonal Difference with tc of linear O(n) and sc of O(n+2) on HackerRank
• Solved Plus Minus with tc of linear O(n) on HackerRank
• Solved Left Rotation with tc of linear O(n) on HackerRank
• Solved Staircase with tc of linear O(n) on HackerRank

day 8 of #100DaysOfCode

• Initialized Case studies page Nav Container
• Getting closer to finish of My portfolio website

Arrays:

• Solved Container With Most Water medium level problem on leetcode in tc of O(n) and sc of O(1)
• Solved mini-max sum in tc of O(n) and sc of O(1) on HackerRank
• Solved Birthday Cake Candles with tc of linear O(n) on HackerRank

day 9 of #100DaysOfCode

• Improved two pointer approach
• Solved first Hard level problem on leetcode
• Improved Case studies page of my portfolio website

Arrays and Binary Search:

• Solved hard level Median of Two Sorted Arrays problem on leetcode in tc of O(n+n) and sc of O(n+m)
• Solved Time Conversion in tc of O(1) constant and sc of O(1) constant on HackerRank

day 10 of #100DaysOfCode

• Improved Arrays methods
• Optimized Blogs page for faster reloads and managed to reduce loading time by ~1s

Arrays and dp:

• Solved Remove Duplicates from Sorted Array on leetcode in tc of O(n) and sc of O(1) constant
• Solved candles Counting in Dynamic Programming on HackerRank

day 11 of #100DaysOfCode

• Improved Two pointer methods
• Removed a bug that causing multiple click on search button on Blogs page

Arrays dp:

• Solved Remove Element on leetcode in tc of O(n) and sc of O(1) constant
• Solved Hyper Strings advance level quetion and scored 86.79/90 in Dynamic Programming on HackerRank

day 12 of #100DaysOfCode

• Improved Two pointer methods
• Initialized Case studies NavBar component
• Fixed bug of Search input not being focused on first click

Arrays:

• Solved 3Sum medium level on leetcode in tc of O(n^2) and Beats 98.59% in space complexity

day 13 of #100DaysOfCode

• Fixed error of not loading content on Case studies page
• Completed Nav Section of Case Studies Page

Arrays:

• Solved 3 Sum Closest medium level on leetcode in tc of O(n^2)
• Solved grading studants on HackerRank in tc of O(n)

day 14 of #100DaysOfCode

• Reached 4 star in problem Solving on HackerRank
• Improved Nav Section of Case Studies page

Arrays:

• Solved 4Sum medium level on leetcode Beats 98.04% of space complexity
• Solved Picking Numbers on HackerRank in tc of O(n+2) and sc of O(1) constant

day 15 of #100DaysOfCode

• Implemented Get and Post Endpoints for Case Studies Page
• Implemented Show and Add Components In CMS to handle create and read operation for Case Studies

BinarySearch:

• Solved Search in Rotated Sorted Array medium level on leetcode Beats 94.63% of space complexity

day 16 of #100DaysOfCode

• Implemented Patch and delete Endpoints for Case Studies Page
• Implemented Update Components and Remove button In CMS to handle patch and delete operation for Case Studies

BinarySearch:

• Solved Find First and Last Position of Element in Sorted Array medium level on leetcode with tc of O(log n) and sc of O(1)

day 17 of #100DaysOfCode

• Updated backend to send necessary data only
• ReBuild Show Component and added .title to req data from backend In CMS for Case Studies

Array:

• Solved next permutation medium level on leetcode with tc of O(n log n) and sc of O(1)

day 18 of #100DaysOfCode

• Implemented Case study Components and Nav Component to req data from backend in portfolio for Case Studies

Array:

• Solved Jump Game I and Jump Game II medium level on leetcode with tc of O(n) and sc of O(1)
• Solved Absolute Permutation Problem medium level on HackerRank with tc of O(n) and sc of O(1)

day 19 of #100DaysOfCode

• Improved portfolio case study page to handle different types of data
• Added private Endpoints to req and get data from database

Array:

• Solved Remove Duplicates from Sorted Array II medium level on leetcode with tc of O(n) and sc of O(1)
• Solved multiple of 3 and 5 medium level on HackerRank with tc of O(n) and sc of O(1)

day 20 of #100DaysOfCode

• Structured portfolio case study page
• Added Featurs and conclusion Components in case study page

Recursion:

• Solved Reverse Nodes in k-Group hard level on leetcode with tc of O(n) and sc of O(1) that Beats 93.66% in runtime and 88.11% in Memory in JavaScript

day 21 of #100DaysOfCode

• caching the case study data
• added middleware to handle re-fetching and caching in case study page

Recursion:

• Solved Permutation I medium level on leetcode with tc of O(n log n) and sc of O(1) that Beats 98.57% in runtime and Beats 82.33% in Memory in JavaScript

day 22 of #100DaysOfCode

• Initialized Flow Component to show the software architacture
• Updated case Studies items Component to handle JSON data of flow chart

Recursion:

• Solved Min Time medium level on geeksforgeeks with tc of O(n^2) and sc of O(1) in JavaScript
• Solved Search Insert on leetcode with tc of O(log n) and sc of O(1) Beats 96.96% in JavaScript runtime

day 23 of #100DaysOfCode

• Fixed flow chart mistouch bug
• Fixed layouting and responsivness of flow chart

Recursion:

• Solved Permutation I medium level on leetcode with tc of O(n * n) and sc of O(1) that Beats 98.31% in runtime in JavaScript

day 24 of #100DaysOfCode

• Fixed flow chart touch behaivior
• Updated layouting and responsivness of flow chart

Array:

• Solved Largest Prime and Even Fibonacci Sum medium level on HackerRank with tc of O(n) and sc of O(1)

day 25 of #100DaysOfCode

• Added data filtering in Case Studies Page
• Improved Case study layouting

Array:

• Solved Sort Colors medium level on leetcode with tc of O(log n) and sc of O(1) Beats 86.57% in runtime with JavaScript

day 26 of #100DaysOfCode

• Updated data filtering in Case Studies Page to handle complex data
• Improved backend Core logic for Cs page data

Array:

• Solved Triangle Minimum Sum Total medium level on leetcode with tc of O(log n) and sc of O(1) Beats Beats 98.24% in runtime with JavaScript

day 27 of #100DaysOfCode

• Optimized backend case study Api reduced response time by 0.6s
• Improved cache storing logic for Cs page data

Array:

• Solved Find Minimum In Rotated Sorted Array medium level on leetcode with tc of O(log n) and sc of O(1) Beats Beats 84.33% in runtime with JavaScript

day 28 of #100DaysOfCode

• Created architacture flow for Ai-mrk project
• Improved flow chart functionality

BinarySearch:

• Solved Search in Rotated Sorted Array II medium level on leetcode with tc of O(n) and sc of O(1) Beats Beats 98.78% in runtime with JavaScript

day 29 of #100DaysOfCode

• Added flow animation in Ai-mrk flow
• Fixed flow element mistouch bug on case study page

BinarySearch:

• Solved Find Minimum in Rotated Sorted Array II Hard level on leetcode with tc of O(n) and sc of O(1) Beats Beats 99.65% in runtime with JavaScript

day 30 of #100DaysOfCode

• Updated flow animation in Flow chart of Case study page
• Fixed pixel saturation in flow animation of Ai-mrk flow

Array :

• Solved Insert Intervel medium level on leetcode with tc of O(n) and sc of O(1) Beats Beats 96.88% in runtime with JavaScript

day 31 of #100DaysOfCode

• Planning new layout of Case Studies Page On My portfolio website
• Optimized Blogs Component to load blogs smoothly

Array :

• Solved Merge Intervel medium level on leetcode with tc of O(n) and sc of O(1) Beats Beats 99.16% in runtime with JavaScript

day 32 of #100DaysOfCode

• Added Search filter in Blogs Component
• Added Search highlighter in Blogs Component

Array :

• Solved Combination Sum medium level on leetcode with tc of O(log n) and sc of O(1) Beats 98.8% in runtime with JavaScript

day 33 of #100DaysOfCode

• Added Quick Navigation in head of the page
• Improved Search highlighter in Blogs Component

Array :

• Solved Swap Nodes in Pairs medium level on leetcode with tc of O(n) and sc of O(1) Beats 83.81% in runtime with JavaScript

day 34 of #100DaysOfCode

• Improved Quick Navigation in head of the page
• ReWrite Search highlighter code for better performence in Blogs Component

Linked List :

• Solved Add Two Numbers medium level on leetcode with tc of O(max(m, n)) and sc of O(1) Beats 86.51% in runtime with JavaScript

day 35 of #100DaysOfCode

• Added Github Navigation in head of the page
• Optimized Search highlighter code in Blogs Component

Linked List :

• Solved Remove Nth Node From End of List medium level on leetcode with tc of O(n) and sc of O(1) Beats 96.33% in runtime with JavaScript

day 36 of #100DaysOfCode

• Added Zoom buttons in Flow Component of Case Studies page
• Learned about Backtracking algorithm

Array :

• Solved Combination Sum II medium level on leetcode with tc of O(n^2) and sc of O(1) Beats 86.8% in runtime with JavaScript

day 37 of #100DaysOfCode

• Improved Zoom buttons functionality in Flow Component of Case Studies page
• Learned about Bit Manipulation

Array :

• Solved Single Number I on leetcode with tc of O(n) and sc of O(1) Beats 88.82% in runtime with JavaScript

day 38 of #100DaysOfCode

• Improved CsNavBar Component functionality in portfolio Case Studies page
• Learning about Bit Manipulation

Array :

• Solved Single Number II medium level on leetcode with tc of O(n) and sc of O(1) Beats 99.10% in runtime with JavaScript

day 39 of #100DaysOfCode

• Improved Home page Navigation
• Learned about Backtracking and Bit Manipulation

Backtracking :

• Solved SubSets I medium level on leetcode with tc of O(n) and sc of O(1) Beats 82.05% in runtime with JavaScript

day 40 of #100DaysOfCode

• Optimized Home Page of my portfolio website by removing unnecessory animations
• Learning about Backtracking and Bit Manipulation

Backtracking :

• Solved SubSets II medium level on leetcode with tc of O(n^2) and sc of O(1) Beats 73.80% in runtime with JavaScript

day 41 of #100DaysOfCode

• Started working more user freindly Head Navigation of my portfolio website
• Learning more about Backtracking and Bit Manipulation

Backtracking :

• Solved Move Zeroes on leetcode with tc of O(n log n) and sc of O(1) Beats 96.48% in runtime with JavaScript

day 42 of #100DaysOfCode

• working on Head Navigation of my portfolio website
• Learning Bit Manipulation

DP :

• Solved Pascal's Triangle on leetcode with tc of O(n ^ 2) and sc of O(1) Beats 86.35% in runtime with JavaScript

day 43 of #100DaysOfCode

• working styling Head Navigation of my portfolio website
• Learning Bit Manipulation

DP and Array:

• Solved Pascal's Triangle II on leetcode with tc of O(2n) and sc of O(1) Beats 96.5% in runtime with JavaScript

day 44 of #100DaysOfCode

• working styling Head Navigation of my portfolio website(due to busy schedual i can't give proper time to my portfolio development)
• Learning Bit Manipulation and Binary Search

Array and BinarySearch:

• Solved Find Right Interval on leetcode with tc of O(n log n) and sc of O(1) Beats 97.94% in runtime with JavaScript

day 45 of #100DaysOfCode

• Finishing of styling Head Navigation of my portfolio website
• Learning Binary Search

Array and BinarySearch:

• Solved Single Num In Sorted Array on leetcode with tc of O(log n) and sc of O(1) Beats 90.94% in runtime with JavaScript

day 46 of #100DaysOfCode

• To prevent bot spam adding recaptcha in contact form of About Page
• Learning Binary Search and Bit Manipulation

Array and BinarySearch:

• Solved UTF-8 Validation on leetcode with tc of O(log n) and sc of O(1) Beats 80.00% in runtime with JavaScript

day 47 of #100DaysOfCode

• Added recaptcha in contact form of About Page of my portfolio website
• Learning Bit Manipulation

Array and Bit Manipulation:

• Solved Count Complete Tree Nodes on leetcode with tc of O(n) and sc of O(1) Beats 94.71% in runtime and 90.9 in Memory with JavaScript

day 48 of #100DaysOfCode

• Improved recaptcha in contact form of About Page
• Learning Bit Manipulation and BinarySearch

Array and BinarySearch:

• Solved Find the Duplicate Number on leetcode with tc of O(n) and sc of O(1) Beats 86.43% in runtime and 74% in Memory with JavaScript

day 49 of #100DaysOfCode

• Started working on CsNav Styling and making it more responsive
• Learning Bit Manipulation and BinarySearch

Array and BinarySearch:

• Solved Hamming Distance on leetcode with tc of O(n) and sc of O(1) Beats 83.58% in runtime and 62% in Memory with JavaScript

day 50 of #100DaysOfCode

• Half journey done of 100 days of code
• Learning Bit Manipulation and BinarySearch

Array and BinarySearch:

• Solved Gray Code on leetcode with tc of O(2^n) and sc of O(1) Beats 95.24% in runtime and 76.21% in Memory with JavaScript

day 51 of #100DaysOfCode

• Finishing final layouting of CsNavBar Component
• Learning Bit Manipulation

Array and bit Manipulation:

• Solved Bitwise AND of Numbers Range on leetcode with tc of O(n) and sc of O(1) Beats 81.82% in runtime and 52% in Memory with JavaScript

day 52 of #100DaysOfCode

• Completed backend system for contact form using nodemailer
• Learning Bit Manipulation and Binary Search

Array and bit Manipulation:

• Solved Single Number III on leetcode with tc of O(n) and sc of O(1) Beats 96.43% in runtime and 83.9% in Memory with JavaScript

day 53 of #100DaysOfCode

• Optimized backend system for contact form and Implementing edt for security
• Learning Bit Manipulation and Binary Search

Array and bit Manipulation:

• Solved Divide Two Integers on leetcode with tc of O(log(n)) and sc of O(1) Beats 78.71% in runtime and 59.2% in Memory with JavaScript

day 54 of #100DaysOfCode

• Implemented edt for security in contact form of About page
• Learning Bit Manipulation

Array and bit Manipulation:

• Solved sum Of Two Integers on leetcode with tc of O(log(max(a, b))) and sc of O(1) Beats 92.55% in runtime and 48% in Memory with JavaScript

day 55 of #100DaysOfCode

• Started new project full stack webApp for RTSP video streaming
• Learning Bit Manipulation and Recursion

Recursion and bit Manipulation:

• Solved Power Of Two on leetcode with tc of O(log(2n)) and sc of O(1) Beats 84.02% in runtime and 63.84% in Memory with JavaScript

day 56 of #100DaysOfCode

• Added video stream backend logic in RTSP Stream video webApp
• Learning Bit Manipulation and Recursion

Recursion and bit Manipulation:

• Solved Power Of Four on leetcode with tc of O(log2n)) and sc of O(1) Beats 65.15% in runtime and 87.03% in Memory with JavaScript

day 57 of #100DaysOfCode

• Busy day not have enough time for projects
• Learning Bit Manipulation and Recursion

Recursion and bit Manipulation:

• Solved Binary Watch on leetcode with tc of O(log2n)) and sc of O(1) Beats 88.5% in runtime and 38.22% in Memory with JavaScript

day 58 of #100DaysOfCode

• Completed backend for RTSP video stream project
• Learning Bit Manipulation

bit Manipulation :

• Solved Number Complement on leetcode with tc of O(log2n)) and sc of O(1) Beats 93.56% in runtime and 57.9% in Memory with JavaScript

day 59 of #100DaysOfCode

• Started working on Styling frontend for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Binery Gap on leetcode with tc of O(log2n)) and sc of O(1) Beats 96.05% in runtime and 43.22% in Memory with JavaScript

day 60 of #100DaysOfCode

• Working on frontend ReactJS for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Prime Number of Set Bits in Binary Representation on leetcode with tc of O(log2N)) and sc of O(1) Beats 99.05% in runtime and 48.57% in Memory with JavaScript

day 61 of #100DaysOfCode

• Completed RTPS Video Component on frontend for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Total Hamming Distance on leetcode with tc of O(log2n)) and sc of O(1) Beats 98.21% in runtime and 43.88% in Memory with JavaScript

day 62 of #100DaysOfCode

• Working on Overlay text Component on frontend for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Convert a Number to Hexadecimal on leetcode with tc of O(log2n)) and sc of O(1) Beats 92.24% in runtime and 63.91% in Memory with JavaScript

day 63 of #100DaysOfCode

• Finishing of Overlay text Component on frontend for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Decode XORed Array on leetcode with tc of O(2^n)) and sc of O(1) Beats 97.3% in runtime and 44.8% in Memory with JavaScript

day 64 of #100DaysOfCode

• Working on Overlay logo Component on frontend for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Decode XORed Permutation on leetcode with tc of O(logn) and sc of O(1) Beats 74.1% in runtime and 86.48% in Memory with JavaScript

day 65 of #100DaysOfCode

• Created backend system for adding .png .jpg files in the database for Overlay logo Component for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Binary Number with Alternating Bits on leetcode with tc of O(logn) and sc of O(1) Beats 76.04% in runtime and 52.7% in Memory with JavaScript

day 66 of #100DaysOfCode

• Completed backend system for adding img files in the database for Overlay logo for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Complement of Base 10 Integer on leetcode with tc of O(log n) and sc of O(1) Beats 81.46% in runtime and 43.05% in Memory with JavaScript

day 67 of #100DaysOfCode

• Completed backend system for Text Overlay in the database for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Bitwise ORs of Subarrays on leetcode with tc of O(logn) and sc of O(1) Beats 100.0% in runtime and 100.0% in Memory with JavaScript

day 68 of #100DaysOfCode

• Styling Text Overlay Component for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Minimum Flips to Make a OR b Equal to c on leetcode with tc of O(n) and sc of O(1) Beats 85.33% in runtime and 54.1% in Memory with JavaScript

day 69 of #100DaysOfCode

• Optimized Text Overlay backend code for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Find XOR Sum of All Pairs Bitwise AND on leetcode with tc of O(n) and sc of O(1) Beats 100.00% in runtime and 72.73% in Memory with JavaScript

day 70 of #100DaysOfCode

• Working on styling OverlayLogo Component for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved XOR Operation in an Array on leetcode with tc of O(n) and sc of O(1) Beats 96.60% in runtime and 55.9% in Memory with JavaScript

day 71 of #100DaysOfCode

• Working on styling OverlayText Component for RTSP video streaming web app
• Learning Bit Manipulation

bit Manipulation:

• Solved Find Xor-Beauty of Array on leetcode with tc of O(n) and sc of O(1) Beats 92.86% in runtime and 44.23% in Memory with JavaScript

day 72 of #100DaysOfCode

• Working on test assignment for Radiant Riches using ReactJS and tailwindCSS with SASS
• Learning Bit Manipulation

Bit Manipulation:

• Solved and Revised Diagonal Difference with tc of linear O(n^2) and sc of O(1) on HackerRank

day 73 of #100DaysOfCode

• Submitted test assignment for Radiant Riches with additional featurs like responsiveness
• Learning Bit Manipulation

Bit Manipulation:

• Solved Find The Original Array of Prefix Xor on leetcode with tc of O(n^2) and sc of O(1) Beats 93.95% in runtime and 63.73% in Memory with JavaScript

day 74 of #100DaysOfCode

• Completed OverlayText Component now working on styling
• Learning Bit Manipulation

Bit Manipulation:

• Solved Find Bottom Left Tree Value JavaScript on leetcode with tc of O(n^2) and sc of O(1) Beats 71.76% in runtime and 44.8% in Memory with JavaScript

day 75 of #100DaysOfCode

• Completed OverlayLogo Component now working on styling
• Learning Bit Manipulation

Bit Manipulation:

• Solved Pow(x, n) on leetcode with tc of O(n^2) and sc of O(1) Beats 85.33% in runtime and 63.1% in Memory with JavaScript

day 76 of #100DaysOfCode

• Completed styling OverlayLogo Component of RTPS video web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Check if Bitwise OR Has Trailing Zeros on leetcode with tc of O(n^2) and sc of O(1) Beats 80.98% in runtime and 48.21% in Memory with JavaScript

day 77 of #100DaysOfCode

• Working on Log system on backend of RTPS video web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Minimum Bit Flips to Convert Number on leetcode with tc of O(n^2) and sc of O(1) Beats 100.00% in runtime and 33.62% in Memory with JavaScript

day 78 of #100DaysOfCode

• Adding event log system in the backend of RTPS video web app to make it more maintainable
• Learning Bit Manipulation

Bit Manipulation:

• Solved Minimum Number of Operations to Make Array XOR Equal to K on leetcode with tc of O(n^2) and sc of O(1) Beats 78.99% in runtime and 64.68% in Memory with JavaScript

day 79 of #100DaysOfCode

• Completed Task one Registeration Form using HTML/CSS, NodeJS Express and mongoDB and submited it
• Learning Bit Manipulation

Bit Manipulation:

• Solved Find the K-or of an Array on leetcode with tc of O(n) and sc of O(1) Beats 97.14% in runtime and 44.02% in Memory with JavaScript

day 80 of #100DaysOfCode

• Completed Task two Blogs website using HTML/CSS and ejs for ui, NodeJS Express for backens and mongoDB for database and submited it
• Learning Bit Manipulation

Bit Manipulation:

• Solved Number of Even and Odd Bits on leetcode with tc of O(log n) and sc of O(1) Beats 94.33% in runtime and 55.48% in Memory with JavaScript

day 81 of #100DaysOfCode

• Working on task three Money Tracker website using HTML/CSS, NodeJS and mongoDB
• Learning Bit Manipulation

Bit Manipulation:

• Solved Concatenation of Consecutive Binary Numbers on leetcode with tc of O(n) and sc of O(1) Beats 100.00% in runtime and 82.11% in Memory with JavaScript

day 82 of #100DaysOfCode

• Completed on task three Money Tracker website using HTML/CSS, NodeJS and mongoDB and Submitted
• Learning Bit Manipulation

Bit Manipulation:

• Solved Sum of Values at Indices With K Set Bits on leetcode with tc of O(n) and sc of O(1) Beats 92.88% in runtime and 67.55% in Memory with JavaScript

day 83 of #100DaysOfCode

• Improving Log System on RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved XOR Queries of a Subarray on leetcode with tc of O(n + m) and sc of O(n + m) Beats 100.00% in runtime and 55.03% in Memory with JavaScript

day 84 of #100DaysOfCode

• Adding different log space for every known events like Error Log, Debugging Log, Info Log, Network Logs, User Interaction Logs etc.
• Learning Bit Manipulation

Bit Manipulation:

• Solved Maximum XOR After Operations on leetcode with tc of O(n) and sc of O(1) Beats 83.71% in runtime and 44.1% in Memory with JavaScript

day 85 of #100DaysOfCode

• Added Error Log and Network Log in RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Pyramid Transition Matrix on leetcode with tc of O(2^n) and sc of O(1) Beats 55.39% in runtime and 86.77% in Memory with JavaScript

day 86 of #100DaysOfCode

• Added Debugging Log in RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Counting Bits on leetcode with tc of O(n) and sc of O(1) Beats 92.11% in runtime and 48.04% in Memory with JavaScript

day 87 of #100DaysOfCode

• Added Info Log in RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Smallest Subarrays With Maximum Bitwise OR on leetcode with tc of O(n) and sc of O(n) Beats 100.00% in runtime and 100.00% in Memory with JavaScript

day 88 of #100DaysOfCode

• Working on User Interaction Log in RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Number of Steps to Reduce a Number to Zero on leetcode with tc of O(n) and sc of O(n) Beats 86.22% in runtime and 77.02% in Memory with JavaScript

day 89 of #100DaysOfCode

• Added User Interaction Log in RTPS video streaming web app
• Learning Bit Manipulation

Bit Manipulation:

• Solved Longest Subarray With Maximum Bitwise AND on leetcode with tc of O(n) and sc of O(n) Beats 90.00% in runtime and 70.00% in Memory with JavaScript

day 90 of #100DaysOfCode

• Working on Server Cache Log in RTPS video streaming web app
• Learning Dynamic programming

Dynamic Programming:

• Solved Maximum Number of Operations With the Same Score I on leetcode with tc of O(n) and sc of O(2^n) Beats 64.02% in runtime and 72.44% in Memory with JavaScript

day 91 of #100DaysOfCode

• Added Server Cache Log in RTPS video streaming web app
• Learning Dynamic programming

Dynamic Programming:

• Solved Maximum Number of Operations With the Same Score II on leetcode with tc of O(n) and sc of O(n) Beats 55.90% in runtime and 48.21% in Memory with JavaScript

day 92 of #100DaysOfCode

• Improving Error Log and Server Cache Log in RTPS video streaming web app
• Learning Dynamic programming

Dynamic Programming:

• Solved Longest Unequal Adjacent Groups Subsequence I on leetcode with tc of O(n) and sc of O(n) Beats 90.76% in runtime and 66.1% in Memory with JavaScript

day 93 of #100DaysOfCode

• Finishing RTPS video streaming web app and conducting final testing
• Learning Dynamic programming

Dynamic Programming:

• Solved Length of the Longest Subsequence That Sums to Target on leetcode with tc of O(n) and sc of O(n) Beats 61.50% in runtime and 75.99% in Memory with JavaScript

day 94 of #100DaysOfCode

• Will improve the RTPS video stream web app in near future
• backend work done for now https://github.com/AjayShukla007/rtspStreamBackend
• Learning Dynamic programming

Dynamic Programming:

• Solved Minimum Moves to Spread Stones Over Grid on leetcode with tc of O(n * 2^n) and sc of O(2^n) Beats 100.00% in runtime and 65.79% in Memory with JavaScript

day 95 of #100DaysOfCode

• Started working on personal portfolio website again
• Learning Dynamic programming

Dynamic Programming:

• Solved Visit Array Positions to Maximize Score on leetcode with tc of O(n) and sc of O(1) Beats 74.22% in runtime and 70.61% in Memory with JavaScript

day 96 of #100DaysOfCode

• reStyling csNavBar Component on personal portfolio website
• Learning Dynamic programming

Dynamic Programming:

• Solved Ways to Express an Integer as Sum of Powers on leetcode with tc of O(n) and sc of O(1) Beats 64.77% in runtime and 48.01% in Memory with JavaScript

day 97 of #100DaysOfCode

• Added more responsiveness in csNavBar Component on personal portfolio website
• Learning Dynamic programming

Dynamic Programming:

• Solved Join Two Arrays by ID on leetcode with tc of O(n) and sc of O(1) Beats 87.88% in runtime and 63.04% in Memory with JavaScript

day 98 of #100DaysOfCode

• Working on styling caseStudies Component on personal portfolio website
• Learning Math in dsa

Math:

• Solved Calculate Delayed Arrival Time on leetcode with tc of O(1) and sc of O(1) Beats 100.00% in runtime and 78.07% in Memory with JavaScript

day 99 of #100DaysOfCode

• Fixed responsive width issue Projects Component on personal portfolio website
• Learning Math in dsa

Math:

• Solved Convert an Array Into a 2D Array With Conditions on leetcode with tc of O(1) and sc of O(1) Beats 69.87% in runtime and 64.10% in Memory with JavaScript

day 100 of #100DaysOfCode

• Completed 100 day of code in JavaScript
• while this challenge is focused on dsa i have learned a lot new Programming concepts
• Learning Math in dsa

Math:

• Solved Alternating Digit Sum on leetcode with tc of O(n) and sc of O(1) Beats 62.28% in runtime and 71.02% in Memory with JavaScript

25/03/2024

Completed the #100DaysOfCode challenge today!

Thank you all who supported me in my journey