Zig-Zag World of Algorithm and Data Structures
Home
(Move to ...)
Home
Basic Data Structures
Advance Data Structures
Algorithms
Exercises
Interview Questions
Puzzles
Design Questions
Conferences and Papers
About The Blog
▼
Sunday, January 25, 2026
[LeetCode] All Divisions With the Highest Score of a Binary Array
›
Problem: You are given a 0-indexed binary array nums of length n. nums can be divided at index i (where 0 <= i <= n) into two arrays ...
[LeetCode] Minimum Cost of Buying Candies With Discount
›
Problem: A shop is selling candies at a discount. For every two candies sold, the shop gives a third candy for free . The customer can cho...
[LeetCode] Array Partition
›
Problem: Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum ...
[LeetCode] Minimum Difference Between Highest and Lowest of K Scores
›
Problem: You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer...
›
Home
View web version