|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/python-coding-interview-practice-intermediate-level/
课程评论：没有评论
**课程总结：Coursera《编程面试数据结构与算法》** 本课程旨在帮助学习者掌握在编程面试中至关重要的数据结构和算法知识。课程强调了数据结构与算法的协同作用，以及如何高效地操作数据。 **核心学习内容：** * **数据结构原理及应用：** 深入理解常见数据结构的工作原理，探讨它们在不同编程语言中的实现方式（如 C++、Java、Python），并通过编程实践加深理解。 * **数据结构实现与优化：** 学习如何实现关键数据结构，例如动态数组的扩容策略、哈希表的 O(1) 平均时间复杂度实现，以及平衡二叉树的维护方法。 * **实际编程技能：** * 利用 Python 字典实现键值对存储。 * 掌握如何使用元组（tuple）处理多步骤任务，如排序和循环。 * 能够创建读写文件数据的程序。 * **获得技能：** Python 语法和语义，数据结构，元组，Python 编程。 **课程重点问题示例：** * 动态数组的有效扩容策略是什么？ * Priority Queue 在 C++、Java 和 Python 中是如何实现的？ * 如何实现哈希表，使其所有操作的均摊时间复杂度平均为 O(1)？ * 保持二叉树平衡有哪些好的策略？ 本课程将通过一系列编程练习，帮助您不仅理解理论知识，更能熟练运用数据结构和算法解决实际编程问题，为应对技术面试做好充分准备。
HI THERE!A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this online course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.A FEW EXAMPLES OF QUESTIONS THAT WE ARE GOING TO COVER IN THIS COURSE:What is a good strategy of resizing a dynamic array? How priority queues are implemented in C++, Java, and Python? How to implement a hash table so that the amortized running time of all operations is O(1) on average? What are good strategies to keep a binary tree balanced?WHAT YOU WILL LEARNExplain the principles of data structures & how they are usedCreate programs that are able to read and write data from filesStore data as key/value pairs using Python dictionariesAccomplish multi-step tasks like sorting or looping using tuplesSKILLS YOU WILL GAINPython Syntax And SemanticsData StructureTuplePython ProgrammingGOOD LUCK!
