tewari2312

class RemoveListElements {
    public static void main(String[] args) {
        ListNode node6_2 = new ListNode(6);
        ListNode node5 = new ListNode(5, node6_2);
        ListNode node4 = new ListNode(4, node5);
        ListNode node3 = new ListNode(3, node4);
        ListNode node6_1 = new ListNode(6, node3);
        ListNode node2 = new ListNode(2, node6_1);
        ListNode node1 = new ListNode(1, node2);
        printNodes(new RemoveListElements().removeElements(node1, 6));

tewari2312

class NodeCounter {

    int counter = 0;
    public static void main(String[] args) {
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);
        TreeNode node2 = new TreeNode(2, node4, node5);
        TreeNode node3 = new TreeNode(3, node6, null);
        TreeNode node1 = new TreeNode(1, node2, node3);

tewari2312

class HammingWeightCalculator {
    public static void main(String[] args) {
        System.out.println(new HammingWeightCalculator().hammingWeight(11));
        System.out.println(new HammingWeightCalculator().hammingWeight(128));
        System.out.println(new HammingWeightCalculator().hammingWeight(2147483645));
    }

    public int hammingWeight(int n) {
        String value = Integer.toBinaryString(n);
        int returnValue = 0;

tewari2312

import java.util.ArrayList;
import java.util.List;

class PascalTriangle {
    public static void main(String[] args) {
        System.out.println(new PascalTriangle().generate(7));
    }

    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> list = new ArrayList<>();

tewari2312

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

class IntersectingListNode {
    public static void main(String[] args) {
        ListNode Anode5 = new ListNode(5);
        ListNode Anode4_2 = new ListNode(4, Anode5);
        ListNode Anode8 = new ListNode(8, Anode4_2);

tewari2312

class RootToLeafPathSum {

    boolean result = false;
    int currentPathSum = 0;
    public static void main(String[] args) {
        TreeNode E1node7 = new TreeNode(7);
        TreeNode E1node2 = new TreeNode(2);
        TreeNode E1node1 = new TreeNode(1);
        TreeNode E1node11 = new TreeNode(11,E1node7, E1node2);
        TreeNode E1node13 = new TreeNode(13);

tewari2312

class MinimumDepthOfBinaryTree {

    int minDepth = 0;
    int currentDepth = 0;
    public static void main(String[] args) {
        TreeNode node9 = new TreeNode(9);
        TreeNode node15 = new TreeNode(15);
        TreeNode node7 = new TreeNode(7);
        TreeNode node20 = new TreeNode(20,node15,node7);
        TreeNode node3 = new TreeNode(3,node9,node20);

tewari2312

class TreeNode {
 int val;
 TreeNode left;
 TreeNode right;
 TreeNode() {}
 TreeNode(int val) { this.val = val; }
 TreeNode(int val, TreeNode left, TreeNode right) {
     this.val = val;
     this.left = left;
     this.right = right;

tewari2312

import java.util.ArrayList;
import java.util.List;

class SimpleBinaryPreOrderTraversal {

    List<Integer> values = new ArrayList<>();
    public static void main(String[] args) {
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);

tewari2312

import java.util.ArrayList;
import java.util.List;

class SimpleBinaryPostOrderTraversal {

    List<Integer> values = new ArrayList<>();
    public static void main(String[] args) {
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);