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

Microsoft Interview Questions – Data Structures & Algorithms

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

Learn top questions asked in Microsoft coding rounds


1. Maximum Sum Subarray - Arrays
  • 1. Maximum Sum Subarray - Java Solution
  • 2. Maximum Sum Subarray - Javascript Solution
  • 3. Maximum Sum Subarray - C++ Solution
  • 4. Maximum Sum Subarray - Python Solution

  • 2. Counting Bits - Arrays
  • 1. Counting Bits - Java Solution
  • 2. Counting Bits - Javascript Solution
  • 3. Counting Bits - C++ Solution
  • 4. Counting Bits - Python Solution

  • 3. Flood Fill - Graphs
  • 1. Flood Fill - Java Solution
  • 2. Flood Fill - Javascript Solution
  • 3. Flood Fill - C++ Solution
  • 4. Flood Fill - Python Solution

  • 4. Product Of Array Except Self - Arrays
  • 1. Product Of Array Except Self - Java Solution
  • 2. Product Of Array Except Self - Javascript Solution
  • 3. Product Of Array Except Self - C++ Solution
  • 4. Product Of Array Except Self - Python Solution

  • 5. House Robber - Arrays
  • 1. House Robber - Java Solution
  • 2. House Robber - Javascript Solution
  • 3. House Robber - C++ Solution
  • 4. House Robber - Python Solution

  • 6. Trapping Rain Water - Arrays
  • 1. Trapping Rain Water - Java Solution
  • 2. Trapping Rain Water - Javascript Solution
  • 3. Trapping Rain Water - C++ Solution
  • 4. Trapping Rain Water - Python Solution

  • 7. Search Insert Position - Sorting
  • 1. Search Insert Position - Java Solution
  • 2. Search Insert Position - Javascript Solution
  • 3. Search Insert Position - C++ Solution
  • 4. Search Insert Position - Python Solution

  • 8. Sort Colors - Sorting
  • 1. Sort Colors - Java Solution
  • 2. Sort Colors - Javascript Solution
  • 3. Sort Colors - C++ Solution
  • 4. Sort Colors - Python Solution

  • 9. Group Anagrams - Sorting
  • 1. Group Anagrams - Java Solution
  • 2. Group Anagrams - Javascript Solution
  • 3. Group Anagrams - C++ Solution
  • 4. Group Anagrams - Python Solution

  • 10. Find the Duplicate Number - Sorting
  • 1. Find the Duplicate Number - Java Solution
  • 2. Find the Duplicate Number - Javascript Solution
  • 3. Find the Duplicate Number - C++ Solution
  • 4. Find the Duplicate Number - Python Solution

  • 11. Linked List Cycle - Linked List
  • 1. Linked List Cycle - Java Solution
  • 2. Linked List Cycle - Javascript Solution
  • 3. Linked List Cycle - C++ Solution
  • 4. Linked List Cycle - Python Solution

  • 12. Intersection Of Two Linked Lists - Linked List
  • 1. Intersection Of Two Linked Lists - Java Solution
  • 2. Intersection Of Two Linked Lists - Javascript Solution
  • 3. Intersection Of Two Linked Lists - C++ Solution
  • 4. Intersection Of Two Linked Lists - Python Solution

  • 13. Add Two Numbers - Linked List
  • 1. Add Two Numbers - Java Solution
  • 2. Add Two Numbers - Javascript Solution
  • 3. Add Two Numbers - C++ Solution
  • 4. Add Two Numbers - Python Solution

  • 14. Valid Paranthesis - Stacks
  • 1. Valid Paranthesis - Java Solution
  • 2. Valid Paranthesis - Javascript Solution
  • 3. Valid Paranthesis - C++ Solution
  • 4. Valid Paranthesis - Python Solution

  • 15. Merge Intervals - Stacks
  • 1. Merge Intervals - Java Solution
  • 2. Merge Intervals - Javascript Solution
  • 3. Merge Intervals - C++ Solution
  • 4. Merge Intervals - Python Solution

  • 16. Two Sum - Hash Table
  • 1. Two Sum - Java Solution
  • 2. Two Sum - Javascript Solution
  • 3. Two Sum - C++ Solution
  • 4. Two Sum - Python Solution

  • 17. Three Sum - Hash Table
  • 1. Three Sum - Java Solution
  • 2. Three Sum - Javascript Solution
  • 3. Three Sum - C++ Solution
  • 4. Three Sum - Python Solution

  • 18. Binary Tree InOrder Traversal - Binary Trees
  • 1. Binary Tree InOrder Traversal - Java Solution
  • 2. Binary Tree InOrder Traversal - Javascript Solution
  • 3. Binary Tree InOrder Traversal - C++ Solution
  • 4. Binary Tree InOrder Traversal - Python Solution

  • 19. Symmetric Tree - Binary Trees
  • 1. Symmetric Tree - Java Solution
  • 2. Symmetric Tree - Javascript Solution
  • 3. Symmetric Tree - C++ Solution
  • 4. Symmetric Tree - Python Solution

  • 20. Invert Binary Tree - Binary Trees
  • 1. Invert Binary Tree - Java Solution
  • 2. Invert Binary Tree - Javascript Solution
  • 3. Invert Binary Tree - C++ Solution
  • 4. Invert Binary Tree - Python Solution

  • 21. Diameter Of A Binary Tree - Binary Trees
  • 1. Diameter Of A Binary Tree - Java Solution
  • 2. Diameter Of A Binary Tree - Javascript Solution
  • 3. Diameter Of A Binary Tree - C++ Solution
  • 4. Diameter Of A Binary Tree - Python Solution

  • 22. Binary Tree Level Order Traversal - Binary Trees
  • 1. Binary Tree Level Order Traversal - Java Solution
  • 2. Binary Tree Level Order Traversal - Javascript Solution
  • 3. Binary Tree Level Order Traversal - C++ Solution
  • 4. Binary Tree Level Order Traversal - Python Solution

  • 23. Path Sum - Binary Trees
  • 1. Path Sum - Java Solution
  • 2. Path Sum - Javascript Solution
  • 3. Path Sum - C++ Solution
  • 4. Path Sum - Python Solution

  • 24. Kth Largest Element In An Array - Heaps
  • 1. Kth Largest Element In An Array - Java Solution
  • 2. Kth Largest Element In An Array - Javascipt Solution
  • 3. Kth Largest Element In An Array - C++ Solution
  • 4. Kth Largest Element In An Array - Python Solution

  • 25. Find Median from Data Stream - Heaps
  • 1. Find Median from Data Stream - Java Solution
  • 2. Find Median from Data Stream - Javascript Solution
  • 3. Find Median from Data Stream - C++ Solution
  • 4. Find Median from Data Stream - Python Solution

  • 26. Kth Smallest Element In BST - Binary Search Tree
  • 1. Kth Smallest Element In BST - Java Solution
  • 2. Kth Smallest Element In BST - Javascript Solution
  • 3. Kth Smallest Element In BST - C++ Solution
  • 4. Kth Smallest Element In BST - Python Solution

  • 27. Climbing Stairs - Dynamic Programming
  • 1. Climbing Stairs - Java Solution
  • 2. Climbing Stairs - Javascript Solution
  • 3. Climbing Stairs - C++ Solution
  • 4. Climbing Stairs - Python Solution

  • 28. Coin Change - Dynamic Programming
  • 1. Coin Change - Java Solution
  • 2. Coin Change - Javascript Solution
  • 3. Coin Change - C++ Solution
  • 4. Coin Change - Python Solution

  • 29. Longest Increasing Subsequence - Dynamic Programming
  • 1. Longest Increasing Subsequence - Java Solution
  • 2. Longest Increasing Subsequence - Javascript Solution
  • 3. Longest Increasing Subsequence - C++ Solution
  • 4. Longest Increasing Subsequence - Python Solution

  • 30. Course Schedule - Graphs
  • 1. Course Schedule - Java Solution
  • 2. Course Schedule - Javascript Solution
  • 3. Course Schedule - C++ Solution
  • 4. Course Schedule - Python Solution

  • 31. Number Of Islands - Graph Traversal
  • 1. Number Of Islands - Java Solution
  • 2. Number Of Islands - Javascript Solution
  • 3. Number Of Islands - C++ Solution
  • 4. Number Of Islands - Python Solution

  • 32. 0-1 Matrix - Graph Traversal
  • 1. 0-1 Matrix - Java Solution
  • 2. 0-1 Matrix - Javascript Solution
  • 3. 0-1 Matrix - C++ Solution
  • 4. 0-1 Matrix - Python Solution

  • 33. Combination Sum - Backtracking
  • 1. Combination Sum - Java Solution
  • 2. Combination Sum - Javascript Solution
  • 3. Combination Sum - C++ Solution
  • 4. Combination Sum - Python Solution

  • 34. Subsets - Backtracking
  • 1. Subsets - Java Solution
  • 2. Subsets - Javascript Solution
  • 3. Subsets - C++ Solution
  • 4. Subsets - Python Solution
  • 53,700 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    خرید دانلودی فوری

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

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 24184
    حجم: 19452 مگابایت
    مدت زمان: 1507 دقیقه
    تاریخ انتشار: 12 آذر 1402
    دسته بندی محصول
    طراحی سایت و خدمات سئو

    53,700 تومان
    افزودن به سبد خرید