<ul><li>Solved three problems on LeetCode: Sliding window maximum, Implement queue with stack and Perfect squares.</li><li>Sliding window maximum problem involves finding the maximum number in a sliding window of size k.</li><li>Approaches to solve Sliding window maximum problem: using nested for loop or using dequeue.</li><li>Implement queue with stack problem can be solved by using two stacks.</li><li>Perfect squares problem requires finding the minimum number of perfect squares that sum up to a given input number.</li></ul>

Logics in Problem Solving

Discover more