Competitive programming preparation Any problems I found useful, I will upload here with working code in cpp. This is to document improvement and write any solutions I found interesting or particularly helpful.
Starting with the Top 100 Liked Questions.
problem 21: merge two sorted arrays
problem 169: find the majority element in an array
problem 283: move zeroes to end of the array
problem 448: find all numbers disappeared
problem 70: Climbing Stairs
problem 101: Symmetrical Trees - marked to try again in the future.
problem 427: path sum III - found this difficult, not very comfortable with trees at the moment
problem 1: two sum - interesting information about use of hashmaps
problem 155: min stack - again, more interesting use of hasing to provide constant time solutions
problem 141: linked list cycle: two pointers- floyd algorithm
problem 234; isPALINDROME?????? - two pointers used - finding the middle of a linked list
problem 581:Shortest Unsorted Continuous Subarray - takes a variety of thinking. nice solution and defo worth looking over
problem 338: counting bits - did not complete myself, need to have better look at patterns in bits
problem 401: binary watch - backtracking problem
problem 746: min cost climbing stairs - dynamic programming with some greedy