Day 212: Rotate List 🔄
Solved using Linked List traversal by converting the list into a circular list and finding the new head efficiently
#LeetCode#LinkedList#Cpp#DSA
Day 211: Minimum Cost For Tickets
Solved using Dynamic Programming + Memoization to find the minimum travel cost across all travel days
#LeetCode#DP#Memoization#Cpp#DSA
Day 210: Cheapest Flights Within K Stops
Solved using Dynamic Programming (Bellman-Ford style) to find the minimum flight cost within K stops
#LeetCode#DP#Graphs#Cpp