Udemybeginneren

Coding Interview Cram: Must Know Algorithms and Questions

Kotlin interview prep: Learn data structures & algorithms. Boost your coding skills and ace your next interview!

3.9(19)
142students
4h 38m
Certificate
Mammoth Interactive
Mammoth InteractiveTop-Rated Instructor, 3.3 Million+ Students

Course Content

Coding Interview Cram: Must Know Algorithms and Questions is a beginner-level Udemy course taught by Mammoth Interactive. It runs 4h 38m, is taught in English, and includes a certificate of completion. Learners rate it 3.9 out of 5 from 19 reviews, with 142 students enrolled. It is a paid course, first published June 2020.

Data Structures and Algorithms for Coding Interviews

Master the art of cracking coding interviews with this comprehensive course focused on essential algorithms and data structures. Learn the best strategies for tackling interview questions, explore the most frequently asked problems, and gain a deep understanding of time complexity analysis for various algorithms.

Interview Question Solutions & Time Complexity

Develop practical coding skills through hands-on examples. Quickly solve problems and refresh your Kotlin knowledge by addressing common beginner interview questions from top FANG companies.

Algorithms & Data Structures - Ultimate Coding Interview Prep

Prepare for interviews at leading tech companies like Facebook, Google, Amazon, and Spotify. This course equips you with the knowledge to not only understand concepts but also to clearly articulate your thought process when designing and implementing solutions.

Course Breakdown:

  • Section 0: Introduction to Interview Questions

    • FizzBuzz: A classic introductory problem to practice conditional logic.
  • Section 1: String & Array Interview Questions

    • Reverse Words in a String: Learn string manipulation techniques.
    • Rotate Array: Master array manipulation and understanding array indexing.
    • Kth Largest Element in an Array: Implement algorithms for finding specific elements in unsorted arrays.
  • Section 2: Matrix Interview Questions

    • Set Matrix Zeroes: Practice in-place array modification.
    • Spiral Matrix: Develop algorithms for traversing and manipulating 2D arrays.
  • Section 3: Linked List Interview Questions

    • Implement a Queue Using a Linked List: Combine data structures for efficient queue implementation.
  • Section 4: Tree Interview Questions

    • Build a Binary Tree: Understand binary tree structures and Binary Search Trees (BSTs).
    • Delete a Tree Node: Learn tree traversal and node deletion algorithms.
  • Section 5: Graph Interview Questions

    • Build a Graph: Represent and manipulate graph data structures.
  • Section 6: Sorting & Time Complexity

    • Bubble Sort Algorithm: Implement a basic sorting algorithm.
    • Selection Sort Algorithm: Implement another fundamental sorting algorithm.
    • Insertion Sort Algorithm: Implement an efficient sorting algorithm for small datasets.
    • Merge Sort Algorithm: Implement a powerful and efficient sorting algorithm.
    • Time Complexity of Different Sorting Algorithms: Understand Big-O notation and analyze the efficiency of various sorting methods.
  • Section 7: Dynamic Programming Interview Questions

    • Coin Change: Solve optimization problems using dynamic programming.
    • Edit Distance: Implement dynamic programming to find the minimum number of edits.
    • Distinct Subsequences: Apply dynamic programming to count unique subsequences.
  • Section 8: Bit Manipulation Interview Questions

    • Bitwise and Shift Operators: Master bitwise operations for efficient data manipulation.
    • Single Number: Utilize bit manipulation to find the unique element.
    • Number of 1 Bits: Count the number of set bits in an unsigned integer.
    • Bitwise AND of a Range: Perform bitwise operations on ranges of integers.
  • Section 9: Combinations & Permutations Interview Questions

    • Permutations: Generate all possible orderings of a string.
    • Combinations: Generate all possible selections of elements from a string.
    • Letter Combinations of a Phone Number: Solve a practical problem using recursion and string manipulation.
  • Section 10: Math Interview Questions

    • Reverse Integer: Implement algorithms for reversing integer digits.
    • Palindrome Number: Determine if an integer is a palindrome without using extra space.
    • Excel Sheet Column Number: Convert Excel column titles to their corresponding column numbers.

Why Choose This Course?

  • Lifetime access to course materials.
  • Project-based curriculum to build a strong portfolio.
  • Graduation certificate upon course completion.
  • Beginner-friendly approach for all skill levels.
  • New courses added monthly to stay ahead of industry trends.
  • Efficient, step-by-step lectures with clear explanations.
  • Relevant industry topics covered in detail.
  • 8 years of award-winning course delivery.
  • 900,000+ students across 186 countries.
  • Learn with free tools and affordable courses.

Course Author: Alexandra Kropova, a Software Developer specializing in OOP and JavaScript with extensive experience in full-stack and app development. She has contributed to Mammoth Interactive INC. since 2016, including the Coding Interview series in multiple programming languages.

Reviews:

"Captivating voice, easy

$ whoami — the devs behind tutorialsearch.io

Need a web app built? Hire the team behind TutorialSearch.io

We ship fast, production-grade full-stack apps (Next.js, React, edge infra) — the same stack that powers this site.

5.0(766)
2h 58m
intermediate
skillshare
5.0(424)
2h 18m
beginner
skillshare
5.0(224)
52m
beginner
skillshare
5.0(62)
15m
all
skillshare