|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/hackerrank-solutions-using-algorithms-data-structure-in-c/
课程评论：没有评论
课程名称：HackerRank 解决方案：使用 C# 的算法和数据结构 课程概述：您是否希望提高您的软件开发技能？您的目标是进入 FAANG 公司并提升您的算法和数据结构水平吗？您是否希望通过学习不同的算法和数据结构来实现职业发展？如果以上问题的答案是肯定的，这门课程就是为您准备的。本课程包含： - 针对多个 HackerRank 问题的在线视频解决方案，使用最合适的算法和数据结构。 - 针对常见面试问题的多种解题方式和方法的讲解。 - 解决顶级 HackerRank 问题的解析，并说明时间和空间复杂度。 - 帮助初学者掌握使用不同算法（如暴力算法、朴素方法、动态规划、贪心算法、慢指针和快指针等）解决问题的技巧。 课程讨论的问题主要来自 HackerRank，但在其他平台上也存在类似的问题。这些问题曾出现在亚马逊、苹果、Facebook、谷歌、Netflix、特斯拉和彭博等顶级科技公司的多个面试中。虽然这些问题可能不完全相同，但它们的基本要点始终相似。我的目的是帮助您理解问题及其解题思路，从而使您能够更轻松地解决类似问题。 由于 HackerRank 不断添加新的挑战性问题，我也会定期更新新的解决方案视频并添加到课程中。建议您关注这些新的挑战问题的解决方案。 希望您能觉得这门课程有用。如有任何问题、顾虑或意见，请随时与我联系，我会尽快回复您。再次感谢您！ 问候，Harshit
Are you looking to improve your Software Development skills?Are you targeting to get into FAANG companies and improvise your Algorithms and Data Structures?Do you want to progress and grow professionally by learning about different algorithms and data structures?If answer to any of the above question is yes, this course is for you.This course containsVideo solution for several HackerRank problems using the most suitable algorithms and data structuresExplanation to top asked interview questions with multiple approaches/solutionsSolved solutions to top HackerRank problems with explanation about Time and Space complexityBeginners trying to gain expertise in solving problems using different algorithms like Brute Force, Naive approach, Dynamic programming, Greedy algorithm, Slow pointer Fast Pointer, etcThe problems discussed in this course are from HackerRank but there are similar problem on other platforms like HackerRank, etc. These problems have been asked in several Interviews from top tech companies like Amazon, Apple, Facebook, Google, Netflix, Tesla, Bloomberg, etc. The problems may not be exactly the same but at least the basic gist behind the problem is always the same. My intention is to help you understand the problem and the approach which will make it easier for you to solve similar problems easily.As HackerRank continuously adds new and challenging problem to its sites, I will be regularly working on new video solutions and add them to this course. I'd recommend to stay tuned for new and challenging problem solutions.I hope you find this course useful. Please reach out to me if you've any questions/concerns/comments and I will get back to you soon.Thank you once again.Regards,Harshit
