General CS Dev Study Guide for new hires

cs_dev_study_guide.txt

𝗕𝗮𝘀𝗶𝗰 𝗗𝗮𝘁𝗮-𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲𝘀
𝘌𝘷𝘦𝘳𝘺𝘰𝘯𝘦 𝘴𝘩𝘰𝘶𝘭𝘥 𝘬𝘯𝘰𝘸 𝘩𝘰𝘸 𝘵𝘩𝘦𝘺 𝘸𝘰𝘳𝘬, 𝘸𝘩𝘦𝘯 𝘵𝘰 𝘶𝘴𝘦 𝘵𝘩𝘦𝘮, 𝙝𝙤𝙬 𝙩𝙤 𝙞𝙢𝙥𝙡𝙚𝙢𝙚𝙣𝙩 𝙩𝙝𝙚𝙢 

• Array
• Set
• Hashmap
• Linked List
• Stack
• Queue
• Tree
• Graph


𝗔𝗱𝘃𝗮𝗻𝗰𝗲𝗱 𝗗𝗮𝘁𝗮-𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲𝘀
𝘠𝘰𝘶’𝘭𝘭 𝘴𝘦𝘦 𝘵𝘩𝘢𝘵 𝘵𝘩𝘦𝘴𝘦 𝘢𝘳𝘦 𝘮𝘢𝘥𝘦 𝘶𝘴𝘪𝘯𝘨 𝘵𝘩𝘦 𝘣𝘢𝘴𝘪𝘤 𝘰𝘯𝘦𝘴 𝘢𝘴 𝘣𝘶𝘪𝘭𝘥𝘪𝘯𝘨 𝘣𝘭𝘰𝘤𝘬𝘴. 𝘛𝘩𝘦𝘺 𝘤𝘢𝘯 𝘣𝘦 𝘱𝘰𝘸𝘦𝘳𝘧𝘶𝘭 𝘵𝘰𝘰𝘭𝘴 𝘵𝘰 𝘩𝘦𝘭𝘱 𝘺𝘰𝘶 𝘤𝘰𝘮𝘦 𝘶𝘱 𝘸𝘪𝘵𝘩 𝘲𝘶𝘪𝘤𝘬 𝘢𝘯𝘥 𝘱𝘦𝘳𝘧𝘰𝘳𝘮𝘢𝘯𝘵 𝘴𝘰𝘭𝘶𝘵𝘪𝘰𝘯𝘴.

• Heap (a.k.a Priority Queue)
• LRU Cache
• Binary Search Tree
• Disjoint Set
• Trie
• Skip List

𝗕𝗮𝘀𝗶𝗰 𝗦𝗲𝗮𝗿𝗰𝗵𝗶𝗻𝗴/𝗧𝗿𝗮𝘃𝗲𝗿𝘀𝗮𝗹 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀
𝘚𝘰𝘮𝘦 𝘴𝘵𝘳𝘶𝘤𝘵𝘶𝘳𝘦𝘴 𝘳𝘦𝘲𝘶𝘪𝘳𝘦 𝘮𝘰𝘳𝘦 𝘤𝘰𝘮𝘱𝘭𝘦𝘹 𝘮𝘦𝘵𝘩𝘰𝘥𝘴 𝘵𝘩𝘢𝘯 𝘢𝘳𝘳𝘢𝘺 𝘪𝘯𝘥𝘦𝘹𝘪𝘯𝘨 𝘰𝘳 𝘩𝘢𝘴𝘩𝘮𝘢𝘱 𝘬𝘦𝘺𝘴 𝘵𝘰 𝘧𝘪𝘯𝘥 𝘥𝘢𝘵𝘢. 𝘛𝘳𝘦𝘦𝘴 𝘢𝘯𝘥 𝘎𝘳𝘢𝘱𝘩𝘴 𝘶𝘴𝘦 𝘵𝘩𝘦𝘴𝘦 𝘣𝘢𝘴𝘪𝘤 𝘢𝘭𝘨𝘰𝘳𝘪𝘵𝘩𝘮𝘴.

• Breadth First Search (BFS)
• Depth First Search (DFS)
• Binary Search

𝗔𝗱𝘃𝗮𝗻𝗰𝗲𝗱 𝗦𝗲𝗮𝗿𝗰𝗵𝗶𝗻𝗴/𝗧𝗿𝗮𝘃𝗲𝗿𝘀𝗮𝗹 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀
I𝘯 𝘰𝘳𝘥𝘦𝘳 𝘰𝘧 𝘧𝘳𝘦𝘲𝘶𝘦𝘯𝘤𝘺.

• Quick Select
• Dijkstra
• Bellman-Ford
• A-star (rare)

𝗦𝗼𝗿𝘁𝗶𝗻𝗴 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺𝘀
𝘒𝘯𝘰𝘸 𝘩𝘰𝘸 𝘵𝘰 𝘪𝘮𝘱𝘭𝘦𝘮𝘦𝘯𝘵 𝘢𝘭𝘭 𝘰𝘧 𝘵𝘩𝘦𝘴𝘦 𝘸𝘪𝘵𝘩𝘰𝘶𝘵 𝘭𝘰𝘰𝘬𝘪𝘯𝘨 𝘢𝘯𝘺𝘵𝘩𝘪𝘯𝘨 𝘶𝘱.

• Quick Sort
• Merge Sort
• Topological Sort
• Counting Sort

𝗜𝗺𝗽𝗼𝗿𝘁𝗮𝗻𝘁 𝗧𝗼𝗽𝗶𝗰𝘀
• Recursion
• Greedy Algorithms
• Dynamic Programming
• Bit Manipulation (AND, NOT, OR, XOR)

𝗖𝗼𝗺𝗺𝗼𝗻 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀
𝘛𝘩𝘦𝘴𝘦 𝘱𝘢𝘵𝘵𝘦𝘳𝘯𝘴 𝘤𝘢𝘯 𝘣𝘦 𝘶𝘴𝘦𝘥 𝘵𝘰 𝘴𝘰𝘭𝘷𝘦 𝘮𝘢𝘯𝘺 𝘴𝘪𝘮𝘪𝘭𝘢𝘳 𝘢𝘭𝘨𝘰𝘳𝘪𝘵𝘩𝘮𝘴 𝘲𝘶𝘦𝘴𝘵𝘪𝘰𝘯𝘴

• Backtracking
• Two Pointers
• Sliding Window
• Divide & Conquer
• Reservoir Sampling

𝗠𝗮𝘁𝗵 𝗯𝗮𝘀𝗲𝗱 𝗽𝗿𝗼𝗯𝗹𝗲𝗺𝘀
• Permutations
• Combinations
• Factorial
• Power Set

𝗢𝘁𝗵𝗲𝗿 𝗖𝗼𝗺𝗺𝗼𝗻 𝗣𝗿𝗼𝗯𝗹𝗲𝗺𝘀
• String to Integer
• Integer to String
• Adding huge numbers (that can’t fit into memory)
• Add/Sub/Multiply/Div without using operators