Cracking Coding Interview:Data Structure & Algorithm [6/2021, ENG]
movies, software, shows...
Files
| 01 Length of Last Word | |||
| 001 20-length of last word.txt | 660 B | ||
| 001 Length of Last Word.mp4 | 61.55 MB | ||
| 001 Length of Last Word.srt | 11.72 KB | ||
| 02 Reverse String | |||
| 001 Reverse String.mp4 | 84.43 MB | ||
| 001 Reverse String.srt | 15.21 KB | ||
| 002 11-reverse string.txt | 655 B | ||
| 03 Longest Common Prefix | |||
| 001 Longest Common Prefix.mp4 | 123.44 MB | ||
| 001 Longest Common Prefix.srt | 17.79 KB | ||
| 003 44-longest common prefix.txt | 1002 B | ||
| 04 String class | |||
| 001 String class.mp4 | 292.18 MB | ||
| 001 String class.srt | 40.23 KB | ||
| 004 1-string.txt | 1.07 KB | ||
| 05 Vectors | |||
| 001 Vectors.mp4 | 247.32 MB | ||
| 001 Vectors.srt | 36.27 KB | ||
| 005 48-vectors.txt | 1.12 KB | ||
| 06 Fizz Buzz | |||
| 001 Fizz Buzz.mp4 | 69.65 MB | ||
| 001 Fizz Buzz.srt | 12.63 KB | ||
| 006 41-fizz Buzz.txt | 525 B | ||
| 07 Evaluate Reverse Polish Notation | |||
| 001 Evaluate Reverse Polish Notation.mp4 | 188.94 MB | ||
| 001 Evaluate Reverse Polish Notation.srt | 31.42 KB | ||
| 007 8-evaluate reverse polish notation.txt | 1.14 KB | ||
| 08 Excel Sheet Column Number | |||
| 001 Excel Sheet Column Number.mp4 | 74.49 MB | ||
| 001 Excel Sheet Column Number.srt | 13.35 KB | ||
| 008 19-excel sheet column number.txt | 353 B | ||
| 09 Palindrome String | |||
| 001 Palindrome String.mp4 | 102.38 MB | ||
| 001 Palindrome String.srt | 16.33 KB | ||
| 009 9-palindrome string.txt | 490 B | ||
| 10 Valid Palindrome | |||
| 001 Valid Palindrome.mp4 | 119.38 MB | ||
| 001 Valid Palindrome.srt | 21.9 KB | ||
| 010 10-valid palindrome 2.txt | 995 B | ||
| 100 Mock Interview -_ Very Important | |||
| 001 Mock Interview.html | 1.92 KB | ||
| 101 Bonus | |||
| 001 Coupons for my other courses.html | 1.66 KB | ||
| 11 Remove All Adjacent Duplicates | |||
| 001 Remove All Adjacent Duplicates.mp4 | 272.15 MB | ||
| 001 Remove All Adjacent Duplicates.srt | 37.28 KB | ||
| 011 12-remove all adjacent duplicates.txt | 1.05 KB | ||
| 12 Remove All Adjacent Duplicates - 2 | |||
| 001 Remove all adjacent duplicates - 2.mp4 | 301.56 MB | ||
| 001 Remove all adjacent duplicates - 2.srt | 46.24 KB | ||
| 012 13-remove k adjacent duplicates.txt | 2.16 KB | ||
| 13 Recursion Basics | |||
| 001 Introduction to recursion.mp4 | 183.33 MB | ||
| 001 Introduction to recursion.srt | 34.07 KB | ||
| 002 Recursion and PMI.mp4 | 88.07 MB | ||
| 002 Recursion and PMI.srt | 23.46 KB | ||
| 003 Fibonacci Number.mp4 | 89.57 MB | ||
| 003 Fibonacci Number.srt | 15.6 KB | ||
| 004 Power.mp4 | 43.2 MB | ||
| 004 Power.srt | 8.64 KB | ||
| 005 Print Numbers.mp4 | 128.43 MB | ||
| 005 Print Numbers.srt | 22.26 KB | ||
| 006 Numbers of Digits.mp4 | 80.44 MB | ||
| 006 Numbers of Digits.srt | 16.54 KB | ||
| 007 Sum of Digits.mp4 | 75.48 MB | ||
| 007 Sum of Digits.srt | 13.67 KB | ||
| 008 Multiplication.mp4 | 73.79 MB | ||
| 008 Multiplication.srt | 14.12 KB | ||
| 009 Count Zeroes.mp4 | 66.32 MB | ||
| 009 Count Zeroes.srt | 13.5 KB | ||
| 010 Geometric Sum.mp4 | 64.35 MB | ||
| 010 Geometric Sum.srt | 12.59 KB | ||
| 013 factorial.txt | 347 B | ||
| 014 factorial.txt | 350 B | ||
| 015 Fibonaci.txt | 366 B | ||
| 016 power.txt | 288 B | ||
| 017 print numbers.txt | 517 B | ||
| 018 count.txt | 276 B | ||
| 019 sum of digits.txt | 323 B | ||
| 020 multiplication.txt | 323 B | ||
| 021 count zeroes.txt | 378 B | ||
| 022 Geometric Sum.txt | 278 B | ||
| 14 Recursion Intermediate | |||
| 001 Check if Array is sorted.mp4 | 179.16 MB | ||
| 001 Check if Array is sorted.srt | 40.51 KB | ||
| 002 Sum of Array.mp4 | 121.26 MB | ||
| 002 Sum of Array.srt | 27.28 KB | ||
| 003 Check if element is present.mp4 | 198.87 MB | ||
| 003 Check if element is present.srt | 42.67 KB | ||
| 004 First Index of element.mp4 | 51.24 MB | ||
| 004 First Index of element.srt | 13.47 KB | ||
| 005 Last Index of element.mp4 | 190.71 MB | ||
| 005 Last Index of element.srt | 39.83 KB | ||
| 006 Print All position of element.mp4 | 26.62 MB | ||
| 006 Print All position of element.srt | 7.39 KB | ||
| 007 Count Occurrence of element- First Approach.mp4 | 26.99 MB | ||
| 007 Count Occurrence of element- First Approach.srt | 6.22 KB | ||
| 008 Count Occurrence of element- Second Approach.mp4 | 41.94 MB | ||
| 008 Count Occurrence of element- Second Approach.srt | 6.62 KB | ||
| 009 Store All Position of element.mp4 | 114.66 MB | ||
| 009 Store All Position of element.srt | 20.62 KB | ||
| 010 Check Palindrome.mp4 | 69.97 MB | ||
| 010 Check Palindrome.srt | 17.66 KB | ||
| 023 1-Check if Array is sorted.txt | 871 B | ||
| 024 2-Sum of Array.txt | 500 B | ||
| 025 3-Check if element is present.txt | 969 B | ||
| 026 4-First Index of element.txt | 299 B | ||
| 027 5-Last Index of element.txt | 784 B | ||
| 028 6-Print All position of element.txt | 281 B | ||
| 029 7-Count Occurence of element- First Approach.txt | 495 B | ||
| 030 8-Count Occurence of element- Second Approach.txt | 505 B | ||
| 031 9-Store All Position of element.txt | 1007 B | ||
| 032 10-Check Palindrome.txt | 316 B | ||
| 15 Recursion Advanced | |||
| 001 Print and Reverse Print Recursively.mp4 | 39.63 MB | ||
| 001 Print and Reverse Print Recursively.srt | 10.33 KB | ||
| 002 Length Recursively.mp4 | 26.07 MB | ||
| 002 Length Recursively.srt | 6.5 KB | ||
| 003 Replace Character Recursively.mp4 | 41.69 MB | ||
| 003 Replace Character Recursively.srt | 9.32 KB | ||
| 004 Remove Character Recursively.mp4 | 59.84 MB | ||
| 004 Remove Character Recursively.srt | 13.11 KB | ||
| 005 Remove Consecutive Duplicates.mp4 | 56.76 MB | ||
| 005 Remove Consecutive Duplicates.srt | 12.98 KB | ||
| 006 Print All Subsequences of String.mp4 | 126.33 MB | ||
| 006 Print All Subsequences of String.srt | 26.96 KB | ||
| 007 Store All Subsequences of String.mp4 | 20.58 MB | ||
| 007 Store All Subsequences of String.srt | 3.62 KB | ||
| 008 Convert String to Integer.mp4 | 70.7 MB | ||
| 008 Convert String to Integer.srt | 16.8 KB | ||
| 009 Print All Permutation of String.mp4 | 63.54 MB | ||
| 009 Print All Permutation of String.srt | 14.12 KB | ||
| 010 Staircase Problem.mp4 | 58.69 MB | ||
| 010 Staircase Problem.srt | 16.86 KB | ||
| 011 Tower of Hanoi.mp4 | 47.32 MB | ||
| 011 Tower of Hanoi.srt | 13.54 KB | ||
| 012 Print Steps in Tower of Hanoi.mp4 | 77.26 MB | ||
| 012 Print Steps in Tower of Hanoi.srt | 13.11 KB | ||
| 033 1-print and reverse print.txt | 404 B | ||
| 034 2-Length Recursively.txt | 269 B | ||
| 035 3-Replace Character Recursively.txt | 514 B | ||
| 036 4-Remove Character.txt | 614 B | ||
| 037 5-Remove Consecutive Duplicates.txt | 729 B | ||
| 038 6-Print All Subsequences of String.txt | 833 B | ||
| 039 7-Store All Subsequences of String.txt | 535 B | ||
| 040 8-Convert String to Integer.txt | 539 B | ||
| 041 9-Print All Permutation of String.txt | 371 B | ||
| 042 10-Staircase Problem.txt | 337 B | ||
| 043 11-Tower of Hanoi.txt | 212 B | ||
| 044 12-Print Steps in Tower of Hanoi.txt | 445 B | ||
| 16 Algorithm _ Selection Sort | |||
| 001 Selection Sort Algorithm ( Explain + Code ).mp4 | 222.61 MB | ||
| 001 Selection Sort Algorithm ( Explain + Code ).srt | 35.04 KB | ||
| 17 Algorithms _ Bubble Sort | |||
| 001 Bubble Sort Algorithm ( Explain + Code ).mp4 | 134.9 MB | ||
| 001 Bubble Sort Algorithm ( Explain + Code ).srt | 24.26 KB | ||
| 002 Optimized Bubble Sort Algorithm (Explain + Code ).mp4 | 55.31 MB | ||
| 002 Optimized Bubble Sort Algorithm (Explain + Code ).srt | 8.83 KB | ||
| 003 Inbuilt Sort _ Standard Template Library (STL).mp4 | 52.87 MB | ||
| 003 Inbuilt Sort _ Standard Template Library (STL).srt | 6.93 KB | ||
| 18 Algorithm _ Merge Sort | |||
| 001 Merge Sort Introduction.mp4 | 63.54 MB | ||
| 001 Merge Sort Introduction.srt | 20.86 KB | ||
| 002 Merge Sort Solution.mp4 | 123.6 MB | ||
| 002 Merge Sort Solution.srt | 22.34 KB | ||
| 049 1-Merge Sort Introduction.txt | 232 B | ||
| 050 2-Merge Sort Solution.txt | 1.98 KB | ||
| 19 Algorithm _ Quick Sort | |||
| 001 Quick Sort Introduction.mp4 | 85.98 MB | ||
| 001 Quick Sort Introduction.srt | 21.05 KB | ||
| 002 Quick Sort Solution.mp4 | 81.69 MB | ||
| 002 Quick Sort Solution.srt | 15.22 KB | ||
| 003 Quick Sort Testing.mp4 | 11.97 MB | ||
| 003 Quick Sort Testing.srt | 2.39 KB | ||
| 051 1-Quick Sort Introduction.txt | 283 B | ||
| 052 2-Quick Sort Solution.txt | 484 B | ||
| 053 3-Quick Sort Checking.txt | 594 B | ||
| 20 Algorithm _ Moore Voting _ Majority Element | |||
| 001 Majority Element.mp4 | 177.62 MB | ||
| 001 Majority Element.srt | 40.15 KB | ||
| 054 43-majority element.txt | 782 B | ||
| 21 Algorithms _ Binary Search | |||
| 001 Linear Search Algorithm ( Explain + Code ).mp4 | 101.9 MB | ||
| 001 Linear Search Algorithm ( Explain + Code ).srt | 17.1 KB | ||
| 002 Problem with Linear Search.mp4 | 9.21 MB | ||
| 002 Problem with Linear Search.srt | 3 KB | ||
| 003 Binary Search Algorithm (Explain).mp4 | 63.68 MB | ||
| 003 Binary Search Algorithm (Explain).srt | 18.92 KB | ||
| 004 Binary Search Algorithm (Code).mp4 | 107.25 MB | ||
| 004 Binary Search Algorithm (Code).srt | 16.81 KB | ||
| 22 Advanced Binary Search _ Find First & Last Occurence | |||
| 001 Find First & Last Occurence.mp4 | 238.82 MB | ||
| 001 Find First & Last Occurence.srt | 33.75 KB | ||
| 059 14-find first and last occurence.txt | 2.23 KB | ||
| 23 Advanced Binary Search _ Search in Rotated Sorted Array | |||
| 001 Search in Rotated Sorted Array.mp4 | 146.85 MB | ||
| 001 Search in Rotated Sorted Array.srt | 26.96 KB | ||
| 060 15-Search in Rotated Sorted Array.txt | 771 B | ||
| 24 Advanced Binary Search _ Implement Square root | |||
| 001 Implement Square root.mp4 | 131.59 MB | ||
| 001 Implement Square root.srt | 24.52 KB | ||
| 061 16-Square root.txt | 514 B | ||
| 25 Advanced Binary Search _ Find Minimum Element in Sorted Rotated Array | |||
| 001 Find Minimum Element in Sorted Rotated Array.mp4 | 147.29 MB | ||
| 001 Find Minimum Element in Sorted Rotated Array.srt | 24.79 KB | ||
| 062 17-find minimum element in sorted rotated array.txt | 763 B | ||
| 26 ZigZag Conversion | |||
| 001 ZigZag Conversion.mp4 | 165.56 MB | ||
| 001 ZigZag Conversion.srt | 26.8 KB | ||
| 063 21-zigzag conversion.txt | 687 B | ||
| 27 Single Number | |||
| 001 Single Number.mp4 | 120.83 MB | ||
| 001 Single Number.srt | 24.66 KB | ||
| 064 23-Single Number.txt | 249 B | ||
| 28 Jump Game | |||
| 001 Jump Game.mp4 | 133.55 MB | ||
| 001 Jump Game.srt | 24.54 KB | ||
| 065 46-jump game.txt | 396 B | ||
| 29 Jump Game - 2 | |||
| 001 Jump Game - 2.mp4 | 163.93 MB | ||
| 001 Jump Game - 2.srt | 28.06 KB | ||
| 066 47-jump game 2.txt | 875 B | ||
| 30 Reverse Words in a String | |||
| 001 Reverse Words in a String.mp4 | 204.38 MB | ||
| 001 Reverse Words in a String.srt | 33.36 KB | ||
| 067 45-reverse words in a string.txt | 1.27 KB | ||
| 31 Find Permutation | |||
| 001 Find Permutation.mp4 | 172.16 MB | ||
| 001 Find Permutation.srt | 27.56 KB | ||
| 068 40-find permutation.txt | 491 B | ||
| 32 Rotate Image | |||
| 001 Rotate Image.mp4 | 155.52 MB | ||
| 001 Rotate Image.srt | 27.58 KB | ||
| 069 39-rotate matrix.txt | 708 B | ||
| 33 Spiral Order Matrix | |||
| 001 Spiral Order Matrix.mp4 | 153.86 MB | ||
| 001 Spiral Order Matrix.srt | 25.72 KB | ||
| 070 38-spiral order matrix.txt | 1.31 KB | ||
| 34 Set Matrix Zero | |||
| 001 Set Matrix Zero.mp4 | 216.07 MB | ||
| 001 Set Matrix Zero.srt | 39.91 KB | ||
| 071 18-set matrix zeroes.txt | 1.7 KB | ||
| 35 Search in Row-wise and Column-wise Matrix | |||
| 001 Search in Matrix.mp4 | 122.08 MB | ||
| 001 Search in Matrix.srt | 20.1 KB | ||
| 072 22-search in matrix.txt | 701 B | ||
| 36 Intersection of List | |||
| 001 Intersection of List.mp4 | 243.72 MB | ||
| 001 Intersection of List.srt | 40.65 KB | ||
| 073 1-intersection of list.txt | 1.64 KB | ||
| 37 Reverse a List | |||
| 001 Reverse a List.mp4 | 64.02 MB | ||
| 001 Reverse a List.srt | 10.35 KB | ||
| 074 2-reverse a list.txt | 598 B | ||
| 38 Middle Node of List - Slow and Fast Pointer Approach | |||
| 001 Middle Node of List - Slow and Fast Pointer Approach.mp4 | 118.19 MB | ||
| 001 Middle Node of List - Slow and Fast Pointer Approach.srt | 26.96 KB | ||
| 075 4-middle point of LL .txt | 555 B | ||
| 39 Remove nth Node from end of list | |||
| 001 Remove nth Node from end of list.mp4 | 153.87 MB | ||
| 001 Remove nth Node from end of list.srt | 37.41 KB | ||
| 076 6-remove kth node from end of ll.txt | 759 B | ||
| 40 Add 2 number as list | |||
| 001 Add 2 number as list.mp4 | 165.72 MB | ||
| 001 Add 2 number as list.srt | 24.2 KB | ||
| 077 3-add two numbers as list.txt | 1.79 KB | ||
| 41 Partition List | |||
| 001 Partition List.mp4 | 155.44 MB | ||
| 001 Partition List.srt | 26.31 KB | ||
| 078 4-partition list.txt | 1.44 KB | ||
| 42 Cycle Detection in Linked List | |||
| 001 Cycle.mp4 | 135.92 MB | ||
| 001 Cycle.srt | 23.9 KB | ||
| 079 5-Linked List Cycle.txt | 851 B | ||
| 43 Cycle - Find starting point of Cycle | |||
| 001 Cycle -2.mp4 | 170.37 MB | ||
| 001 Cycle -2.srt | 28.2 KB | ||
| 080 6-cycle 2.txt | 1.58 KB | ||
| 44 Valid Parenthesis | |||
| 001 Valid Parenthesis.mp4 | 180.61 MB | ||
| 001 Valid Parenthesis.srt | 28.76 KB | ||
| 081 7-valid paranthesis.txt | 957 B | ||
| 45 Inorder Traversal | |||
| 001 Inorder Traversal.mp4 | 96.07 MB | ||
| 001 Inorder Traversal.srt | 15.45 KB | ||
| 082 28-inorder traversal.txt | 687 B | ||
| 46 PreOrder Traversal | |||
| 001 PreOrder Traversal.mp4 | 85.58 MB | ||
| 001 PreOrder Traversal.srt | 12.98 KB | ||
| 083 29-preorder traversal.txt | 693 B | ||
| 47 PostOrder Traversal | |||
| 001 PostOrder Traversal.mp4 | 62.33 MB | ||
| 001 PostOrder Traversal.srt | 11.28 KB | ||
| 084 30-postorder traversal.txt | 661 B | ||
| 48 Same Tree | |||
| 001 Same Tree.mp4 | 81.7 MB | ||
| 001 Same Tree.srt | 13.91 KB | ||
| 085 42-same tree.txt | 636 B | ||
| 49 Symmetric Binary Tree | |||
| 001 Symmetric Binary Tree.mp4 | 120.62 MB | ||
| 001 Symmetric Binary Tree.srt | 15.99 KB | ||
| 086 31-summetric binary tree.txt | 885 B | ||
| 50 Count Nodes | |||
| 001 Count Nodes.mp4 | 32.59 MB | ||
| 001 Count Nodes.srt | 10.42 KB | ||
| 087 6-Count Nodes.txt | 633 B | ||
| 51 Maximum Depth of Binary Tree | |||
| 001 Maximum Depth of Binary Tree.mp4 | 98.25 MB | ||
| 001 Maximum Depth of Binary Tree.srt | 17.25 KB | ||
| 088 32-maxDepth of binary tree.txt | 550 B | ||
| 52 Level Order Traversal | |||
| 001 Level Order Traversal.mp4 | 238.35 MB | ||
| 001 Level Order Traversal.srt | 44.31 KB | ||
| 089 33-level order traversal.txt | 1.21 KB | ||
| 53 Reverse Level Order Traversal | |||
| 001 Reverse Level Order Traversal.mp4 | 97.37 MB | ||
| 001 Reverse Level Order Traversal.srt | 16.34 KB | ||
| 090 34-reverse level order traversal.txt | 1.26 KB | ||
| 54 ZigZag Level Order Traversal | |||
| 001 ZigZag Level Order Traversal.mp4 | 252.04 MB | ||
| 001 ZigZag Level Order Traversal.srt | 43.14 KB | ||
| 091 35-zigzag level order traversal.txt | 1.22 KB | ||
| 55 Vertical Order Traversal | |||
| 001 Vertical Order Traversal Explanation.mp4 | 95.45 MB | ||
| 001 Vertical Order Traversal Explanation.srt | 16.52 KB | ||
| 002 Vertical Order Traversal Code.mp4 | 154.35 MB | ||
| 002 Vertical Order Traversal Code.srt | 19.04 KB | ||
| 093 Vertical Order Traversal Code.txt | 1.45 KB | ||
| 56 Minimum Depth of Binary Tree | |||
| 001 Minimum Depth of Binary Tree.mp4 | 157.43 MB | ||
| 001 Minimum Depth of Binary Tree.srt | 26.74 KB | ||
| 094 36-minimum depth of binary tree.txt | 1.13 KB | ||
| 57 Lowest Common Ancestor - BST | |||
| 001 Lowest Common Ancestor.mp4 | 170.78 MB | ||
| 001 Lowest Common Ancestor.srt | 29.18 KB | ||
| 095 37-least common ancestor of bst.txt | 777 B | ||
| 58 Lowest Common Ancestor Binary Tree | |||
| 001 Lowest Common Ancestor Binary Tree explain.mp4 | 45.03 MB | ||
| 001 Lowest Common Ancestor Binary Tree explain.srt | 7.75 KB | ||
| 002 Lowest Common Ancestor Binary Tree code.mp4 | 85.98 MB | ||
| 002 Lowest Common Ancestor Binary Tree code.srt | 12.58 KB | ||
| 097 Lowest Common Ancestor BT.txt | 834 B | ||
| 59 Invert Binary Tree | |||
| 001 Invert Binary Tree.mp4 | 68.53 MB | ||
| 001 Invert Binary Tree.srt | 10.8 KB | ||
| 098 27-Invert Binary Tree.txt | 552 B | ||
| 60 Validate Binary Search Tree | |||
| 001 Validate Binary Search Tree.mp4 | 200.15 MB | ||
| 001 Validate Binary Search Tree.srt | 32.45 KB | ||
| 099 26-Validate Binary Search Tree.txt | 1.43 KB | ||
| 61 Construct Tree from PreOrder and Inorder Traversal | |||
| 001 Construct Tree from PreOrder and Inorder Traversal Introduction.mp4 | 101.53 MB | ||
| 001 Construct Tree from PreOrder and Inorder Traversal Introduction.srt | 30.15 KB | ||
| 002 Construct Tree from PreOrder and Inorder Traversal Solution.mp4 | 179.85 MB | ||
| 002 Construct Tree from PreOrder and Inorder Traversal Solution.srt | 27.24 KB | ||
| 101 17-Construct Tree from PreOrder and Inorder Traversal Solution.txt | 1.61 KB | ||
| 62 Construct Tree from PostOrder and Inorder Traversal | |||
| 001 Construct Tree from PostOrder and Inorder Traversal Introduction.mp4 | 55.29 MB | ||
| 001 Construct Tree from PostOrder and Inorder Traversal Introduction.srt | 15.11 KB | ||
| 002 Construct Tree from PostOrder and Inorder Traversal Solution.mp4 | 104.1 MB | ||
| 002 Construct Tree from PostOrder and Inorder Traversal Solution.srt | 15.48 KB | ||
| 103 19-Construct Tree from PostOrder and Inorder Traversal Solution.txt | 1.65 KB | ||
| 63 Construct Cartesian Tree | |||
| 001 Construct Cartesian Tree Explain.mp4 | 52.09 MB | ||
| 001 Construct Cartesian Tree Explain.srt | 10.39 KB | ||
| 002 Construct Cartesian Tree Code.mp4 | 47.1 MB | ||
| 002 Construct Cartesian Tree Code.srt | 8.93 KB | ||
| 105 Inorder Traversal of Cartesian Tree.txt | 874 B | ||
| 64 Diameter of Binary Tree | |||
| 001 Diameter of Binary Tree.mp4 | 134.78 MB | ||
| 001 Diameter of Binary Tree.srt | 28.74 KB | ||
| 002 Diameter of Binary Tree Better Approach.mp4 | 129.32 MB | ||
| 002 Diameter of Binary Tree Better Approach.srt | 26.46 KB | ||
| 106 20-Diameter of Binary Tree.txt | 991 B | ||
| 107 21-Diameter of Binary Tree Better Approach.txt | 1.2 KB | ||
| 65 Convert Sorted Array to BST | |||
| 001 Convert Sorted Array to BST.mp4 | 51.22 MB | ||
| 001 Convert Sorted Array to BST.srt | 11.69 KB | ||
| 108 7-Convert Sorted Array to BST.txt | 982 B | ||
| 66 Kth Smallest Element in a BST | |||
| 001 Kth Smallest Element in a BST Code.mp4 | 31.5 MB | ||
| 001 Kth Smallest Element in a BST Code.srt | 5.68 KB | ||
| 002 Kth Smallest Element in a BST Explanation.mp4 | 49.3 MB | ||
| 002 Kth Smallest Element in a BST Explanation.srt | 10.49 KB | ||
| 109 kth Smallest element code.txt | 861 B | ||
| 67 Two Sum | |||
| 001 Two Sum.mp4 | 183.49 MB | ||
| 001 Two Sum.srt | 30 KB | ||
| 111 24-two sum.txt | 612 B | ||
| 68 Two Sum II | |||
| 001 Two Sum II.mp4 | 110.93 MB | ||
| 001 Two Sum II.srt | 16.34 KB | ||
| 112 25-two sum II.txt | 574 B | ||
| 69 Data Structure _ Priority Queues | |||
| 001 Introduction to Priority Queues.mp4 | 81.77 MB | ||
| 001 Introduction to Priority Queues.srt | 16.21 KB | ||
| 002 Ways to implement Priority Queue.mp4 | 99.58 MB | ||
| 002 Ways to implement Priority Queue.srt | 17.64 KB | ||
| 003 Heap Introduction.mp4 | 52.02 MB | ||
| 003 Heap Introduction.srt | 13.17 KB | ||
| 004 CBT and its Implementation.mp4 | 155.62 MB | ||
| 004 CBT and its Implementation.srt | 35.9 KB | ||
| 005 Insert & Delete in Heaps.mp4 | 147.15 MB | ||
| 005 Insert & Delete in Heaps.srt | 40.41 KB | ||
| 006 Example Solution & Max Heap.mp4 | 56.11 MB | ||
| 006 Example Solution & Max Heap.srt | 14.86 KB | ||
| 007 Implementation of Priority Queue - Part 1.mp4 | 49.02 MB | ||
| 007 Implementation of Priority Queue - Part 1.srt | 9.45 KB | ||
| 008 Implementation - Insert.mp4 | 115.22 MB | ||
| 008 Implementation - Insert.srt | 20.4 KB | ||
| 009 Remove Min Explanation.mp4 | 42.86 MB | ||
| 009 Remove Min Explanation.srt | 9.4 KB | ||
| 010 Remove Min Solution & Complexity Analysis.mp4 | 210.59 MB | ||
| 010 Remove Min Solution & Complexity Analysis.srt | 31.36 KB | ||
| 011 Inplace Heap Sort.mp4 | 151.11 MB | ||
| 011 Inplace Heap Sort.srt | 36.15 KB | ||
| 012 Inplace Heap Sort Solution.mp4 | 176.85 MB | ||
| 012 Inplace Heap Sort Solution.srt | 28.43 KB | ||
| 013 Inbuilt Priority Queue.mp4 | 75.91 MB | ||
| 013 Inbuilt Priority Queue.srt | 13.67 KB | ||
| 014 K Sorted Array.mp4 | 226.17 MB | ||
| 014 K Sorted Array.srt | 42.14 KB | ||
| 015 K smallest Element.mp4 | 138.9 MB | ||
| 015 K smallest Element.srt | 26.32 KB | ||
| 016 Inbuilt Min Priority Queue.mp4 | 127.6 MB | ||
| 016 Inbuilt Min Priority Queue.srt | 20.81 KB | ||
| 119 7-Implementation of Priority Queue - Part 1.txt | 506 B | ||
| 120 8-Implementation-insert.txt | 905 B | ||
| 122 10-remove min solution and complexity analysis.txt | 1.87 KB | ||
| 124 12-Inplace Heap Sort Solution.txt | 1.13 KB | ||
| 125 13-Inbuilt Priority Queue.txt | 406 B | ||
| 127 14-K sorted Array.txt | 582 B | ||
| 127 15-K smallest element.txt | 702 B | ||
| 128 16-Inbuilt MIN PQ.txt | 474 B | ||
| 128 16-K smallest using MIN PQ.txt | 1.02 KB | ||
| 70 Data Structure _ HashMap | |||
| 001 Introduction to Hash Map.mp4 | 129.54 MB | ||
| 001 Introduction to Hash Map.srt | 32.66 KB | ||
| 002 Inbuilt HashMap.mp4 | 142.55 MB | ||
| 002 Inbuilt HashMap.srt | 21.82 KB | ||
| 003 Remove Duplicates.mp4 | 139.16 MB | ||
| 003 Remove Duplicates.srt | 27.29 KB | ||
| 004 Iterators.mp4 | 231.07 MB | ||
| 004 Iterators.srt | 31.95 KB | ||
| 005 Bucket Array & Hash Function.mp4 | 117.75 MB | ||
| 005 Bucket Array & Hash Function.srt | 23.7 KB | ||
| 006 Collision Handling.mp4 | 119.17 MB | ||
| 006 Collision Handling.srt | 22.18 KB | ||
| 007 HashMap Implementation Insert.mp4 | 280.28 MB | ||
| 007 HashMap Implementation Insert.srt | 43.52 KB | ||
| 008 HashMap Implementation Delete & Search.mp4 | 106.5 MB | ||
| 008 HashMap Implementation Delete & Search.srt | 16.69 KB | ||
| 009 Time Complexity & Load Factor.mp4 | 94.74 MB | ||
| 009 Time Complexity & Load Factor.srt | 17.54 KB | ||
| 010 Rehashing.mp4 | 242.07 MB | ||
| 010 Rehashing.srt | 33.29 KB | ||
| 130 2-Inbuilt Hashmap.txt | 1017 B | ||
| 131 3-remove duplicates.txt | 550 B | ||
| 132 4-iterators.mp4 | 324.09 MB | ||
| 132 4-iterators.srt | 33.03 KB | ||
| 132 4-iterators.txt | 1.51 KB | ||
| 135 7-HashMap Implementation-insert.txt | 1.75 KB | ||
| 136 8-HashMap Implementation-delete & search.txt | 2.65 KB | ||
| 138 10-Rehashing.txt | 4.06 KB | ||
| 71 Fibonacci | |||
| 001 Fibonacci.mp4 | 193.66 MB | ||
| 001 Fibonacci.srt | 39.1 KB | ||
| 002 Hint _ Minimum Steps to 1.mp4 | 45.53 MB | ||
| 002 Hint _ Minimum Steps to 1.srt | 15.65 KB | ||
| 003 Minimum Steps to 1 Brute Force Method.mp4 | 90.14 MB | ||
| 003 Minimum Steps to 1 Brute Force Method.srt | 16.42 KB | ||
| 004 Minimum Steps to 1 Memorization Method.mp4 | 123.92 MB | ||
| 004 Minimum Steps to 1 Memorization Method.srt | 20.76 KB | ||
| 005 Minimization Steps to 1 Bottom Up Method.mp4 | 111.9 MB | ||
| 005 Minimization Steps to 1 Bottom Up Method.srt | 16.97 KB | ||
| 139 1-fibonaci.txt | 1.05 KB | ||
| 141 3-minimum steps to 1 brute force implentation.txt | 487 B | ||
| 142 4-minimum steps to 1 memorization method.txt | 1.16 KB | ||
| 143 5-minimum steps to 1 bottom up dp.txt | 2.06 KB | ||
| 72 Minimum Steps in Infinite Grid | |||
| 001 Minimum Steps in Infinite Grid.mp4 | 42.68 MB | ||
| 001 Minimum Steps in Infinite Grid.srt | 17.24 KB | ||
| 002 Minimum Steps in Infinite Grid - Coding.mp4 | 16.31 MB | ||
| 002 Minimum Steps in Infinite Grid - Coding.srt | 4.81 KB | ||
| 145 Minimum Steps in infinite grid.txt | 208 B | ||
| 73 Grid Unique Path | |||
| 001 Grid Unique Path Explanation.mp4 | 28.25 MB | ||
| 001 Grid Unique Path Explanation.srt | 5.62 KB | ||
| 002 Grid Unique Path - Coding.mp4 | 47.54 MB | ||
| 002 Grid Unique Path - Coding.srt | 7.99 KB | ||
| 003 Grid Unique Path Optimization.mp4 | 93.58 MB | ||
| 003 Grid Unique Path Optimization.srt | 14.47 KB | ||
| 147 Grid Unique.txt | 612 B | ||
| 148 Grid Unique.txt | 612 B | ||
| 74 Longest Common Subsequence | |||
| 001 Longest Common Subsequence Recursive.mp4 | 66.09 MB | ||
| 001 Longest Common Subsequence Recursive.srt | 15.14 KB | ||
| 002 Longest Common Subsequence DP.mp4 | 82.06 MB | ||
| 002 Longest Common Subsequence DP.srt | 12.65 KB | ||
| 149 LCS-recursive.txt | 488 B | ||
| 150 LCS-dp.txt | 1005 B | ||
| 75 Minimum Distance | |||
| 001 Minimum Distance Recursive.mp4 | 89.82 MB | ||
| 001 Minimum Distance Recursive.srt | 16.69 KB | ||
| 002 Minimum Distance DP.mp4 | 87.22 MB | ||
| 002 Minimum Distance DP.srt | 12.43 KB | ||
| 151 Edit Distance-recursive.txt | 633 B | ||
| 152 Edit Distance-dp.txt | 1.28 KB | ||
| 76 Climbing Stairs | |||
| 001 Climbing Stairs Recursive.mp4 | 28.18 MB | ||
| 001 Climbing Stairs Recursive.srt | 6.2 KB | ||
| 002 Climbing Stairs DP.mp4 | 24.45 MB | ||
| 002 Climbing Stairs DP.srt | 5.21 KB | ||
| 003 Climbing Stairs DP Generalised.mp4 | 57.28 MB | ||
| 003 Climbing Stairs DP Generalised.srt | 10.86 KB | ||
| 153 Climbing Stairs Recursive.txt | 256 B | ||
| 154 Climbing stairs DP.txt | 426 B | ||
| 155 Climbing Stairs DP Generalised.txt | 800 B | ||
| 77 0-1 Knapsack | |||
| 001 0-1 Knapsack Recursive.mp4 | 106.11 MB | ||
| 001 0-1 Knapsack Recursive.srt | 28.19 KB | ||
| 002 0-1 Knapsack DP.mp4 | 70.76 MB | ||
| 002 0-1 Knapsack DP.srt | 15.44 KB | ||
| 156 Knapsack-Recursive.txt | 490 B | ||
| 157 Knapsack-DP.txt | 962 B | ||
| 78 Data Structure _ Trie | |||
| 001 Introduction.mp4 | 120.83 MB | ||
| 001 Introduction.srt | 29.03 KB | ||
| 002 Insert in Trie.mp4 | 127.58 MB | ||
| 002 Insert in Trie.srt | 23.5 KB | ||
| 003 Search in Trie.mp4 | 76.62 MB | ||
| 003 Search in Trie.srt | 11.57 KB | ||
| 159 Trie-add and search.txt | 1.42 KB | ||
| 160 Trie - search function.mp4 | 167.33 MB | ||
| 160 Trie - search function.srt | 8.89 KB | ||
| 79 Hotel Reviews | |||
| 001 Hotel Reviews.mp4 | 62.06 MB | ||
| 001 Hotel Reviews.srt | 12.66 KB | ||
| 80 Shortest Unique Prefix | |||
| 001 Shortest Unique Prefix.mp4 | 169.8 MB | ||
| 001 Shortest Unique Prefix.srt | 29.76 KB | ||
| 81 Paragraph Words Replacement | |||
| 001 Paragraph Words Replacement.mp4 | 89.05 MB | ||
| 001 Paragraph Words Replacement.srt | 16.73 KB | ||
| 002 Paragraph Words Replacement - Trie Solution.mp4 | 61.52 MB | ||
| 002 Paragraph Words Replacement - Trie Solution.srt | 12.41 KB | ||
| 82 Number of islands | |||
| 001 Number of islands Explain.mp4 | 41.82 MB | ||
| 001 Number of islands Explain.srt | 10.15 KB | ||
| 002 Number of islands Code.mp4 | 168.2 MB | ||
| 002 Number of islands Code.srt | 25.73 KB | ||
| 166 Number of islands.txt | 1.05 KB | ||
| 83 MaxArea of islands | |||
| 001 MaxArea of islands Explain.mp4 | 50.72 MB | ||
| 001 MaxArea of islands Explain.srt | 8.32 KB | ||
| 002 MaxArea of islands code.mp4 | 76.06 MB | ||
| 002 MaxArea of islands code.srt | 9.31 KB | ||
| 168 MaxArea of island.txt | 1.16 KB | ||
| 84 Algorithms _ Topological Sort | |||
| 001 Introduction.mp4 | 69.33 MB | ||
| 001 Introduction.srt | 22.39 KB | ||
| 002 Topological Sort Code.mp4 | 23.02 MB | ||
| 002 Topological Sort Code.srt | 8.08 KB | ||
| 85 Course Schedule | |||
| 001 Course Schedule Explain.mp4 | 69.85 MB | ||
| 001 Course Schedule Explain.srt | 13.7 KB | ||
| 002 Course Schedule Code.mp4 | 131.08 MB | ||
| 002 Course Schedule Code.srt | 20.35 KB | ||
| 172 Course Schedule.txt | 1.02 KB | ||
| 86 Algorithms _ Kruskal | |||
| 001 Introduction.mp4 | 130.59 MB | ||
| 001 Introduction.srt | 31.92 KB | ||
| 002 Disjoint Set for Cycle Detection.mp4 | 281.24 MB | ||
| 002 Disjoint Set for Cycle Detection.srt | 49.7 KB | ||
| 003 Kruskal Code.mp4 | 19.24 MB | ||
| 003 Kruskal Code.srt | 4.79 KB | ||
| 87 Algorithms _ Prims | |||
| 001 Introduction + Code.mp4 | 118.82 MB | ||
| 001 Introduction + Code.srt | 28.36 KB | ||
| 88 Commutable Islands | |||
| 001 Commutable Islands explain.mp4 | 31.51 MB | ||
| 001 Commutable Islands explain.srt | 6.92 KB | ||
| 002 Commutable Islands code.mp4 | 79.83 MB | ||
| 002 Commutable Islands code.srt | 18.54 KB | ||
| 178 Commutable Islands Code.txt | 801 B | ||
| 89 Shortest Path in Binary Matrix | |||
| 001 Shortest Path in Binary Matrix Explain.mp4 | 49.86 MB | ||
| 001 Shortest Path in Binary Matrix Explain.srt | 10.71 KB | ||
| 002 Shortest Path in Binary Matrix Code.mp4 | 105.98 MB | ||
| 002 Shortest Path in Binary Matrix Code.srt | 20.26 KB | ||
| 180 Shortest Path in Binary Matrix code.txt | 1.02 KB | ||
| 90 Knight on chess Board | |||
| 001 Knight on chess Board explain.mp4 | 40.89 MB | ||
| 001 Knight on chess Board explain.srt | 9.43 KB | ||
| 002 Knight on chess Board code.mp4 | 50.77 MB | ||
| 002 Knight on chess Board code.srt | 8.88 KB | ||
| 182 knight on chess board code.txt | 920 B | ||
| 91 Word Ladder | |||
| 001 Word Ladder explain.mp4 | 67.67 MB | ||
| 001 Word Ladder explain.srt | 10.81 KB | ||
| 002 Word Ladder code.mp4 | 160.04 MB | ||
| 002 Word Ladder code.srt | 18.57 KB | ||
| 184 Word Ladder.txt | 1.07 KB | ||
| 92 Rotten Oranges | |||
| 001 Rotten Oranges Explanation.mp4 | 72.91 MB | ||
| 001 Rotten Oranges Explanation.srt | 14.1 KB | ||
| 002 Rotten Oranges Code.mp4 | 125.98 MB | ||
| 002 Rotten Oranges Code.srt | 17.59 KB | ||
| 186 Rotten oranges code.txt | 1.31 KB | ||
| 93 Algorithm _ Dijikstra | |||
| 001 Algo _ Dijikstra explain.mp4 | 78.43 MB | ||
| 001 Algo _ Dijikstra explain.srt | 21.15 KB | ||
| 002 Algo _ Dijikstra Code.mp4 | 16.69 MB | ||
| 002 Algo _ Dijikstra Code.srt | 5.56 KB | ||
| 94 Merge K sorted List | |||
| 001 Merge K sorted List explanation.mp4 | 42.81 MB | ||
| 001 Merge K sorted List explanation.srt | 8.21 KB | ||
| 002 Merge K sorted List code.mp4 | 123.66 MB | ||
| 002 Merge K sorted List code.srt | 19.56 KB | ||
| 190 Merge K Sorted List.txt | 1.16 KB | ||
| 95 LRU Cache | |||
| 001 LRU Cache explain.mp4 | 132.41 MB | ||
| 001 LRU Cache explain.srt | 19.64 KB | ||
| 002 LRU Cache code.mp4 | 85.54 MB | ||
| 002 LRU Cache code.srt | 14.19 KB | ||
| 192 Lru cache.txt | 1 KB | ||
| 96 Repeat and Missing Number | |||
| 001 Repeat and Missing Number Explanation.mp4 | 68.14 MB | ||
| 001 Repeat and Missing Number Explanation.srt | 15.09 KB | ||
| 002 Repeat and Missing Number Code.mp4 | 57.49 MB | ||
| 002 Repeat and Missing Number Code.srt | 10.17 KB | ||
| 194 Repeat and missing number array code.txt | 559 B | ||
| 97 Maximum Sum Subarray - Kadane's Algorithm | |||
| 001 Maximum Sum Subarray explain.mp4 | 63.05 MB | ||
| 001 Maximum Sum Subarray explain.srt | 14.38 KB | ||
| 002 Maximum Sum Subarray code.mp4 | 17.15 MB | ||
| 002 Maximum Sum Subarray code.srt | 3.26 KB | ||
| 196 Maximum Sum Subarray code.txt | 358 B | ||
| 98 Flip the array | |||
| 001 Flip Explanation.mp4 | 72.19 MB | ||
| 001 Flip Explanation.srt | 17.08 KB | ||
| 002 Flip Code.mp4 | 49.73 MB | ||
| 002 Flip Code.srt | 11.81 KB | ||
| 198 Flip code.txt | 640 B | ||
| 99 Distinct Number in Windows | |||
| 001 Distinct Number in Windows Explanation.mp4 | 56.13 MB | ||
| 001 Distinct Number in Windows Explanation.srt | 16.69 KB | ||
| 002 Distinct Number in Windows Code.mp4 | 68.08 MB | ||
| 002 Distinct Number in Windows Code.srt | 15 KB | ||
| 200 Distinct Number in windows.txt | 499 B | ||
| ▲ 550 total files | |||
Description
Обучающие видео » Компьютерные видеоуроки и обучающие интерактивные DVD » Программирование (видеоуроки)
Cracking Coding Interview:Data Structure & Algorithm
Год выпуска: 6/2021
Производитель: Udemy
Сайт производителя: https://www.udemy.com/course/coding-interview-question-data-structures-algorithm/
Автор: Ankit Thakran, Harsh Kajla
Продолжительность: 48h 26m 46s
Тип раздаваемого материала: Видеоурок
Язык: Английский
Субтитры: Английский
Описание:
Ace the Google, Amazon, Meta, Microsoft, Uber.. coding interviews 2024. Step-by-step guide for their toughest questions!
What you'll learn Solve Easy to Medium Difficulty problems that address different data strutures
Have an understanding of how to systematically approach coding problems in a step by step manner
Learn everything you need to ace difficult coding interviews
Practice dozens of different challenges
Master commonly asked interview questions
Ace the coding interview at the top tech companies (Google, Amazon, Facebook, Apple, Microsoft, Netflix + others)
The ultimate resource to prepare for coding interviews, tech interviews and programming interviews
Use the right Data Structures and Algorithms to pass coding interview questions that have the optimal solution Requirements Basic Knowledge of DS & Algo
Basic Knowledge of any one programming language like C++/Java/Python/C#...
If you have the ambition to learn and get into one of these companies we will make it achievable for you! (see our student success stories) Description
Brand new course ready for the 2024 hiring season! Join a course taught by industry experts that have actually worked both at top tech firms. Graduates of this course are now working at Google, Tesla, Amazon, Apple, IBM, JP Morgan, Facebook + other top tech companies.
This is the ultimate resource to prepare you for coding interviews. Everything you need in one place!
Do you know entry level engineers at top tech companies like Google , Microsoft , Facebook ... makes over $180,000 per year
So how we can get these paying high paying jobs ? the answer is pretty simple we need to crack their coding interviews.
Now coding interviews at these top tech companies are definitely tough to crack and there is only ONE method to get these high paying jobs- and that is PRACTICE! Practicing dozens of coding questions is what makes the difference between a job offer for a $180k USD and another rejection email. This course is going to not only give you dozens of questions to practice on, but it will also make sure you understand the tricks behind solving each question, so you’ll be able to perform in a real interview.
Taught by industry experts
This course is taught by Harsh who is popular programming instructor and an ace software engineer, currently working with Atlassian (x-Intuit || x-Amazon) and has bagged job offers from Microsoft , Samsung and Flipkart in past .His aim is to bring high quality courses at pocket friendly pricing. He is known for amazingly simplified explanations. Harsh has over 5+ years of teaching experience and has trained over 25,000+ students in his online courses in the past. His expertise lies in data structures and algorithms, coding interview preparation. Many of his ex-students are now working in top product companies like Apple, Google, Amazon, Microsoft, Samsung, Adobe and more.
Super Responsive Instructors
As if this course wasn’t complete enough, we offer full support, answering any questions you have within 6 hours ,7 days a week (whereas many instructors answer just once per week, or not at all).
This means you’ll never find yourself stuck on one lesson for days on end. With our hand-holding guidance, you’ll progress smoothly through this course without any major roadblocks.
[spoiler="WHAT OUR LEARNERS ARE SAYING:"]
5 STARS - this course is amazing
it delivers what it promises, from zero to mastery .the use of c++ was the best for me, better than other courses, finally i can solve problems using recursive and understand a lot of things .a small suggestion to the creators other courses are popular due to the use of graphics and animations in the videos, so, if you can enhance that part a bit because your content is pure gold and please add real interview question from big companies another thing, please expose more of your content by making more videos available to view before purchase, i almost did not buy this course because of this Keep up the good work and many thanks
5 STARS - Feeling very prepared for my upcoming interview - the explanations are very clear and helpful.
5 STARS - Really enjoying this course. Problems and solutions are explained very clearly - a lot better than the typical here is the solution to this problem. Ankit appears to really know this stuff. He spends the first half of each video working out examples on the white board before attempting the solution. And the best part is that Ankit responds quickly to all the questions asked. If you hit a road block doing LeetCode problems, get this course. Worth every penny.
5 STARS - very good problems covered and also instructor wrote very clean and good code.Instructor is very responsive Thanks for the course
5 STARS - Great course to learn coding interview problems.
5 STARS - The best course to prepare for coding interviews has lucid explaination of each and every problem.very good and simple to understand the codes as well as examples. The instructors are truly amazing. They make very simple to learn difficult topics. I highly recommended this course to crack coding interview.
5 STARS - He really knows how to explain concepts and repeats until it clicks in the head. Also I like the way he doesn't jump to the code until he explains all the concepts and algorithm to do with the problem.
5 STARS - like the clear-cut style. no nonsense!
5 STARS - This course is really amazing. instructor is going beyond and beyond each and every thing was my beyond expectations. really mastery course it is.
5 STARS - This is the best course on data structure compare to all data structure course .all the topic of data structure has been completed in this course .if anyone want to learn data structure then you can go for it. thank you sir for making this course on udemy
5 STARS - This is the best computer science course I've taken. If you need to learn C++ and pass your technical interviews, this is the course to take. The explanations in the videos are extremely thorough, and I have reached out to the instructor several times on various questions, and he's always quick to respond and very helpful. In my experience, every MOOC that said its instructors would actively help you with problems lied, EXCEPT FOR THIS COURSE. TAKE THIS COURSE!
5 STARS - I liked this course very much! It clears out your basics quite well and is does totally what Harsh and Ankit claim they'll do. I would recommend this to everyone who wants to learn Data Structures and Algorithms, especially if you had a phobia for coding like I did. I now love coding! All thanks to them.
5 STARS - This is the BEST COURSE on C++ Data Structures & Algorithms. The Instructors are the BEST. They Draw Everything out and Then EXPLAIN THE CONCEPTS VERY WELL & then CODE it. Also I Love Doing the LEETCODE ProblemSets. Absolutely Fantastic. Above my Expectations. I am taking this course for COMPETITIVE PROGRAMMING. It is the BEST COURSE. Thank you very much Ankit and Harsh. You guys are the BEST!
5 STARS - My first comment on udemy. These guys are genius. I normally get bored through a tutorial but i'm hooked on your course brothers. I hope to join you at microsoft or amazon soon.
5 STARS - Everyone, look into this course. It's amazing. I have been struggling with data structures and algorithm but this course explanation is really really great and now I can solve some challenging questions. THANK YOU GUYS
[/spoiler]
[spoiler="Highlights"]
Course is specially designed for people who wants to get that dream job ?
Course follow step-by-step approach to solve any coding question
Pen tablet to write on the screen and provide even more visual explanations.
47+ hours of rich content
100+ HD videos
Learn from industry experts working at top tech companies Amazon , Microsoft
The course is continually updated and enhanced.
MOST Importantly, this course teach students the real-life skills needed to get those in-demand jobs
Articles , Coding exercises, Assignments , quizzes
preselected set of the most important coding interview problems based on my 6 year experience
Practices questions and personal walkthroughs of the most commonly asked interview questions
Full lifetime access
I have spent many hours combing through interview questions asked at Google, Facebook, and Amazon to make sure you know how to answer questions asked by the most well-paying companies out there.
[/spoiler]
Unlike most instructors out there, We are not marketers or salespeople. Other instructors themselves have not cracked FAANG interviews but we are different we have cracked coding interviews of Amazon , Microsoft , Uber , Samsung , Flipkart and are working at FAANG companies.
Our job as instructors will be successful if we are able to help you get your dream job at a big company. This one skill of mastering the coding interview can really change the course of your career and life and we hope you sign up today to see what it can do for your career!
The best time to start was yesterday. The next best time is now
Click the Buy Now button and start learning now!
Note : I will be writing the code in C++ but you can easily figure out mapping to other languages like Java/JS/Python...
Who this course is for: Any one who is preparing for a coding interview
Anyone that wants to work a Google, Amazon, Facebook, Microsoft, Apple, Netflix or other top tech companies
Any engineer, developer, programmer, who wants to improve their interviewing skills
Anyone interested in improving their whiteboard coding skills
Anyone who wants to become a better developer
Any self taught programmer who missed out on a computer science degree Формат видео: MP4
Видео: avc, 1280x720, 16:9, 30.000 к/с, 1143 кб/с
Аудио: aac lc, 48.0 кгц, 128 кб/с, 2 аудио
[spoiler="MediaInfo"]
General
Complete name : D:\2_1\Udemy - Cracking Coding Interview Data Structure & Algorithm in 2025 (6.2021)\46 PreOrder Traversal\001 PreOrder Traversal.mp4
Format : MPEG-4
Format profile : Base Media
Codec ID : isom (isom/iso2/avc1/mp41)
File size : 85.6 MiB
Duration : 9 min 20 s
Overall bit rate : 1 280 kb/s
Frame rate : 30.000 FPS
Writing application : Lavf58.12.100
Video
ID : 1
Format : AVC
Format/Info : Advanced Video Codec
Format profile : [email protected]
Format settings : CABAC / 4 Ref Frames
Format settings, CABAC : Yes
Format settings, Reference frames : 4 frames
Codec ID : avc1
Codec ID/Info : Advanced Video Coding
Duration : 9 min 20 s
Bit rate : 1 143 kb/s
Nominal bit rate : 3 000 kb/s
Width : 1 280 pixels
Height : 720 pixels
Display aspect ratio : 16:9
Frame rate mode : Constant
Frame rate : 30.000 FPS
Color space : YUV
Chroma subsampling : 4:2:0
Bit depth : 8 bits
Scan type : Progressive
Bits/(Pixel*Frame) : 0.041
Stream size : 76.4 MiB (89%)
Writing library : x264 core 148
Encoding settings : cabac=1 / ref=3 / deblock=1:0:0 / analyse=0x1:0x111 / me=umh / subme=6 / psy=1 / psy_rd=1.00:0.00 / mixed_ref=1 / me_range=16 / chroma_me=1 / trellis=1 / 8x8dct=0 / cqm=0 / deadzone=21,11 / fast_pskip=1 / chroma_qp_offset=-2 / threads=22 / lookahead_threads=3 / sliced_threads=0 / nr=0 / decimate=1 / interlaced=0 / bluray_compat=0 / constrained_intra=0 / bframes=3 / b_pyramid=2 / b_adapt=1 / b_bias=0 / direct=1 / weightb=1 / open_gop=0 / weightp=2 / keyint=60 / keyint_min=6 / scenecut=0 / intra_refresh=0 / rc_lookahead=60 / rc=cbr / mbtree=1 / bitrate=3000 / ratetol=1.0 / qcomp=0.60 / qpmin=0 / qpmax=69 / qpstep=4 / vbv_maxrate=3000 / vbv_bufsize=6000 / nal_hrd=none / filler=0 / ip_ratio=1.40 / aq=1:1.00
Codec configuration box : avcC
Audio
ID : 2
Format : AAC LC
Format/Info : Advanced Audio Codec Low Complexity
Codec ID : mp4a-40-2
Duration : 9 min 20 s
Bit rate mode : Constant
Bit rate : 128 kb/s
Channel(s) : 2 channels
Channel layout : L R
Sampling rate : 48.0 kHz
Frame rate : 46.875 FPS (1024 SPF)
Compression mode : Lossy
Stream size : 8.56 MiB (10%)
Default : Yes
Alternate group : 1
[/spoiler]
[spoiler="Скриншоты"]
[/spoiler]
Related Torrents
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 19 GB | fcs0310 | 3 years | 0 | 0 | |
| 2.4 GB | freecoursewb | 5 years | 0 | 0 | |
|
[ CourseHulu ] Udemy - Cracking Coding Interviews Masterclass - C + + Data Structures Posted by
freecoursewb in Other
|
239.2 MB | freecoursewb | 5 years | 0 | 0 |
|
[ DevCourseWeb ] Udemy - Cracking Coding Interview & Algorithm Design in Swift (2021) Posted by
freecoursewb in Other
|
998 MB | freecoursewb | 5 years | 0 | 0 |
|
Udemy - Cracking Coding Interview : Data Structure & Algorithm 2020 [Course Drive] Posted by
coursedrive in Other
|
4.8 GB | coursedrive | 6 years | 2 | 0 |
All Comments