# Status Problem Level Completes Likes 1 Count similar words in a given array Beginner % 0 2 Find the number of distinct Islands OR connected components. Hard % 0 3 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 4 Social Network Problem Hard % 0 5 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 6 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 7 Convert Prefix to Postfix Expression Medium % 0 8 Convert Postfix to Prefix Expression Medium % 0 9 Grouping of Anagrams Medium % 0 10 Convert Postfix to Infix Expression Medium % 0 11 Convert Infix to Prefix Expression Medium % 0 12 Convert Infix to Postfix Expression Medium % 0 13 Evaluation of Infix expressions Medium % 0 14 Convert Prefix to Infix Expression Medium % 0 Count similar words in a given array Find the number of distinct Islands OR connected components. Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Social Network Problem Evaluation of Prefix Expressions (Polish Notation) | Set 2 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Convert Prefix to Postfix Expression Convert Postfix to Prefix Expression Grouping of Anagrams Convert Postfix to Infix Expression Convert Infix to Prefix Expression Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression 1
