|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/hindi-programming-interviews/
课程评论：没有评论
课程名称：कीजिये तैयारी Programming & Coding Interviews की 课程概述：编程面试就像专业运动中的标准赛事——因此需要相应的准备。不要让编程面试中的意外情况影响你的表现！本课程采用印地语进行授课。编程面试在多个重要方面与实际编程工作存在差异，因此应当以不同的方式对待，就像运动中的设定战术一样。就像团队为对手的战术手册做准备，您也应当以预期面试官的提问形式来准备编程面试。本课程由在谷歌和Flipkart进行过数百次技术面试的团队精心设计。 课程内容包括： - 指针：指针和变量的内存布局、指针算术、数组、指向指针的指针、指向结构的指针、函数参数传递、指针重新分配和修改，配以视觉效果帮助理解。 - 字符串：字符串、字符指针、字符数组、字符串的空终止、string.h函数实现及详细解释。 - 链表：可视化、遍历、创建或删除节点、排序合并、反转链表及众多问题和解决方案，双向链表。 - 排序和搜索算法：可视化常见排序和搜索算法的工作原理，以及这些算法的速度和效率。 - 递归：通过大量练习掌握递归！解释8个常见和不常见的递归问题，包括二分搜索、查找子集的所有子集、查找一个词的所有变位词、著名的8皇后问题、执行依赖任务、找到通往迷宫的路径、实现PaintFill、比较两棵二叉树。 - 常见编程问题的逐步解决方案：回文、生命游戏、数独验证器、将文档分块、压缩编码、在一定距离内的点等问题的解决和解释。 - 树和二叉搜索树、堆和二叉堆、图。 本课程为希望在编程面试中取得成功的学习者提供了全面的准备方案。
Programming interviews are like standard plays in professional sport - prepare accordingly. Don't let Programming Interview gotchas get you down! The course instruction is in HindiProgramming interviews differ from real programming jobs in several important aspects, so they merit being treated differently, just like set pieces in sport.Just like teams prepare for their opponent's playbooks in professional sport, it makes sense for you to approach programming interviews anticipating the interviewer's playbookThis course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart What's Covered: Pointers: Memory layout of pointers and variables, pointer arithmetic, arrays, pointers to pointers, pointers to structures, argument passing to functions, pointer reassignment and modification - complete with visuals to help you conceptualize how things work.Strings: Strings, Character pointers, character arrays, null termination of strings, string.h function implementations with detailed explanations.Linked lists: Visualization, traversal, creating or deleting nodes, sorted merge, reversing a linked list and many many problems and solutions, doubly linked lists.Sorting and searching algorithms: Visualize how common sorting and searching algorithms work and the speed and efficiency of those algorithmsRecursion: Master recursion with lots of practice! 8 common and uncommon recursive problems explained. Binary search, finding all subsets of a subset, finding all anagrams of a word, the infamous 8 Queens problem, executing dependent tasks, finding a path through a maze, implementing PaintFill, comparing two binary treesStep-by-step solutions to dozens of common programming problems: Palindromes, Game of Life, Sudoku Validator, Breaking a Document into Chunks, Run Length Encoding, Points within a distance are some of the problems solved and explained.Trees and Binary Search TreesHeaps and Binary HeapsGraphs
