Канал: AI Education 101

A Glimpse into LLM, RL and ChatGPT (April 2023)

A Glimpse into LLM, RL and ChatGPT (April 2023)

AI Edu 101

AI Edu 101

Programming Interview 50: Insert Value into Sorted Circular Linked List

Programming Interview 50: Insert Value into Sorted Circular Linked List

Programming Interview 49: Print Longest Increasing Subsequence (LIS) using Dynamic Programming

Programming Interview 49: Print Longest Increasing Subsequence (LIS) using Dynamic Programming

Programming Interview 48: Compute Largest Contiguous Subsequent Product (LSP) in Linear Time

Programming Interview 48: Compute Largest Contiguous Subsequent Product (LSP) in Linear Time

Programming Interview 47: Binary Tree Postorder Traversal without recursion (using stack)

Programming Interview 47: Binary Tree Postorder Traversal without recursion (using stack)

Programming Interview 46: N-Queen Problem

Programming Interview 46: N-Queen Problem

Programming Interview 45: Print a full binary tree's boundary in counterclockwise order

Programming Interview 45: Print a full binary tree's boundary in counterclockwise order

Programming Interview 44: Given pre-order traversal, print all possible binary trees' in-order

Programming Interview 44: Given pre-order traversal, print all possible binary trees' in-order

Programming Interview 43: Compute number of possible decipher ways for a given integer array

Programming Interview 43: Compute number of possible decipher ways for a given integer array

Programming Interview 42: Print all size-K subsets from an array

Programming Interview 42: Print all size-K subsets from an array

Programming Interview 1: Reverse a Linked List (enhanced version)

Programming Interview 1: Reverse a Linked List (enhanced version)

Programming Interview 41: Rotate an array by k positions in place (without using extra memory)

Programming Interview 41: Rotate an array by k positions in place (without using extra memory)

Programming Interview 40: Inorder and preorder Traversal of Binary Tree without using recursion

Programming Interview 40: Inorder and preorder Traversal of Binary Tree without using recursion

Programming Interview 39: Find Largest Rectangle Size in a Histogram in linear time

Programming Interview 39: Find Largest Rectangle Size in a Histogram in linear time

Programming Interview 38: Interweave a linked List with constant space and linear time

Programming Interview 38: Interweave a linked List with constant space and linear time

Programming Interview 37: Probability of passing exam by guessing

Programming Interview 37: Probability of passing exam by guessing

Programming Interview 36: Find (kth largest) Kth item from array after sorting in ascending order

Programming Interview 36: Find (kth largest) Kth item from array after sorting in ascending order

Programming Interview 35: Reconstruct a binary tree given its pre-order and in-order traversal

Programming Interview 35: Reconstruct a binary tree given its pre-order and in-order traversal

Programming Interview 34: Check if a binary tree is a sub-tree of another (Two cases)

Programming Interview 34: Check if a binary tree is a sub-tree of another (Two cases)

Programming Interview 33: Reverse words in a phrase without additional memory

Programming Interview 33: Reverse words in a phrase without additional memory

Programming Interview 32: Write a Solution for Twenty-Four game

Programming Interview 32: Write a Solution for Twenty-Four game

Programming Interview 31: Write a Calculator

Programming Interview 31: Write a Calculator

Programming Interview 30: Write a Sudoku solver

Programming Interview 30: Write a Sudoku solver

Programming Interview 29: Stair Climbing Problem

Programming Interview 29: Stair Climbing Problem

Programming Interview 28: Find Intersection of Two Lists

Programming Interview 28: Find Intersection of Two Lists

Programming Interview 27: Rotate a Linked List

Programming Interview 27: Rotate a Linked List

Programming Interview 26: Find the longest palindrome in a String

Programming Interview 26: Find the longest palindrome in a String

Programming Interview 25: Find the mid point of linked list by scanning list only once

Programming Interview 25: Find the mid point of linked list by scanning list only once

Programming Interview 24: Find the balance point in an array

Programming Interview 24: Find the balance point in an array

Programming Interview 23: Find the maximum sum of a sub-matrix in a 2-D Array (matrix)

Programming Interview 23: Find the maximum sum of a sub-matrix in a 2-D Array (matrix)

Programming Interview 22: Compute arithmetic tree expression

Programming Interview 22: Compute arithmetic tree expression

Programming Interview 21: Use stack (LIFO) to simulate queue (FIFO)

Programming Interview 21: Use stack (LIFO) to simulate queue (FIFO)

Programming Interview 20: Search value in a 2-D sorted array

Programming Interview 20: Search value in a 2-D sorted array

Programming Interview 19: Print out a 2-D array in spiral order

Programming Interview 19: Print out a 2-D array in spiral order

Programming Interview 18: Count how many rotations happen to a rotated sorted array.

Programming Interview 18: Count how many rotations happen to a rotated sorted array.

Programming Interview 17: Implement Division without using divisor operator

Programming Interview 17: Implement Division without using divisor operator

Programming Interview 16: Find Largest subsequent sum in array in O(N) time

Programming Interview 16: Find Largest subsequent sum in array in O(N) time

Programming Interview 15: Find the 'closest' value in a BST with a given search value

Programming Interview 15: Find the 'closest' value in a BST with a given search value

Programming Interview 14: Print all possible combinations of coins per change amount

Programming Interview 14: Print all possible combinations of coins per change amount

Programming Interview 13: Print all pairs in a sorted array that sum to M

Programming Interview 13: Print all pairs in a sorted array that sum to M

Programming Interview 12: Merge Two Sorted Arrays without additional memory

Programming Interview 12: Merge Two Sorted Arrays without additional memory

Programming Interview 11: Print all subset of an array

Programming Interview 11: Print all subset of an array

Programming Interview 10: Verify if a char string a rotated palindrome

Programming Interview 10: Verify if a char string a rotated palindrome

Programming Interview 9: Print all nodes of a binary tree at a certain level

Programming Interview 9: Print all nodes of a binary tree at a certain level

Programming Interview 8: Verify if a binary tree is a Binary Search Tree (BST)

Programming Interview 8: Verify if a binary tree is a Binary Search Tree (BST)

Programming Interview 7: Find the 1st index of a given number in a sorted array allowing duplicates

Programming Interview 7: Find the 1st index of a given number in a sorted array allowing duplicates

Programming Interview 6: String Permutation

Programming Interview 6: String Permutation

Programming Interview 5: Convert a double number to rational

Programming Interview 5: Convert a double number to rational

Programming Interview 4: Print all valid combinations of groups of parenthesis

Programming Interview 4: Print all valid combinations of groups of parenthesis

Programming Interview 3: Count Occurance of a given number in sorted array

Programming Interview 3: Count Occurance of a given number in sorted array

Programming Interview 2: Get Square Root of a given number

Programming Interview 2: Get Square Root of a given number

Programming Interview 1: Reverse a Linked List

Programming Interview 1: Reverse a Linked List