种子简介

种子名称： [ FreeCourseWeb.com ] Udemy - Cracking the Coding Interview
文件类型： 视频
文件数目： 180个文件
文件大小： 2.44 GB
收录时间： 2023-5-1 20:20
已经下载： 3次
资源热度： 74
最近下载： 2024-5-21 17:59

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:8e3421c6fd0b2ebfa38b670cc2c65dbce15618ac&dn=[ FreeCourseWeb.com ] Udemy - Cracking the Coding Interview 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[ FreeCourseWeb.com ] Udemy - Cracking the Coding Interview.torrent

~Get Your Files Here !/01 Introduction/001 About this Course.mp410.55MB

~Get Your Files Here !/02 [Strings] Check whether the given String is a permutation of a palindrome/001 Problem Statement.mp42.47MB

~Get Your Files Here !/02 [Strings] Check whether the given String is a permutation of a palindrome/002 Figuring out the approach.mp411.81MB

~Get Your Files Here !/02 [Strings] Check whether the given String is a permutation of a palindrome/003 Analysing the Time and Space Complexity.mp43.11MB

~Get Your Files Here !/02 [Strings] Check whether the given String is a permutation of a palindrome/004 Coding the Optimal Solution.mp434.24MB

~Get Your Files Here !/03 [Linked Lists] Return Kth to last element in LinkedList/001 Problem Statement.mp41.43MB

~Get Your Files Here !/03 [Linked Lists] Return Kth to last element in LinkedList/002 Brute-Force Solution.mp43.46MB

~Get Your Files Here !/03 [Linked Lists] Return Kth to last element in LinkedList/003 Optimizing further.mp42.75MB

~Get Your Files Here !/03 [Linked Lists] Return Kth to last element in LinkedList/004 Coding the Optimal Solution.mp431.64MB

~Get Your Files Here !/04 [Stacks and Queues] Stack with min Operation/001 Problem Statement.mp42.74MB

~Get Your Files Here !/04 [Stacks and Queues] Stack with min Operation/002 Figuring out the approach.mp411.14MB

~Get Your Files Here !/04 [Stacks and Queues] Stack with min Operation/003 Coding the optimal solution.mp441.71MB

~Get Your Files Here !/05 [Linked Lists] Reverse a Single LinkedList/001 Problem Statement.mp41.68MB

~Get Your Files Here !/05 [Linked Lists] Reverse a Single LinkedList/003 Figuring out the approach.mp417.54MB

~Get Your Files Here !/05 [Linked Lists] Reverse a Single LinkedList/004 Coding the optimal solution.mp426.45MB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/001 The Problem Statement.mp42.66MB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/002 Exercise-1.mp4464.28KB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/003 Figuring out the Test Cases.mp41.58MB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/004 Exercise-2.mp4967.28KB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/005 Brute-Force Solution.mp41.24MB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/006 Optimizing further.mp44.88MB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/007 Exercise-3.mp4559.04KB

~Get Your Files Here !/06 [Searching] Search a Sorted Array for first occurrence of k/008 Coding the optimal solution.mp432.55MB

~Get Your Files Here !/07 [Dynamic Programming] Count ways to climb/001 Problem Statement.mp41.89MB

~Get Your Files Here !/07 [Dynamic Programming] Count ways to climb/002 Understanding the problem statement.mp45.66MB

~Get Your Files Here !/07 [Dynamic Programming] Count ways to climb/003 Recursive approach.mp423.33MB

~Get Your Files Here !/07 [Dynamic Programming] Count ways to climb/004 Optimising using Memoization.mp438.21MB

~Get Your Files Here !/08 [Math] Trailing Zeros in n factorial/001 Problem Statement.mp42.27MB

~Get Your Files Here !/08 [Math] Trailing Zeros in n factorial/002 Figuring out the approach.mp46.57MB

~Get Your Files Here !/08 [Math] Trailing Zeros in n factorial/003 Coding the solution.mp412.39MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/001 The Problem Statement.mp42.91MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/003 Bruteforce Solution.mp44.41MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/004 Optimizing further.mp420.36MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/005 Writing TestCases.mp45.11MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/006 Validating the approach with Test Cases.mp412.24MB

~Get Your Files Here !/09 [Searching] Search a Sorted Array for Entry equal to its Index/007 Coding the Optimal Solution.mp424.42MB

~Get Your Files Here !/10 [Strings] URLify a String/001 Problem Statement.mp43.06MB

~Get Your Files Here !/10 [Strings] URLify a String/002 Figuring out the approach.mp48.85MB

~Get Your Files Here !/10 [Strings] URLify a String/003 Coding the solution.mp449.46MB

~Get Your Files Here !/11 [Binary Search Trees] Construct a minimal height tree from a sorted array/001 Problem Statement.mp42.15MB

~Get Your Files Here !/11 [Binary Search Trees] Construct a minimal height tree from a sorted array/002 Figuring out the approach.mp43.88MB

~Get Your Files Here !/11 [Binary Search Trees] Construct a minimal height tree from a sorted array/003 Coding the solution.mp446.38MB

~Get Your Files Here !/12 [Stacks and Queues] Implement a Queue using Stacks/001 Problem Statement.mp41.01MB

~Get Your Files Here !/12 [Stacks and Queues] Implement a Queue using Stacks/002 Understanding the Problem Statement.mp46.18MB

~Get Your Files Here !/12 [Stacks and Queues] Implement a Queue using Stacks/004 Figuring out the Solution.mp423.66MB

~Get Your Files Here !/12 [Stacks and Queues] Implement a Queue using Stacks/005 Coding the Optimal Solution.mp450.11MB

~Get Your Files Here !/13 [Primitive Types] Check if a Decimal Integer is a Palindrome/001 Problem Statement.mp43.08MB

~Get Your Files Here !/13 [Primitive Types] Check if a Decimal Integer is a Palindrome/003 Figuring out the Solution.mp410.47MB

~Get Your Files Here !/13 [Primitive Types] Check if a Decimal Integer is a Palindrome/004 Coding the Optimal Solution.mp440.43MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/001 Problem Statement.mp42.86MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/003 Brute-Force Solution.mp46.95MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/004 Optimizing further - 1.mp43.5MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/005 Optimizing further - 2.mp418.37MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/006 Writing TestCases.mp43.63MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/007 Validating the approach with Testcases.mp421.94MB

~Get Your Files Here !/14 [Sorting] Compute the Intersection of two sorted arrays/008 Coding the Optimal Solution.mp438.42MB

~Get Your Files Here !/15 [Arrays] The Dutch National Flag Problem/001 Problem Statement.mp44.28MB

~Get Your Files Here !/15 [Arrays] The Dutch National Flag Problem/002 Brute-Force Solution.mp43.25MB

~Get Your Files Here !/15 [Arrays] The Dutch National Flag Problem/003 Optimizing further.mp421.82MB

~Get Your Files Here !/15 [Arrays] The Dutch National Flag Problem/004 Writing TestCases.mp41.56MB

~Get Your Files Here !/15 [Arrays] The Dutch National Flag Problem/006 Coding the optimal solution.mp458.5MB

~Get Your Files Here !/16 [Greedy] The Interval Covering Problem/001 Problem Statement.mp42.76MB

~Get Your Files Here !/16 [Greedy] The Interval Covering Problem/002 Understanding the Problem Statement.mp47.95MB

~Get Your Files Here !/16 [Greedy] The Interval Covering Problem/004 Figuring out the approach.mp419.24MB

~Get Your Files Here !/16 [Greedy] The Interval Covering Problem/006 Coding the optimal solution.mp442.64MB

~Get Your Files Here !/17 [Bit Manipulation] Generate the Power Set/001 Problem Statement.mp41.84MB

~Get Your Files Here !/17 [Bit Manipulation] Generate the Power Set/002 Figuring out the approach.mp428.59MB

~Get Your Files Here !/17 [Bit Manipulation] Generate the Power Set/003 Coding the optimal solution.mp444.27MB

~Get Your Files Here !/18 [Recursion] Generate all subsets using Recursion/001 Problem Statement.mp41.46MB

~Get Your Files Here !/18 [Recursion] Generate all subsets using Recursion/002 Figuring out the approach.mp46.09MB

~Get Your Files Here !/18 [Recursion] Generate all subsets using Recursion/003 Coding the Solution.mp440.12MB

~Get Your Files Here !/19 [Recursion] Generate all subsets of size k/001 Problem Statement.mp42.06MB

~Get Your Files Here !/19 [Recursion] Generate all subsets of size k/002 Figuring out the approach_Part-1.mp447.92MB

~Get Your Files Here !/19 [Recursion] Generate all subsets of size k/003 Figuring out the approach_Part-2.mp45.02MB

~Get Your Files Here !/19 [Recursion] Generate all subsets of size k/004 Coding the Solution.mp423.06MB

~Get Your Files Here !/20 [Strings] Run Length Encoding/001 Problem Statement.mp42.82MB

~Get Your Files Here !/20 [Strings] Run Length Encoding/002 Figuring out the approach.mp46.96MB

~Get Your Files Here !/20 [Strings] Run Length Encoding/003 Coding the optimal solution.mp424.94MB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/001 Problem Statement.mp42.55MB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/002 Brute-Force Solution.mp44.97MB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/003 Figuring out the approach.mp415.12MB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/004 Writing TestCases.mp42.13MB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/005 Exercise-1.mp4770.52KB

~Get Your Files Here !/21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr/006 Coding the optimal solution.mp428.73MB

~Get Your Files Here !/22 [Recursion] Towers Of Hanoi/001 Problem Statement.mp47.67MB

~Get Your Files Here !/22 [Recursion] Towers Of Hanoi/002 Figuring out the approach.mp414.26MB

~Get Your Files Here !/22 [Recursion] Towers Of Hanoi/003 Coding the solution.mp426.36MB

~Get Your Files Here !/22 [Recursion] Towers Of Hanoi/004 Analysing the Time Complexity.mp49.54MB

~Get Your Files Here !/23 [Dynamic Programming] Longest Increasing Subsequence/001 Problem Statement.mp44.88MB

~Get Your Files Here !/23 [Dynamic Programming] Longest Increasing Subsequence/002 Figuring out the approach.mp421.8MB

~Get Your Files Here !/23 [Dynamic Programming] Longest Increasing Subsequence/003 Coding the optimal solution.mp430.29MB

~Get Your Files Here !/24 [Bit Manipulation] Flip Bits count to convert A to B/001 Problem Statement.mp43.97MB

~Get Your Files Here !/24 [Bit Manipulation] Flip Bits count to convert A to B/002 Figuring out the approach.mp44.56MB

~Get Your Files Here !/24 [Bit Manipulation] Flip Bits count to convert A to B/003 Coding the solution.mp411.94MB

~Get Your Files Here !/25 [Strings] Check whether Strings A is a permutation of B/001 Problem Statement.mp42.01MB

~Get Your Files Here !/25 [Strings] Check whether Strings A is a permutation of B/002 Figuring out the approach.mp42.4MB

~Get Your Files Here !/26 [Graphs] Route Between two Nodes in a Directed Graph/001 Problem Statement.mp44.65MB

~Get Your Files Here !/26 [Graphs] Route Between two Nodes in a Directed Graph/002 Figuring out the approach_Part-1.mp4892.08KB

~Get Your Files Here !/26 [Graphs] Route Between two Nodes in a Directed Graph/003 Figuring out the approach_Part-2.mp419.86MB

~Get Your Files Here !/26 [Graphs] Route Between two Nodes in a Directed Graph/004 Coding the Optimal Solution.mp474.74MB

~Get Your Files Here !/27 [Strings] Check whether the String is a Rotation of another String/001 Problem Statement.mp45.42MB

~Get Your Files Here !/27 [Strings] Check whether the String is a Rotation of another String/002 Figuring out the approach.mp48.23MB

~Get Your Files Here !/28 [Recursion] Print all combinations of balanced parentheses/001 Problem Statement.mp42.41MB

~Get Your Files Here !/28 [Recursion] Print all combinations of balanced parentheses/002 Figuring out the approach.mp430.51MB

~Get Your Files Here !/28 [Recursion] Print all combinations of balanced parentheses/003 Coding the Solution.mp432.01MB

~Get Your Files Here !/28 [Recursion] Print all combinations of balanced parentheses/004 Analysing Time Complexity and Space Complexity.mp43.1MB

~Get Your Files Here !/29 [LinkedLists] Delete a node given only access to that node/001 Problem Statement.mp41.76MB

~Get Your Files Here !/29 [LinkedLists] Delete a node given only access to that node/002 Figuring out the approach.mp43.42MB

~Get Your Files Here !/30 [Recursion] Compute all permutations of a string of unique characters/001 Problem Statement.mp41.55MB

~Get Your Files Here !/30 [Recursion] Compute all permutations of a string of unique characters/002 Figuring out the approach.mp49.81MB

~Get Your Files Here !/30 [Recursion] Compute all permutations of a string of unique characters/003 Coding the Solution.mp439.39MB

~Get Your Files Here !/30 [Recursion] Compute all permutations of a string of unique characters/004 Calculating the Runtime.mp42.99MB

~Get Your Files Here !/31 [Recursion] Compute Permutations of a String with duplicate characters/001 Problem Statement.mp42.19MB

~Get Your Files Here !/31 [Recursion] Compute Permutations of a String with duplicate characters/002 Figuring out the approach.mp410.13MB

~Get Your Files Here !/31 [Recursion] Compute Permutations of a String with duplicate characters/003 Coding the solution.mp448.65MB

~Get Your Files Here !/32 [Searching] Search in a Sorted Rotated array/001 Problem Statement.mp42.63MB

~Get Your Files Here !/32 [Searching] Search in a Sorted Rotated array/002 Figuring out the approach.mp49.02MB

~Get Your Files Here !/32 [Searching] Search in a Sorted Rotated array/003 Exercise.mp4834.18KB

~Get Your Files Here !/33 [Strings] Is One Edit Away/001 Problem Statement.mp44.24MB

~Get Your Files Here !/33 [Strings] Is One Edit Away/002 Figuring out the approach.mp49.67MB

~Get Your Files Here !/33 [Strings] Is One Edit Away/003 Coding the Solution.mp466.94MB

~Get Your Files Here !/34 [LinkedLists] Detection of loop and the node at the beginning of the loop/001 Problem Statement.mp42.23MB

~Get Your Files Here !/34 [LinkedLists] Detection of loop and the node at the beginning of the loop/002 Loop Detection.mp44.79MB

~Get Your Files Here !/34 [LinkedLists] Detection of loop and the node at the beginning of the loop/003 Finding the first node of the Loop.mp422.55MB

~Get Your Files Here !/34 [LinkedLists] Detection of loop and the node at the beginning of the loop/004 Coding the Solution.mp416.83MB

~Get Your Files Here !/35 [Binary Search Trees] Validate a Binary Search Tree/001 Problem Statement.mp41.72MB

~Get Your Files Here !/35 [Binary Search Trees] Validate a Binary Search Tree/002 Figuring out the approach_Part-1.mp46.06MB

~Get Your Files Here !/35 [Binary Search Trees] Validate a Binary Search Tree/003 Figuring out the approach_Part-2.mp418.69MB

~Get Your Files Here !/35 [Binary Search Trees] Validate a Binary Search Tree/004 Coding the solution.mp415.01MB

~Get Your Files Here !/36 [Sorting] Merge two sorted arrays/001 Problem Statement.mp42.46MB

~Get Your Files Here !/36 [Sorting] Merge two sorted arrays/002 Figuring out the approach.mp48.32MB

~Get Your Files Here !/37 [LinkedLists] Remove duplicates/001 Problem Statement.mp42.53MB

~Get Your Files Here !/37 [LinkedLists] Remove duplicates/002 Figuring out the approach.mp47.92MB

~Get Your Files Here !/37 [LinkedLists] Remove duplicates/003 Coding the solution.mp434.41MB

~Get Your Files Here !/38 [Stacks and Queues] Sorting a Stack/001 Problem Statement.mp42.03MB

~Get Your Files Here !/38 [Stacks and Queues] Sorting a Stack/002 Figuring out the approach.mp418.33MB

~Get Your Files Here !/39 [LinkedLists] Determine the intersection point of two Linked Lists/001 Problem Statement.mp41.75MB

~Get Your Files Here !/39 [LinkedLists] Determine the intersection point of two Linked Lists/002 Figuring out the approach.mp48.66MB

~Get Your Files Here !/40 [Binary Trees] Create LinkedList at each depth/001 Problem Statement.mp42.01MB

~Get Your Files Here !/40 [Binary Trees] Create LinkedList at each depth/002 Figuring out the approach.mp47.48MB

~Get Your Files Here !/41 [LinkedLists] Add two numbers represented by Linked Lists/001 Problem Statement.mp43.35MB

~Get Your Files Here !/41 [LinkedLists] Add two numbers represented by Linked Lists/002 Figuring out the approach.mp47.44MB

~Get Your Files Here !/41 [LinkedLists] Add two numbers represented by Linked Lists/003 Coding the solution.mp4103.95MB

~Get Your Files Here !/42 [Binary Trees] Check whether the given Binary Tree is balanced/001 Problem Statement.mp43.75MB

~Get Your Files Here !/42 [Binary Trees] Check whether the given Binary Tree is balanced/002 Figuring out the approach.mp416.3MB

~Get Your Files Here !/42 [Binary Trees] Check whether the given Binary Tree is balanced/003 Coding the solution.mp443.69MB

~Get Your Files Here !/43 [Arrays] Contiguous sequence with the largest sum/001 Problem Statement.mp41.47MB

~Get Your Files Here !/43 [Arrays] Contiguous sequence with the largest sum/002 Figuring out the approach.mp48.58MB

~Get Your Files Here !/44 [Stacks] Evaluation of Postfix Expression/001 Problem Statement.mp42.3MB

~Get Your Files Here !/44 [Stacks] Evaluation of Postfix Expression/002 Figuring out the approach.mp45.89MB

~Get Your Files Here !/45 [Dynamic Programming] Longest Palindromic Subsequence/001 Problem Statement.mp41.94MB

~Get Your Files Here !/45 [Dynamic Programming] Longest Palindromic Subsequence/002 Recursive approach.mp427.59MB

~Get Your Files Here !/45 [Dynamic Programming] Longest Palindromic Subsequence/003 Optimizing using Memoization.mp421.95MB

~Get Your Files Here !/46 [Searching] Find Pairs with Sum/001 Problem Statement.mp41.93MB

~Get Your Files Here !/46 [Searching] Find Pairs with Sum/002 Figuring out the approach.mp44.11MB

~Get Your Files Here !/46 [Searching] Find Pairs with Sum/003 Coding the Solution.mp422.72MB

~Get Your Files Here !/47 [Binary Trees] Lowest Common Ancestor/001 Problem Statement.mp42.1MB

~Get Your Files Here !/47 [Binary Trees] Lowest Common Ancestor/002 Figuring out the approach.mp413.38MB

~Get Your Files Here !/47 [Binary Trees] Lowest Common Ancestor/003 Coding the Solution.mp429.24MB

~Get Your Files Here !/48 [Greedy] Interval scheduling maximization problem/001 Problem Statement.mp48.76MB

~Get Your Files Here !/48 [Greedy] Interval scheduling maximization problem/002 Figuring out the approach.mp411.68MB

~Get Your Files Here !/48 [Greedy] Interval scheduling maximization problem/003 Coding the Solution.mp445.03MB

~Get Your Files Here !/49 [Strings] Are characters unique/001 Problem Statement.mp41.92MB

~Get Your Files Here !/49 [Strings] Are characters unique/002 Figuring out the approach.mp41.34MB

~Get Your Files Here !/50 [Arrays] Zeroing the Matrix/001 Problem Statement.mp42.55MB

~Get Your Files Here !/50 [Arrays] Zeroing the Matrix/002 Figuring out the approach.mp46.2MB

~Get Your Files Here !/50 [Arrays] Zeroing the Matrix/003 Optimizing further.mp43.6MB

~Get Your Files Here !/50 [Arrays] Zeroing the Matrix/004 Coding the Solution.mp453.77MB

~Get Your Files Here !/51 [Binary Trees] Is Symmetric/001 Problem Statement.mp41.71MB

~Get Your Files Here !/51 [Binary Trees] Is Symmetric/002 Figuring out the approach.mp46.05MB

~Get Your Files Here !/52 [Heaps] Implement a Stack API using a Heap/001 Problem Statement.mp41.32MB

~Get Your Files Here !/52 [Heaps] Implement a Stack API using a Heap/002 Figuring out the approach.mp46.47MB

~Get Your Files Here !/53 [Arrays] Delete duplicates from a sorted array without using additional space/001 Problem Statement.mp42.4MB

~Get Your Files Here !/53 [Arrays] Delete duplicates from a sorted array without using additional space/002 Figuring out the approach.mp46.37MB

~Get Your Files Here !/53 [Arrays] Delete duplicates from a sorted array without using additional space/003 Coding the Solution.mp429.48MB

~Get Your Files Here !/54 [Recursion] Compute all mnemonics for a phone number/001 Problem Statement.mp45.06MB

~Get Your Files Here !/54 [Recursion] Compute all mnemonics for a phone number/002 Figuring out the approach.mp414.27MB

~Get Your Files Here !/54 [Recursion] Compute all mnemonics for a phone number/003 Coding the Solution.mp430.15MB

~Get Your Files Here !/55 [Linked Lists] Merge two sorted linked lists/001 Problem Statement.mp41.71MB

~Get Your Files Here !/55 [Linked Lists] Merge two sorted linked lists/002 Figuring out the approach.mp411.6MB