Added comments with tags.

Author: javadev

src/main/java/g0001_0100/s0001_two_sum/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0001_two_sum;
 
+// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
+
 import java.util.Arrays;
 
 public class Solution {

src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0002_add_two_numbers;
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
+
 import com_github_leetcode.ListNode;
 
 /*

src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0003_longest_substring_without_repeating_characters;
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
+
 public class Solution {
     public int lengthOfLongestSubstring(String s) {
         int[] lastIndices = new int[256];

src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0004_median_of_two_sorted_arrays;
 
+// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
+
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.List;

src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0005_longest_palindromic_substring;
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
+
 public class Solution {
     public String longestPalindrome(String s) {
         char[] newStr = new char[s.length() * 2 + 1];

src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0006_zigzag_conversion;
 
+// #Medium #String
+
 public class Solution {
     public String convert(String s, int numRows) {
         int sLen = s.length();

src/main/java/g0001_0100/s0007_reverse_integer/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0007_reverse_integer;
 
+// #Medium #Top_Interview_Questions #Math
+
 public class Solution {
     public int reverse(int x) {
         long rev = 0;

src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0008_string_to_integer_atoi;
 
+// #Medium #Top_Interview_Questions #String
+
 public class Solution {
     public int myAtoi(String str) {
         if (str == null || str.length() == 0) {

src/main/java/g0001_0100/s0009_palindrome_number/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0009_palindrome_number;
 
+// #Easy #Math
+
 public class Solution {
     public boolean isPalindrome(int x) {
         if (x < 0) {

src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java

@@ -1,5 +1,7 @@
 package g0001_0100.s0010_regular_expression_matching;
 
+// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
+
 public class Solution {
     private Boolean[][] cache;