# Status Problem video Level Completes Likes
562

Merge Strings Alternately - Leetcode

Beginner % 1
522

Check If Student is eligible for an Attendance Reward

Beginner % 0
519

Random character in a given string - Java

Beginner % 0
503

Minimum Deletions to make the occurrence of each character unique.

Hard % 1
499

Compare two version numbers of a software

Medium % 1
496

Minimum number of times String A is repeated to such that B is substring of A

Beginner % 1
483

Find Lexicographically smallest or largest substring of size k

Beginner % 0
482

Largest word in dictionary by removing a few characters from the given string

Beginner % 0
480

Check if one string is a subsequence of another string.

Beginner % 0
437

Lexicographically previous permutation With One swap

Medium % 1
415

Hamming Distance between two given strings

Beginner % 0
394

Find the maximum number present in a String

Beginner % 0
390

Convert Prefix to Postfix Expression

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
386

Convert Integer to Roman

Medium % 0
385

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Medium % 0
378

Longest contiguous character in a given String - O(N) Solution

Beginner % 0
377

Convert Postfix to Infix Expression

Medium % 0
375

String to Integer (AtoI - ASCII to Integer)

Beginner % 1

Merge Strings Alternately - Leetcode

Check If Student is eligible for an Attendance Reward

Random character in a given string - Java

Minimum Deletions to make the occurrence of each character unique.

Compare two version numbers of a software

Minimum number of times String A is repeated to such that B is substring of A

Find Lexicographically smallest or largest substring of size k

Largest word in dictionary by removing a few characters from the given string

Check if one string is a subsequence of another string.

Lexicographically previous permutation With One swap

Hamming Distance between two given strings

Find the maximum number present in a String

Convert Prefix to Postfix Expression

Convert Postfix to Prefix Expression

Convert Integer to Roman

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Longest contiguous character in a given String - O(N) Solution

Convert Postfix to Infix Expression

String to Integer (AtoI - ASCII to Integer)