وب سایت تخصصی شرکت فرین
دسته بندی دوره ها

Mastering Leetcode In C++ – Top 100 Most Asked Problems

سرفصل های دوره

Mastering Leetcode In C++ - Step By Step


1. Arrays and Its Techniques
  • 1.1 maximum sum subarray.zip
  • 1. Practice Problem 1 - Maximum Sum Subarray
  • 2.1 best time to buy and sell a stock.zip
  • 2. Practice Problem 2 - Best Time To Buy And Sell Stock
  • 3.1 majority element.zip
  • 3. Practice Problem 3 - Majority Element
  • 4.1 move zeroes.zip
  • 4. Practice Problem 4 - Move Zeroes
  • 5.1 two sum ii - input array is sorted.zip
  • 5. Practice Problem 5 - Two Sum II Input Array Is Sorted
  • 6.1 trapping rain water.zip
  • 6. Practice Problem 6 - Trapping Rain Water
  • 7.1 sort colors.zip
  • 7. Practice Problem 7 - Sort Colors
  • 8.1 maximum product subarray.zip
  • 8. Practice Problem 8 - Maximum Product Subarray
  • 9.1 product of array except self.zip
  • 9. Practice Problem 9 - Product Of Array Except Self
  • 10.1 sliding window maximum.zip
  • 10. Practice Problem 10 - Sliding Window Maximum
  • 11.1 rotate array.zip
  • 11. Practice Problem 11 - Rotate Array
  • 12.1 max consecutive ones.zip
  • 12. Practice Problem 12 - Max Consecutive Ones
  • 13.1 set matrix zeroes.zip
  • 13. Practice Problem 13 - Set Matrix Zeroes
  • 14.1 container with most water.zip
  • 14. Practice Problem 14 - Container With Most Water
  • 15.1 spiral matrix.zip
  • 15. Practice Problem 15 - Spiral Matrix
  • 16.1 valid sudoku.zip
  • 16. Practice Problem 16 - Valid Sudoku

  • 2. Recursion And Backtracking
  • 1.1 combination sum.zip
  • 1. Practice Problem 1 - Combination Sum
  • 2.1 subsets.zip
  • 2. Practice Problem 2 - Subsets
  • 3.1 n queens.zip
  • 3. Practice Problem 3 - N Queens

  • 3. Binary Search
  • 1.1 search insert position.zip
  • 1. Practice Problem 1 - Search Insert Position
  • 2.1 find first and last position of element in sorted array.zip
  • 2. Practice Problem 2 - Find First And Last Position Of Element In Sorted Array
  • 3.1 search in a rotated sorted array.zip
  • 3. Practice Problem 3 - Search In A Rotated Sorted Array
  • 4.1 koko eating bananas.zip
  • 4. Practice Problem 4 - Koko Eating Bananas
  • 5.1 magnetic force between two balls.zip
  • 5. Practice Problem 5 - Magnetic Force Between Two Balls
  • 6.1 find min in a rotated sorted array.zip
  • 6. Practice Problem 6 - Find Minimum In Rotated Sorted Array

  • 4. Binary Search Tree
  • 1.1 kth smallest element in bst.zip
  • 1. Practice Problem 1 - Kth Smallest Element In BST
  • 2.1 validate binary search tree.zip
  • 2. Practice Problem 2 - Validate Binary Search Tree
  • 3.1 lowest common ancestor of a binary search tree.zip
  • 3. Practice Problem 3 - Lowest Common Ancestor Of A Binary Search Tree

  • 5. Binary Trees
  • 1.1 binary tree inorder traversal.zip
  • 1. Practice Problem 1 - Binary Tree InOrder Traversal
  • 2.1 symmetric tree.zip
  • 2. Practice Problem 2 - Symmetric Tree
  • 3.1 maximum depth of a binary tree.zip
  • 3. Practice Problem 3 - Maximum Depth Of Binary Tree
  • 4.1 invert binary tree.zip
  • 4. Practice Problem 4 - Invert Binary Tree
  • 5.1 diameter of a binary tree.zip
  • 5. Practice Problem 5 - Diameter Of A Binary Tree
  • 6.1 binary tree level order traversal.zip
  • 6. Practice Problem 6 - Binary Tree Level Order Traversal
  • 7.1 path sum.zip
  • 7. Practice Problem 7 - Path Sum
  • 8.1 path sum ii.zip
  • 8. Practice Problem 8 - Path Sum II
  • 9.1 cousins in binary tree.zip
  • 9. Practice Problem 9 - Cousins In Binary Tree
  • 10.1 maximum level sum of a binary tree.zip
  • 10. Practice Problem 10 - Maximum Level Sum Of Binary Tree
  • 11.1 same tree.zip
  • 11. Practice Problem 11 - Same Tree
  • 12.1 construct binary tree from preorder and inorder traversal.zip
  • 12. Practice Problem 12 - Construct Binary Tree From PreOrder And InOrder Traversal
  • 13.1 subtree of another tree.zip
  • 13. Practice Problem 13 - Subtree Of Another Tree
  • 14.1 balanced binary tree.zip
  • 14. Practice Problem 14 - Balanced Binary Tree
  • 15.1 binary tree right side view.zip
  • 15. Practice Problem 15 - Binary Tree Right Side View
  • 16.1 count good nodes in binary tree.zip
  • 16. Practice Problem 16 - Count Good Nodes In Binary Tree
  • 17.1 sum of left leaves.zip
  • 17. Practice Problem 17 - Sum Of Left Leaves

  • 6. Bit Manipulation
  • 1.1 single number.zip
  • 1. Practice Problem 1 - Single Number
  • 2.1 counting bits.zip
  • 2. Practice Problem 2 - Counting Bits
  • 3.1 find the duplicate number.zip
  • 3. Practice Problem 3 - Find The Duplicate Number
  • 4.1 divide two integers.zip
  • 4. Practice Problem 4 - Divide Two Integers
  • 5.1 missing number.zip
  • 5. Practice Problem 5 - Missing Number
  • 6.1 number of 1 bits.zip
  • 6. Practice Problem 6 - Number Of 1 Bits
  • 7.1 sum of two integers.zip
  • 7. Practice Problem 7 - Sum Of Two Integers
  • 8.1 reverse integer.zip
  • 8. Practice Problem 8 - Reverse Integer

  • 7. Dynamic Programming
  • 1.1 climbing stairs.zip
  • 1. Practice Problem 1 - Climbing Stairs
  • 2.1 jump game.zip
  • 2. Practice Problem 2 - Jump Game
  • 3.1 coin change.zip
  • 3. Practice Problem 3 - Coin Change
  • 4.1 target sum.zip
  • 4. Practice Problem 4 - Target Sum
  • 5.1 longest common subsequence.zip
  • 5. Practice Problem 5 - Longest Common Subequence
  • 6.1 house robber.zip
  • 6. Practice Problem 6 - House Robber
  • 7.1 longest increasing subsequence.zip
  • 7. Practice Problem 7 - Longest Increasing Subsequence
  • 8.1 partition equal subset sum.zip
  • 8. Practice Problem 8 - Partition Equal Subset Sum
  • 9.1 01 matrix.zip
  • 9. Practice Problem 9 0-1 Matrix
  • 10.1 integer replacement.zip
  • 10. Practice Problem 10 - Integer Replacement
  • 11. Practice Problem 11 - Edit Distance
  • 12.1 decode ways.zip
  • 12. Practice Problem 12 - Decode Ways
  • 13.1 house robber ii.zip
  • 13. Practice Problem 13 - House Robber II
  • 14.1 min cost climbing stairs.zip
  • 14. Practice Problem 14 - Min Cost Climbing Stairs
  • 15.1 longest palindromic substring.zip
  • 15. Practice Problem 15 - Longest Palindromic Substring

  • 8. Graphs
  • 1.1 course schedule.zip
  • 1. Practice Problem 1 - Course Schedule
  • 2.1 no. of islands.zip
  • 2. Practice Problem 2 - Number Of Islands
  • 3.1 find the town judge.zip
  • 3. Practice Problem 3 - Find The Town Judge
  • 4.1 surrounded region.zip
  • 4. Practice Problem 4 - Surrounded Regions
  • 5.1 no. of enclaves.zip
  • 5. Practice Problem 5 - Number Of Enclaves
  • 6.1 network delay time.zip
  • 6. Practice Problem 6 - Network Delay Time
  • 7.1 flood fill.zip
  • 7. Practice Problem 7 - Flood Fill

  • 9. Hash Table
  • 1.1 two sum.zip
  • 1. Practice Problem 1 - Two Sum
  • 2.1 three sum.zip
  • 2. Practice Problem 2 - Three Sum
  • 3. Practice Problem 3 - Longest Consecutive Sequence
  • 4.1 contains duplicate.zip
  • 4. Practice Problem 4 - Contains Duplicate
  • 5.1 valid anagram.zip
  • 5. Practice Problem 5 - Valid Anagram

  • 10. Heaps
  • 1.1 kth largest element in an array.zip
  • 1. Practice Problem 1 - Kth Largest Element In An Array
  • 2.1 find median from data stream.zip
  • 2. Practice Problem 2 - Find Median From Data Stream
  • 3.1 kth largest element in a stream.zip
  • 3. Practice Problem 3 - Kth Largest Element In A Stream

  • 11. Linked Lists
  • 1.1 intersection of two linked list.zip
  • 1. Practice Problem 1 - Intersection Of Two Linked Lists
  • 2.1 merge two sorted list.zip
  • 2. Practice Problem 2 - Merge Two Sorted Lists
  • 3.1 linked list cycle.zip
  • 3. Practice Problem 3 Linked List Cycle
  • 4.1 reversed linked list.zip
  • 4. Practice Problem 4 - Reverse Linked List
  • 5.1 palindrome linked list.zip
  • 5. Practice Problem 5 - Palindrome Linked List
  • 6.1 linked list cycle ii.zip
  • 6. Practice Problem 6 - Linked List Cycle II
  • 7.1 find middle of the linked list.zip
  • 7. Practice Problem 7 - Find Middle Of The Linked List
  • 8.1 remove nth node from end of list.zip
  • 8. Practice Problem 8 - Remove Nth Node From End Of List
  • 9.1 add two numbers.zip
  • 9. Practice Problem 9 - Add Two Numbers

  • 12. Stacks
  • 1.1 valid paranthesis.zip
  • 1. Practice Problem 1 - Valid Paranthesis
  • 2.1 min stack.zip
  • 2. Practice Problem 2 - Min Stack
  • 3.1 merge intervals.zip
  • 3. Practice Problem 3 - Merge Intervals
  • 4.1 next greater element ii.zip
  • 4. Practice Problem 4 - Next Greater Element II
  • 5.1 evaluate reverse polish notation.zip
  • 5. Practice Problem 5 - Evaluate Reverse Polish Notation

  • 13. Strings
  • 1. Practice Problem 1 - Minimum Add To Make Paranthesis Valid
  • 2.1 group anagrams.zip
  • 2. Practice Problem 2 - Group Anagrams
  • 3. Practice Problem 3 - Longest Substring Without Repeating Characters
  • 139,000 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    خرید دانلودی فوری

    در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 18352
    حجم: 11071 مگابایت
    مدت زمان: 927 دقیقه
    تاریخ انتشار: 3 شهریور 1402
    طراحی سایت و خدمات سئو

    139,000 تومان
    افزودن به سبد خرید