Day 6 – Data Structures and Algorithms Today I completed the Stack and Queue section from the video. I plan to spend more time practicing these problems, as I am still not fully comfortable with some of the concepts. In particular, I understood the brute-force approach for the Largest Rectangle in Histogram problem, but the optimal solution is still unclear to me. Since it is a hard-level problem, I will need to dedicate more time to understanding the underlying pattern and logic. I also worked on the Game of Two Stacks problem. I was able to grasp the idea, but not immediately. The use of recursion was new in this context, so I plan to revisit this problem after a week to strengthen my understanding. On the other hand, problems like Valid Parentheses and Minimum Add to Make Parentheses Valid felt much easier and more intuitive. These gave me confidence that my understanding is improving gradually. Overall, I can see steady progress in my learning. I am beginning to recognize patterns and think more clearly about problem-solving approaches. I would like to acknowledge Kunal Kushwaha for creating such a helpful DSA playlist—it has been a valuable resource in my journey. For now, I will shift my focus back to sorting techniques, as I have covered enough material for my college DSA test. #dataStructureAndAlgorithm #dsa #java #InterviewPrep #coding #engineering #faang
