Browser tab content: Problem List
0
Debugging...
Run
Submit
00:00:00
Description
Editorial
Editorial
Solutions
Solutions
Submissions
Submissions
Code
Note
Note
Testcase
Testcase
Test Result
311. Sparse Matrix Multiplication
Medium
Topics
Companies

Given two sparse matrices mat1 of size m x k and mat2 of size k x n, return the result of mat1 x mat2. You may assume that multiplication is always possible.

 

Example 1:

Input: mat1 = [[1,0,0],[-1,0,3]], mat2 = [[7,0,0],[0,0,0],[0,0,1]]
Output: [[7,0,0],[-7,0,3]]


Example 2:

Input: mat1 = [[0]], mat2 = [[0]]
Output: [[0]]


 

Constraints:

m == mat1.length
k == mat1[i].length == mat2.length
n == mat2[i].length
1 <= m, n, k <= 100
-100 <= mat1[i][j], mat2[i][j] <= 100
Seen this question in a real interview before?
1/5
Yes
No
Accepted
197.1K
Submissions
288.3K
Acceptance Rate
68.4%
Topics
Array
Hash Table
Matrix
Companies
0 - 6 months
LinkedIn
3
Meta
2
Bloomberg
2
6 months ago
Pinterest
6
Apple
2
Cruise
2
Discussion (7)
Choose a type
Preview
Comment
💡 Discussion Rules

1. Please don't post any solutions in this discussion.

2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions.

3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there.

Sort by:Best
No comments yet.
1
Copyright ©️ 2024 LeetCode All rights reserved
1.1K
7
Java
Auto
1
2
3
4
5
class Solution {
    public int[][] multiply(int[][] mat1, int[][] mat2) {
        
    }
}
Saved
Ln 1, Col 1
You must run your code first

Counting Bits - LeetCode

Problem List
Tag
237. Delete Node in a Linked List

Med.

238. Product of Array Except Self

Med.

239. Sliding Window Maximum

Hard

240. Search a 2D Matrix II

Med.

241. Different Ways to Add Parentheses

Med.

242. Valid Anagram

Easy

243. Shortest Word Distance

Easy

244. Shortest Word Distance II

Med.

245. Shortest Word Distance III

Med.

246. Strobogrammatic Number

Easy

247. Strobogrammatic Number II

Med.

248. Strobogrammatic Number III

Hard

249. Group Shifted Strings

Med.

250. Count Univalue Subtrees

Med.

251. Flatten 2D Vector

Med.

252. Meeting Rooms

Easy

253. Meeting Rooms II

Med.

254. Factor Combinations

Med.

255. Verify Preorder Sequence in Binary Search Tree

Med.

256. Paint House

Med.

257. Binary Tree Paths

Easy

258. Add Digits

Easy

259. 3Sum Smaller

Med.

260. Single Number III

Med.

261. Graph Valid Tree

Med.

262. Trips and Users

Hard

263. Ugly Number

Easy

264. Ugly Number II

Med.

265. Paint House II

Hard

266. Palindrome Permutation

Easy

267. Palindrome Permutation II

Med.

268. Missing Number

Easy

269. Alien Dictionary

Hard

270. Closest Binary Search Tree Value

Easy

271. Encode and Decode Strings

Med.

272. Closest Binary Search Tree Value II

Hard

273. Integer to English Words

Hard

274. H-Index

Med.

275. H-Index II

Med.

276. Paint Fence

Med.

277. Find the Celebrity

Med.

278. First Bad Version

Easy

279. Perfect Squares

Med.

280. Wiggle Sort

Med.

281. Zigzag Iterator

Med.

282. Expression Add Operators

Hard

283. Move Zeroes

Easy

284. Peeking Iterator

Med.

285. Inorder Successor in BST

Med.

286. Walls and Gates

Med.

287. Find the Duplicate Number

Med.

288. Unique Word Abbreviation

Med.

289. Game of Life

Med.

290. Word Pattern

Easy

291. Word Pattern II

Med.

292. Nim Game

Easy

293. Flip Game

Easy

294. Flip Game II

Med.

295. Find Median from Data Stream

Hard

296. Best Meeting Point

Hard

297. Serialize and Deserialize Binary Tree

Hard

298. Binary Tree Longest Consecutive Sequence

Med.

299. Bulls and Cows

Med.

300. Longest Increasing Subsequence

Med.

301. Remove Invalid Parentheses

Hard

302. Smallest Rectangle Enclosing Black Pixels

Hard

303. Range Sum Query - Immutable

Easy

304. Range Sum Query 2D - Immutable

Med.

305. Number of Islands II

Hard

306. Additive Number

Med.

307. Range Sum Query - Mutable

Med.

308. Range Sum Query 2D - Mutable

Hard

309. Best Time to Buy and Sell Stock with Cooldown

Med.

310. Minimum Height Trees

Med.

311. Sparse Matrix Multiplication

Med.

312. Burst Balloons

Hard

313. Super Ugly Number

Med.

314. Binary Tree Vertical Order Traversal

Med.

315. Count of Smaller Numbers After Self

Hard

316. Remove Duplicate Letters

Med.

317. Shortest Distance from All Buildings

Hard

318. Maximum Product of Word Lengths

Med.

319. Bulb Switcher

Med.

320. Generalized Abbreviation

Med.

321. Create Maximum Number

Hard

322. Coin Change

Med.

323. Number of Connected Components in an Undirected Graph

Med.

324. Wiggle Sort II

Med.

325. Maximum Size Subarray Sum Equals k

Med.

326. Power of Three

Easy

327. Count of Range Sum

Hard

328. Odd Even Linked List

Med.

329. Longest Increasing Path in a Matrix

Hard

330. Patching Array

Hard

331. Verify Preorder Serialization of a Binary Tree

Med.

332. Reconstruct Itinerary

Hard

333. Largest BST Subtree

Med.

334. Increasing Triplet Subsequence

Med.

335. Self Crossing

Hard

336. Palindrome Pairs

Hard

337. House Robber III

Med.

338. Counting Bits

Easy

339. Nested List Weight Sum

Med.

340. Longest Substring with At Most K Distinct Characters

Med.

341. Flatten Nested List Iterator

Med.

342. Power of Four

Easy

343. Integer Break

Med.

344. Reverse String

Easy

345. Reverse Vowels of a String

Easy

346. Moving Average from Data Stream

Easy

347. Top K Frequent Elements

Med.

348. Design Tic-Tac-Toe

Med.

349. Intersection of Two Arrays

Easy

350. Intersection of Two Arrays II

Easy

351. Android Unlock Patterns

Med.

352. Data Stream as Disjoint Intervals

Hard

353. Design Snake Game

Med.

354. Russian Doll Envelopes

Hard

355. Design Twitter

Med.

356. Line Reflection

Med.

357. Count Numbers with Unique Digits

Med.

358. Rearrange String k Distance Apart

Hard

359. Logger Rate Limiter

Easy

360. Sort Transformed Array

Med.

361. Bomb Enemy

Med.

362. Design Hit Counter

Med.

363. Max Sum of Rectangle No Larger Than K

Hard

364. Nested List Weight Sum II

Med.

365. Water and Jug Problem

Med.

366. Find Leaves of Binary Tree

Med.

367. Valid Perfect Square

Easy

368. Largest Divisible Subset

Med.

369. Plus One Linked List

Med.

370. Range Addition

Med.

371. Sum of Two Integers

Med.

372. Super Pow

Med.

373. Find K Pairs with Smallest Sums

Med.

374. Guess Number Higher or Lower

Easy

375. Guess Number Higher or Lower II

Med.

376. Wiggle Subsequence

Med.

377. Combination Sum IV

Med.

378. Kth Smallest Element in a Sorted Matrix

Med.

379. Design Phone Directory

Med.

380. Insert Delete GetRandom O(1)

Med.

381. Insert Delete GetRandom O(1) - Duplicates allowed

Hard

382. Linked List Random Node

Med.

383. Ransom Note

Easy

384. Shuffle an Array

Med.

385. Mini Parser

Med.

386. Lexicographical Numbers

Med.

Remove distracting text, extract the programming question, provide simple, common, and optimized Java solution for it.