Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Home

DSA Problems & Solutions | Practice Data Structures & Algorithms | Talentd

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

Jobs

Learning

Career Tools

Talentd#1 Freshers Platform

DSA Corner

Dashboard Questions Topics Companies Sheets

Data Structures & Algorithms

Practice 3,374+ coding problems from top companies. Master DSA concepts and ace your interviews.

3,374

Problems

840

Easy

1762

Medium

772

Hard

Difficulty

All3374 Easy840 Medium1762 Hard772

Status	Title	Video	Leetcode	Solve	Difficulty	Companies	Topics
	3313. Find the Last Marked Nodes in Tree			Solve	Hard	-	Depth-First Search Tree
	3317. Find the Number of Possible Ways for an Event			Solve	Hard	-	Combinatorics Dynamic Programming+1
	3320. Count The Number of Winning Sequences			Solve	Hard	-	Dynamic Programming String
	3321. Find X-Sum of All K-Long Subarrays II			Solve	Hard	-	Array Hash Table+2
	3327. Check if DFS Strings Are Palindromes			Solve	Hard	-	Array Depth-First Search+4
	3329. Count Substrings With K-Frequency Characters II			Solve	Hard	-	Hash Table Sliding Window+1
	3333. Find the Original Typed String II			Solve	Hard	-	Dynamic Programming Prefix Sum+1
	3336. Find the Number of Subsequences With Equal GCD			Solve	Hard	-	Array Dynamic Programming+2
	3337. Total Characters in String After Transformations II			Solve	Hard	-	Counting Dynamic Programming+3
	3343. Count Number of Balanced Permutations			Solve	Hard	-	Combinatorics Dynamic Programming+2
	3347. Maximum Frequency of an Element After Performing Operations II			Solve	Hard	-	Array Binary Search+3
	3348. Smallest Divisible Digit Product II			Solve	Hard	-	Backtracking Greedy+3
	3351. Sum of Good Subsequences			Solve	Hard	-	Array Dynamic Programming+1
	3352. Count K-Reducible Numbers Less Than N			Solve	Hard	-	Combinatorics Dynamic Programming+2
	3357. Minimize the Maximum Adjacent Element Difference			Solve	Hard	-	Array Binary Search+1
	3359. Find Sorted Submatrices With Maximum Element at Most K			Solve	Hard	-
	3363. Find the Maximum Number of Fruits Collected			Solve	Hard	-
	3367. Maximize Sum of Weights after Edge Removals			Solve	Hard	-
	3368. First Letter Capitalization			Solve	Hard	-
	3369. Design an Array Statistics Tracker			Solve	Hard	-	Binary Search Hash Table+1
	3373. Maximize the Number of Target Nodes After Connecting Trees II			Solve	Hard	-
	3374. First Letter Capitalization II			Solve	Hard	-

Find the Last Marked Nodes in Tree

Hard📹 Video

Depth-First Search Tree

Find the Number of Possible Ways for an Event

Hard📹 Video

Combinatorics Dynamic Programming Math

Count The Number of Winning Sequences

Hard📹 Video

Dynamic Programming String

Find X-Sum of All K-Long Subarrays II

Hard📹 Video

Array Hash Table Heap (Priority Queue)+1

Check if DFS Strings Are Palindromes

Hard📹 Video

Array Depth-First Search Hash Function+3

Count Substrings With K-Frequency Characters II

Hard📹 Video

Hash Table Sliding Window String

Find the Original Typed String II

Hard📹 Video

Dynamic Programming Prefix Sum String

Find the Number of Subsequences With Equal GCD

Hard📹 Video

Array Dynamic Programming Math+1

Total Characters in String After Transformations II

Hard📹 Video

Counting Dynamic Programming Hash Table+2

Count Number of Balanced Permutations

Hard📹 Video

Combinatorics Dynamic Programming Math+1

Maximum Frequency of an Element After Performing Operations II

Hard📹 Video

Array Binary Search Prefix Sum+2

Smallest Divisible Digit Product II

Hard📹 Video

Backtracking Greedy Math+2

Sum of Good Subsequences

Hard📹 Video

Array Dynamic Programming Hash Table

Count K-Reducible Numbers Less Than N

Hard📹 Video

Combinatorics Dynamic Programming Math+1

Minimize the Maximum Adjacent Element Difference

Hard📹 Video

Array Binary Search Greedy

Find Sorted Submatrices With Maximum Element at Most K

Hard📹 Video

Find the Maximum Number of Fruits Collected

Hard📹 Video

Maximize Sum of Weights after Edge Removals

Hard📹 Video

First Letter Capitalization

Hard📹 Video

Design an Array Statistics Tracker

Hard📹 Video

Binary Search Hash Table Queue

Maximize the Number of Target Nodes After Connecting Trees II

Hard📹 Video

First Letter Capitalization II

Hard📹 Video