Overview

Data Structures + Algorithms to Crack the Coding InterviewOnly in Coding Interview Cram: Must Know Algorithms and Questions, learn the best way to answer an interview question, look at the most commonly asked questions, and analyze time complexity of various algorithms.Interview Question Solutions and Time ComplexityLearn through hands-on coding examples and learn to solve problems quickly.Refresh your Kotlin knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.Algorithms & Data Structures - Ultimate Coding Interview PrepLearn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.Preparing for the Kotlin interview is hard. You need to understand not only concepts but also be able to articulate your thought process as you plan and execute a solution.COURSE BREAKDOWNSection 0: Introduction to Interview QuestionsCourse OverviewFizzBuzz: Print the numbers from 1 to 100 and for multiples of '3' print "Fizz" instead of the number and for the multiples of '5' print "Buzz".Section 1: String/Array Interview QuestionsReverse Words in a String: Given an input string, reverse the string word by word.Rotate Array: Rotate an array of n elements to the left by k steps.Kth Largest Element in an Array: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Section 2: Matrix Interview QuestionsSet Matrix Zeroes: Given a 2D matrix, if an element is 0, set its entire row and column to 0. Do it in place.Spiral Matrix: Given a 2D matrix, return all elements of the matrix in spiral order.Section 3: Linked List Interview QuestionsImplement a Queue Using a Linked List: Hit two data structures in one by implementing a queue and a linked list in one interview question.Section 4: Tree Interview QuestionsBuild a Binary Tree - Learn about binary trees and BST as you implement a highly asked about data structure, the binary tree.Delete a Tree NodeSection 5: Graph Interview QuestionsBuild a Graph: Each node in the graph contains a label and a list of its neighbors.Section 6: Sorting and Time ComplexityBubble Sort Algorithm: Sort a list with bubble sort.Selection Sort Algorithm: Sort a list with selection sort.Insertion Sort Algorithm: Sort a list with insertion sort.Merge Sort Algorithm: Sort a list with Merge Sort.Time Complexity of Different Sorting Algorithms: Learn the types of time complexity in Big-O Notation in order of horrible to good.Section 7 Dynamic Programming Interview QuestionsCoin Change: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. Edit Distance: Find the edit distance between two strings.Distinct Subsequences: Given a string S and a string T, count the number of distinct subsequences of T in S.Section 8 Bit Manipulation Interview QuestionsBitwise and Shift Operators: Manipulate bits and shift bits to change values.Single Number: Given an array of integers, every element appears twice except for one. Find that single one.Number of 1 Bits: Take an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight.Bitwise AND of a Range: Given two non-negative long integers, a and b and given a

Skills

Reviews