|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/coding-interview-cram-must-know-algorithms-and-questions/
课程评论：没有评论
Coursera 课程《Coding Interview Cram: Must Know Algorithms and Questions》旨在帮助学习者掌握数据结构和算法，以成功应对编码面试。本课程内容全面，涵盖了从基础的字符串、数组、矩阵操作，到链表、树、图的构建与应用，再到排序算法、时间复杂度分析（Big-O Notation）、动态规划以及位运算等高级主题。 课程通过丰富的实战编码示例，教授如何快速解决面试中常见的问题，并重点分析各种算法的时间复杂度。此外，课程还帮助学习者巩固 Kotlin 知识，并准备了由知名科技公司（如 Facebook, Google, Amazon, Spotify）常问的初级面试题目。 **课程亮点包括：** * **面试解题技巧：** 学习最佳的面试问题回答策略，以及如何清晰地阐述解题思路。 * **经典算法与数据结构：** 深入讲解了 FizzBuzz、字符串反转、数组旋转、Kth 最大元素、矩阵置零、螺旋矩阵、用链表实现队列、二叉树的构建与节点删除、图的构建、冒泡排序、选择排序、插入排序、归并排序等核心内容。 * **时间复杂度分析：** 重点讲解 Big-O Notation，并按照效率排序展示不同排序算法的时间复杂度。 * **动态规划实战：** 通过硬币找零、编辑距离、不同子序列计数等问题，学习动态规划的应用。 * **位运算技巧：** 掌握位运算符和移位运算符，并应用于寻找单个数字、计算二进制中 '1' 的位数等问题。 本课程是为应对 Kotlin 面试的学员量身定制的终极准备方案，强调理论知识与实践操作相结合，帮助学员在技术面试中脱颖而出。
Data Structures + Algorithms to Crack the Coding InterviewOnly in Coding Interview Cram: Must Know Algorithms and Questions, learn the best way to answer an interview question, look at the most commonly asked questions, and analyze time complexity of various algorithms.Interview Question Solutions and Time ComplexityLearn through hands-on coding examples and learn to solve problems quickly.Refresh your Kotlin knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.Algorithms & Data Structures - Ultimate Coding Interview PrepLearn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.Preparing for the Kotlin interview is hard. You need to understand not only concepts but also be able to articulate your thought process as you plan and execute a solution.COURSE BREAKDOWNSection 0: Introduction to Interview QuestionsCourse OverviewFizzBuzz: Print the numbers from 1 to 100 and for multiples of '3' print "Fizz" instead of the number and for the multiples of '5' print "Buzz".Section 1: String/Array Interview QuestionsReverse Words in a String: Given an input string, reverse the string word by word.Rotate Array: Rotate an array of n elements to the left by k steps.Kth Largest Element in an Array: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Section 2: Matrix Interview QuestionsSet Matrix Zeroes: Given a 2D matrix, if an element is 0, set its entire row and column to 0. Do it in place.Spiral Matrix: Given a 2D matrix, return all elements of the matrix in spiral order.Section 3: Linked List Interview QuestionsImplement a Queue Using a Linked List: Hit two data structures in one by implementing a queue and a linked list in one interview question.Section 4: Tree Interview QuestionsBuild a Binary Tree - Learn about binary trees and BST as you implement a highly asked about data structure, the binary tree.Delete a Tree NodeSection 5: Graph Interview QuestionsBuild a Graph: Each node in the graph contains a label and a list of its neighbors.Section 6: Sorting and Time ComplexityBubble Sort Algorithm: Sort a list with bubble sort.Selection Sort Algorithm: Sort a list with selection sort.Insertion Sort Algorithm: Sort a list with insertion sort.Merge Sort Algorithm: Sort a list with Merge Sort.Time Complexity of Different Sorting Algorithms: Learn the types of time complexity in Big-O Notation in order of horrible to good.Section 7 Dynamic Programming Interview QuestionsCoin Change: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. Edit Distance: Find the edit distance between two strings.Distinct Subsequences: Given a string S and a string T, count the number of distinct subsequences of T in S.Section 8 Bit Manipulation Interview QuestionsBitwise and Shift Operators: Manipulate bits and shift bits to change values.Single Number: Given an array of integers, every element appears twice except for one. Find that single one.Number of 1 Bits: Take an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight.Bitwise AND of a Range: Given two non-negative long integers, a and b and given a
