xnorcode

...

static boolean isAnagram(String str1, String str2){

	// not the same size its not anagram
	if(str1.length() != str2.length()) return false;

	// integer array of 26 for each letter of English alphabet
	int[] letters = new int[26];

xnorcode

...
    
// create a stack of characters
Stack<Character> st = new Stack<Character>();

// convert string to reverse into an array of characters
char[] arr = str.toCharArray();

// iterate chars array and push each char into the stack
for(char c : arr){

xnorcode

...
    
// convert String to array of chars
char[] s = str.toCharArray();

// get length of string
int n = s.length;

// get middle of string
int middle = n/2;

xnorcode

...    
    
// custom node class
public static class Node {

	int id;

	Node left;

	Node right;

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    public void printAll(){
        
        // get reference to the head node
        Node next = head;
        

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    // node class
    class Node {
        
        // Node data
        T data;

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    public boolean hasCycle(){
        
        // check if list empty
        if(head == null) return false;
        

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    public void addToHead(T data){
        
        // create the new Node and add head as its next
        Node newNode = new Node(data, head);
        

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    public void removeDuplicates(){
        
        // check if list empty
        if(head == null) return;
        

xnorcode

public class LinkedList<T> {
    
    // Reference to the head node
    Node head;
    
    public void removeNode(T data){
        
        // check if list empty
        if(head == null) return;