Media.net Interview Questions — 39 DSA Problems

36 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Media.net LeetCode questions for software engineering interviews.

• Minimum Operations to Form Subsequence With Target Sum (HARD) — Array, Greedy, Bit Manipulation
• Count the Number of Square-Free Subsets (MEDIUM) — Array, Math, Dynamic Programming, Bit Manipulation, Bitmask
• Scramble String (HARD) — String, Dynamic Programming
• Maximum Genetic Difference Query (HARD) — Array, Hash Table, Bit Manipulation, Depth-First Search, Trie
• Furthest Building You Can Reach (MEDIUM) — Array, Greedy, Heap (Priority Queue)
• Minimum Total Space Wasted With K Resizing Operations (MEDIUM) — Array, Dynamic Programming
• Make the XOR of All Segments Equal to Zero (HARD) — Array, Dynamic Programming, Bit Manipulation
• Minimum Time Visiting All Points (EASY) — Array, Math, Geometry
• Minimum XOR Sum of Two Arrays (HARD) — Array, Dynamic Programming, Bit Manipulation, Bitmask
• Minimum Cost to Buy Apples (MEDIUM) — Array, Graph, Heap (Priority Queue), Shortest Path
• Queens That Can Attack the King (MEDIUM) — Array, Matrix, Simulation
• Maximum XOR of Two Non-Overlapping Subtrees (HARD) — Tree, Depth-First Search, Graph, Trie
• Difference Between Maximum and Minimum Price Sum (HARD) — Array, Dynamic Programming, Tree, Depth-First Search
• Sum of Remoteness of All Cells (MEDIUM) — Array, Hash Table, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Maximum Value of an Ordered Triplet II (MEDIUM) — Array
• Maximum Value of an Ordered Triplet I (EASY) — Array
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Flatten Binary Tree to Linked List (MEDIUM) — Linked List, Stack, Tree, Depth-First Search, Binary Tree
• Substring with Concatenation of All Words (HARD) — Hash Table, String, Sliding Window
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Painting the Walls (HARD) — Array, Dynamic Programming
• Fizz Buzz (EASY) — Math, String, Simulation
• Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Number of Submatrices That Sum to Target (HARD) — Array, Hash Table, Matrix, Prefix Sum
• Binary Search Tree Iterator (MEDIUM) — Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator
• Valid Phone Numbers (EASY) — Shell
• The Number of Good Subsets (HARD) — Array, Math, Dynamic Programming, Bit Manipulation, Bitmask
• Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
• Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
• All O`one Data Structure (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Merge Intervals (MEDIUM) — Array, Sorting
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Sum of Distances in Tree (HARD) — Dynamic Programming, Tree, Depth-First Search, Graph
• Majority Element (EASY) — Array, Hash Table, Divide and Conquer, Sorting, Counting
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Minimize the Maximum Difference of Pairs (MEDIUM) — Array, Binary Search, Dynamic Programming, Greedy, Sorting