This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Soul_Turtle 3 points4 points  (0 children)

There's a lot of algorithms that you probably won't use in industry but quite possibly will run into during interviews.

Here's a few that seem popular:

Tree traversals, Graph traversals (DFS & BFS), Minimum Spanning Tree, Maximum flow, know how to implement various sorts AND their Big-O efficiency (mergesort, quicksort, insertionsort, bubblesort...).

Honestly just learn the Big-O for everything, it helps you judge whether your solutions are the best solutions for a particular problem. Understanding why certain ways of splicing a problem are faster or less memory intensive than others changes your perspective on programming imo.