There are different type of algorithms to solve questions in programming like sliding window for both strings and arrays finding subarrays sum in strings this technique is used to find substrings .The second one is greedy technique as the name suggest here for dynamic programming and arrays also.this two algorithms are very much important to solve the questions.in graph we learn different types of algorithms like kadane,dijkstra, etc.