Sprinklr Interview Questions — 41 DSA Problems

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

Most frequently asked Sprinklr LeetCode questions for software engineering interviews.

• Minimum Edge Weight Equilibrium Queries in a Tree (HARD) — Array, Tree, Graph, Strongly Connected Component
• Apply Operations on Array to Maximize Sum of Squares (HARD) — Array, Hash Table, Greedy, Bit Manipulation
• Next Greater Numerically Balanced Number (MEDIUM) — Hash Table, Math, Backtracking, Counting, Enumeration
• Maximize Score After N Operations (HARD) — Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask
• Maximum Score of Non-overlapping Intervals (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Closest Subsequence Sum (HARD) — Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmask
• Minimum Time to Revert Word to Initial State II (HARD) — String, Rolling Hash, String Matching, Hash Function
• Choose Edges to Maximize Score in a Tree (MEDIUM) — Dynamic Programming, Tree, Depth-First Search
• Number of Same-End Substrings (MEDIUM) — Array, Hash Table, String, Counting, Prefix Sum
• Count the Number of Powerful Integers (HARD) — Math, String, Dynamic Programming
• Create Components With Same Value (HARD) — Array, Math, Tree, Depth-First Search, Enumeration
• Minimum Time to Revert Word to Initial State I (MEDIUM) — String, Rolling Hash, String Matching, Hash Function
• Apply Bitwise Operations to Make Strings Equal (MEDIUM) — String, Bit Manipulation
• Maximum Subarray Sum After One Operation (MEDIUM) — Array, Dynamic Programming
• Number of Great Partitions (HARD) — Array, Dynamic Programming
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Robot Collisions (HARD) — Array, Stack, Sorting, Simulation
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Number of Provinces (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Minimize the Difference Between Target and Chosen Elements (MEDIUM) — Array, Dynamic Programming, Matrix
• Serialize and Deserialize Binary Tree (HARD) — String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree
• Minimum Number of Food Buckets to Feed the Hamsters (MEDIUM) — String, Dynamic Programming, Greedy
• Validate IP Address (MEDIUM) — String
• Partition Labels (MEDIUM) — Hash Table, Two Pointers, String, Greedy
• Max Points on a Line (HARD) — Array, Hash Table, Math, Geometry
• Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
• Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• First Missing Positive (HARD) — Array, Hash Table
• Longest Univalue Path (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Russian Doll Envelopes (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Sum of Matrix After Queries (MEDIUM) — Array, Hash Table
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Count Valid Paths in a Tree (HARD) — Math, Dynamic Programming, Tree, Depth-First Search, Number Theory
• Longest Valid Parentheses (HARD) — String, Dynamic Programming, Stack
• Single Element in a Sorted Array (MEDIUM) — Array, Binary Search
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Sum of Subarray Minimums (MEDIUM) — Array, Dynamic Programming, Stack, Monotonic Stack