Barclays Interview Questions — 18 DSA Problems

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

Most frequently asked Barclays LeetCode questions for software engineering interviews.

• Mark Elements on Array by Performing Queries (MEDIUM) — Array, Hash Table, Sorting, Heap (Priority Queue), Simulation
• Furthest Point From Origin (EASY) — String, Counting
• Count Submatrices with Top-Left Element and Sum Less Than k (MEDIUM) — Array, Matrix, Prefix Sum
• Double Modular Exponentiation (MEDIUM) — Array, Math, Simulation
• Lexicographically Smallest Generated String (HARD) — String, Greedy, String Matching
• Maximum Employees to Be Invited to a Meeting (HARD) — Depth-First Search, Graph, Topological Sort
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Valid Parentheses (EASY) — String, Stack
• Two Sum (EASY) — Array, Hash Table
• Minimum Number of Refueling Stops (HARD) — Array, Dynamic Programming, Greedy, Heap (Priority Queue)
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Isomorphic Strings (EASY) — Hash Table, String
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Palindrome Linked List (EASY) — Linked List, Two Pointers, Stack, Recursion
• Lexicographical Numbers (MEDIUM) — Depth-First Search, Trie
• Permutations (MEDIUM) — Array, Backtracking
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization