DSA Doctor
Verified Company Vault
Linkedin DSA Interview Questions
178 curated coding interview questions directly asked in Linkedin technical rounds, sorted by frequency with recency and difficulty diagnostics.
178
Total Questions
28 (16%)
Easy Problems
115 (65%)
Medium Problems
35 (20%)
Hard Problems
🔥 Most Tested Topics:
Arrays (48)Core DSA (46)Strings (32)Trees (30)Linked List (12)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 716 | Max Stack | Hard | Stack / Queue | Monotonic Stack / Simulation | 45.9% | 100.0% | 3m |
| 364 | Nested List Weight Sum II | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 67.0% | 87.5% | 3m |
| 244 | Shortest Word Distance II | Medium | Strings | Hashing / Sliding Window | 62.9% | 87.5% | 3m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | 3m |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 87.5% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 75.0% | 3m |
| 360 | Sort Transformed Array | Medium | Arrays | Sorting / Prefix / Scan | 58.2% | 75.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | 3m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 75.0% | 3m |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 75.0% | all |
| 277 | Find the Celebrity | Medium | Core DSA | Implementation / Reasoning | 49.0% | 62.5% | 3m |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 62.5% | 3m |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 62.5% | 3m |
| 605 | Can Place Flowers | Easy | Core DSA | Implementation / Reasoning | 29.1% | 62.5% | 3m |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 62.5% | 3m |
| 339 | Nested List Weight Sum | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 86.0% | 62.5% | 3m |
| 698 | Partition to K Equal Sum Subsets | Medium | Arrays; Dynamic Programming; Backtracking | Sorting / Prefix / Scan; State Transition; Backtracking | 38.6% | 62.5% | 3m |
| 272 | Closest Binary Search Tree Value II | Hard | Trees; Binary Search | DFS / BFS; Binary Search | 61.2% | 62.5% | 3m |
| 366 | Find Leaves of Binary Tree | Medium | Trees | DFS / BFS | 81.3% | 62.5% | 3m |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 62.5% | 3m |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 62.5% | 3m |
| 744 | Find Smallest Letter Greater Than Target | Easy | Strings | Hashing / Sliding Window | 59.2% | 62.5% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 3m |
| 886 | Possible Bipartition | Medium | Dynamic Programming | State Transition | 52.6% | 62.5% | 3m |
| 65 | Valid Number | Hard | Strings | Hashing / Sliding Window | 23.0% | 62.5% | 3m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | 3m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | 3m |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 62.5% | 6m |
| 319 | Bulb Switcher | Medium | Core DSA | Implementation / Reasoning | 55.9% | 62.5% | 6m |
| 636 | Exclusive Time of Functions | Medium | Core DSA | Implementation / Reasoning | 66.2% | 62.5% | 6m |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Arrays | Sorting / Prefix / Scan | 36.6% | 62.5% | 6m |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 101 | Symmetric Tree | Easy | Trees | DFS / BFS | 61.2% | 62.5% | all |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 48.8% | 62.5% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 62.5% | all |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 70.6% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |
| 243 | Shortest Word Distance | Easy | Strings | Hashing / Sliding Window | 66.3% | 62.5% | all |
| 254 | Factor Combinations | Medium | Backtracking | Backtracking | 50.5% | 62.5% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 62.5% | all |
| 2276 | Count Integers in Intervals | Hard | Arrays | Sorting / Prefix / Scan | 35.9% | 62.5% | all |
| 671 | Second Minimum Node In a Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 46.1% | 62.5% | all |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | Trees | DFS / BFS | 83.0% | 62.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 50.0% | 6m |
| 432 | All O`one Data Structure | Hard | Core DSA | Implementation / Reasoning | 44.3% | 50.0% | 6m |
| 1188 | Design Bounded Blocking Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 73.8% | 50.0% | 6m |
| 617 | Merge Two Binary Trees | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 79.1% | 50.0% | 6m |
| 256 | Paint House | Medium | Core DSA | Implementation / Reasoning | 64.4% | 50.0% | 6m |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 50.0% | 6m |
| 149 | Max Points on a Line | Hard | Core DSA | Implementation / Reasoning | 30.7% | 50.0% | 6m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 50.0% | 6m |
| 516 | Longest Palindromic Subsequence | Medium | Core DSA | Implementation / Reasoning | 65.4% | 50.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 50.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | all |
| 47 | Permutations II | Medium | Backtracking | Backtracking | 63.5% | 50.0% | all |
| 57 | Insert Interval | Medium | Arrays | Sorting / Prefix / Scan | 45.2% | 50.0% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 50.0% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 50.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 50.0% | all |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 50.0% | all |
| 150 | Evaluate Reverse Polish Notation | Medium | Core DSA | Implementation / Reasoning | 57.8% | 50.0% | all |
| 170 | Two Sum III - Data structure design | Easy | Arrays; Design | Sorting / Prefix / Scan; Two Pointers; Data Structure Design | 39.1% | 50.0% | all |
| 173 | Binary Search Tree Iterator | Medium | Trees; Binary Search; Design | DFS / BFS; Binary Search; Data Structure Design | 76.5% | 50.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 245 | Shortest Word Distance III | Medium | Strings | Hashing / Sliding Window | 59.5% | 50.0% | all |
| 2196 | Create Binary Tree From Descriptions | Medium | Trees | DFS / BFS | 81.7% | 50.0% | all |
| 261 | Graph Valid Tree | Medium | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 50.0% | 50.0% | all |
| 311 | Sparse Matrix Multiplication | Medium | Arrays | Sorting / Prefix / Scan | 69.3% | 50.0% | all |
| 341 | Flatten Nested List Iterator | Medium | Linked List; Design | Two Pointers; Data Structure Design | 65.7% | 50.0% | all |
| 367 | Valid Perfect Square | Easy | Strings | Hashing / Sliding Window | 44.9% | 50.0% | all |
| 373 | Find K Pairs with Smallest Sums | Medium | Arrays | Sorting / Prefix / Scan | 41.9% | 50.0% | all |
| 2344 | Minimum Deletions to Make Array Divisible | Hard | Arrays | Sorting / Prefix / Scan | 61.4% | 50.0% | all |
| 464 | Can I Win | Medium | Core DSA | Implementation / Reasoning | 31.4% | 50.0% | all |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | Arrays; Strings; Trees; Greedy | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Greedy | 44.7% | 50.0% | all |
| 515 | Find Largest Value in Each Tree Row | Medium | Trees | DFS / BFS | 66.3% | 50.0% | all |
| 2431 | Maximize Total Tastiness of Purchased Fruits | Medium | Core DSA | Implementation / Reasoning | 64.6% | 50.0% | all |
| 2532 | Time to Cross a Bridge | Hard | Core DSA | Implementation / Reasoning | 44.3% | 50.0% | all |
| 633 | Sum of Square Numbers | Medium | Arrays | Sorting / Prefix / Scan | 36.9% | 50.0% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 50.0% | all |
| 730 | Count Different Palindromic Subsequences | Hard | Core DSA | Implementation / Reasoning | 47.8% | 50.0% | all |
| 946 | Validate Stack Sequences | Medium | Strings; Stack / Queue | Hashing / Sliding Window; Monotonic Stack / Simulation | 70.4% | 50.0% | all |
| 1117 | Building H2O | Medium | Core DSA | Implementation / Reasoning | 58.3% | 50.0% | all |
| 1107 | New Users Daily Count | Medium | Core DSA | Implementation / Reasoning | 44.6% | 50.0% | all |
| 1127 | User Purchase Platform | Hard | Core DSA | Implementation / Reasoning | 46.3% | 50.0% | all |
| 1148 | Article Views I | Easy | Core DSA | Implementation / Reasoning | 76.6% | 50.0% | all |
| 1149 | Article Views II | Medium | Core DSA | Implementation / Reasoning | 47.3% | 50.0% | all |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | Arrays | Sorting / Prefix / Scan | 72.9% | 50.0% | all |
| 1588 | Sum of All Odd Length Subarrays | Easy | Arrays | Sorting / Prefix / Scan | 84.0% | 50.0% | all |
| 1644 | Lowest Common Ancestor of a Binary Tree II | Medium | Trees | DFS / BFS | 69.7% | 50.0% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 50.0% | all |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | Arrays | Sorting / Prefix / Scan | 64.5% | 50.0% | all |
| 156 | Binary Tree Upside Down | Medium | Trees | DFS / BFS | 65.5% | 37.5% | 6m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | 6m |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 37.5% | 6m |
| 187 | Repeated DNA Sequences | Medium | Core DSA | Implementation / Reasoning | 53.3% | 37.5% | 6m |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 37.5% | 6m |
| 296 | Best Meeting Point | Hard | Greedy | Greedy | 61.4% | 37.5% | 6m |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 37.5% | 6m |
| 489 | Robot Room Cleaner | Hard | Core DSA | Implementation / Reasoning | 78.0% | 37.5% | 6m |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | 6m |
| 100 | Same Tree | Easy | Trees | DFS / BFS | 67.1% | 37.5% | 6m |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 37.5% | 6m |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 37.5% | 6m |
| 126 | Word Ladder II | Hard | Strings | Hashing / Sliding Window | 27.7% | 37.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 37.5% | all |
| 323 | Number of Connected Components in an Undirected Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.0% | 37.5% | all |
| 384 | Shuffle an Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 37.5% | all |
| 611 | Valid Triangle Number | Medium | Strings | Hashing / Sliding Window | 56.9% | 37.5% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 37.5% | all |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 37.5% | all |
| 706 | Design HashMap | Easy | Design | Data Structure Design | 66.6% | 37.5% | all |
| 40 | Combination Sum II | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 59.5% | 37.5% | all |
| 470 | Implement Rand10() Using Rand7() | Medium | Core DSA | Implementation / Reasoning | 46.4% | 37.5% | all |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | all |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 37.5% | all |
| 785 | Is Graph Bipartite? | Medium | Graphs | BFS / DFS / Topological Sort | 59.3% | 37.5% | all |
| 265 | Paint House II | Hard | Core DSA | Implementation / Reasoning | 57.1% | 37.5% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 37.5% | all |
| 632 | Smallest Range Covering Elements from K Lists | Hard | Linked List | Two Pointers | 70.1% | 37.5% | all |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 37.5% | all |
| 3850 | Count Sequences to K | Hard | Core DSA | Implementation / Reasoning | 36.1% | 37.5% | all |
| 3891 | Minimum Increase to Maximize Special Indices | Medium | Arrays | Sorting / Prefix / Scan | 19.6% | 37.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 25.0% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 25.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 25.0% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 25.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 25.0% | all |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 25.0% | all |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 25.0% | all |
| 763 | Partition Labels | Medium | Dynamic Programming | State Transition | 81.9% | 25.0% | all |
| 973 | K Closest Points to Origin | Medium | Core DSA | Implementation / Reasoning | 69.0% | 25.0% | all |
| 1197 | Minimum Knight Moves | Medium | Arrays | Sorting / Prefix / Scan | 42.0% | 25.0% | all |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 25.0% | all |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 25.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 25.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 25.0% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 25.0% | all |
| 226 | Invert Binary Tree | Easy | Trees | DFS / BFS | 80.1% | 25.0% | all |
| 921 | Minimum Add to Make Parentheses Valid | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 74.4% | 25.0% | all |
| 742 | Closest Leaf in a Binary Tree | Medium | Trees | DFS / BFS | 47.4% | 25.0% | all |
| 1570 | Dot Product of Two Sparse Vectors | Medium | Arrays | Sorting / Prefix / Scan | 89.9% | 25.0% | all |
| 274 | H-Index | Medium | Core DSA | Implementation / Reasoning | 41.4% | 25.0% | all |
| 925 | Long Pressed Name | Easy | Core DSA | Implementation / Reasoning | 32.9% | 25.0% | all |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 25.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 25.0% | all |
| 2964 | Number of Divisible Triplet Sums | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 25.0% | all |
| 282 | Expression Add Operators | Hard | Core DSA | Implementation / Reasoning | 43.2% | 25.0% | all |
| 230 | Kth Smallest Element in a BST | Medium | Trees; Heap | DFS / BFS; Priority Queue | 76.8% | 25.0% | all |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 25.0% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 25.0% | all |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | Linked List | Two Pointers | 62.9% | 25.0% | all |
| 1857 | Largest Color Value in a Directed Graph | Hard | Graphs | BFS / DFS / Topological Sort | 57.3% | 25.0% | all |
| 337 | House Robber III | Medium | Dynamic Programming | State Transition | 55.9% | 25.0% | all |
| 1386 | Cinema Seat Allocation | Medium | Core DSA | Implementation / Reasoning | 44.6% | 25.0% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 25.0% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 25.0% | all |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 25.0% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 25.0% | all |
| 1882 | Process Tasks Using Servers | Medium | Core DSA | Implementation / Reasoning | 41.9% | 25.0% | all |
| 1473 | Paint House III | Hard | Core DSA | Implementation / Reasoning | 61.2% | 25.0% | all |
| 1048 | Longest String Chain | Medium | Strings | Hashing / Sliding Window | 63.0% | 25.0% | all |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | Arrays | Sorting / Prefix / Scan | 33.3% | 25.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 25.0% | all |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 25.0% | all |
| 1041 | Robot Bounded In Circle | Medium | Core DSA | Implementation / Reasoning | 56.5% | 25.0% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 25.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 25.0% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 25.0% | all |
| 490 | The Maze | Medium | Core DSA | Implementation / Reasoning | 60.4% | 25.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 25.0% | all |
| 1017 | Convert to Base -2 | Medium | Core DSA | Implementation / Reasoning | 61.9% | 25.0% | all |
| 701 | Insert into a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 73.5% | 25.0% | all |
| 81 | Search in Rotated Sorted Array II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 40.1% | 25.0% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 25.0% | all |