|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/ultimate-coding-interview-prep-algorithms-data-structures/
课程评论：没有评论
课程名称：终极编码面试准备：算法与数据结构 概述：本课程是针对Java初学者准备的最佳面试指南，涵盖Facebook、Google、Amazon 和 Spotify等公司的常见面试问题。准备Java面试并不容易，除了需要理解概念外，还需能够清晰表达你的思维过程，以及在规划和执行解决方案时的思路。在“终极编码面试准备”课程中，您将学习如何最佳回答面试问题，探讨最常见的问题，并分析各种算法的时间复杂度。通过实践编程示例，您将快速学习解决问题的方法。课程也将帮助您复习Java知识，解答FANG公司常见的初学者面试问题。 课程大纲： - 第0部分：面试问题介绍 * 课程概览 * FizzBuzz问题：打印1到100的数字，3的倍数打印“Fizz”，5的倍数打印“Buzz”。 - 第1部分：字符串/数组面试问题 * 单词反转 * 数组旋转 * 同构字符串 * 查找第k大的元素 - 第2部分：矩阵面试问题 * 设置矩阵零 * 螺旋矩阵 * 计算岛屿数量 - 第3部分：链表面试问题 * 使用数组实现栈 * 相加两个数字（链表表示） * 反转链表 - 第4部分：树结构面试问题 * 中序遍历 * 前序遍历 * 后序遍历 * 二叉树最大路径和 - 第5部分：图形面试问题 * 克隆无向图 - 第6部分：排序和时间复杂度 * 时间复杂度类别 * 冒泡排序算法 * 选择排序算法 * 插入排序算法 * 快速排序算法 * 归并排序算法 * 不同排序算法的时间复杂度分析 - 第7部分：动态规划面试问题 * 硬币变化 * 编辑距离 * 不同子序列数 * 最大子数组和 - 第8部分：位运算面试问题 * 按位与和移位操作 * 找到唯一数 * 计算两个整数之和（不使用+和-操作） * 计算1的数量 * 反转比特 * 范围内的按位与 该课程不仅提供了面试准备的全面知识，还通过动手实践帮助学员巩固和运用所学内容。
The Best Java Interview GuideLearn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.Preparing for the Java 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.In Ultimate Coding Interview Prep, you'll learn the best way to answer an interview question, look at the most commonly asked questions, and analyze time complexity of various algorithms.You'll learn through hands-on coding examples and learn to solve problems quickly.Refresh your Java knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.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 Questions01 Reverse Words in a String: Given an input string, reverse the string word by word.02 Rotate Array: Rotate an array of n elements to the left by k steps.03 Isomorphic Strings: Given two strings a and b, determine if they are isomorphic. 04 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 Questions01 Set Matrix Zeroes: Given a 2D matrix, if an element is 0, set its entire row and column to 0. Do it in place.02 Spiral Matrix: Given a 2D matrix, return all elements of the matrix in spiral order.03 Number of Islands: Given a 2D grid map of 1s (land) and 0s (water), count the number of islands.Section 3: Linked List Interview Questions01 Implement a Stack Using an Array in Java: Implement a stack using an array.02 Add Two Numbers: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. 03 Reverse a Linked List: Reverse a singly linked list.Section 4: Tree Interview Questions01 Inorder Traversal: Perform inorder traversal on a binary tree.02 Preorder Traversal: Perform inorder traversal on a binary tree.03 Postorder Traversal: Perform inorder traversal on a binary tree.04 Binary Tree Maximum Path Sum: Given a binary tree, find the maximum path sum. Section 5: Graph Interview Questions01 Clone an Undirected Graph: Each node in the graph contains a label and a list of its neighbors.Section 6: Sorting and Time Complexity01 Types of Time Complexity: Learn the types of time complexity in Big-O Notation in order of horrible to good.02 Bubble Sort Algorithm: Sort a list with bubble sort.03 Selection Sort Algorithm: Sort a list with selection sort.04 Insertion Sort Algorithm: Sort a list with insertion sort.05 Quick Sort Algorithm: Sort a list with Quick Sort.06 Merge Sort Algorithm: Sort a list with Merge Sort.07 Time Complexity of Different Sorting AlgorithmsSection 7 Dynamic Programming Interview Questions01 Coin 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. 02 Edit Distance: Find the edit distance between two strings.03 Distinct Subsequences: Given a string S and a string T, count the number of distinct subsequences of T in S.04 Maximum Sum Subarray: Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sumSection 8 Bit Manipulation Interview Questions01 Bitwise and Shift Operators: Manipulate bits and shift bits to change values.02 Single Number: Given an array of integers, every element appears twice except for one. Find that single one.03 Sum of Two Integers: Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.04 Number of 1 Bits: Take an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight.)05 Reverse Bits: Reverse the bits of a given 32 bit unsigned integer.06 Bitwise AND of a Range: Given two non-negative long integers, a and b and given a
