Code Archives - Page 13 of 32

Solved! Leetcode 1428: Leftmost Column with at Least a One

Dec

31

2022

A row-sorted binary matrix means that all elements are 0 or 1 and each row of the matrix is sorted in non-decreasing order.Given a row-sorted binary matrix binaryMatrix, return the index (0-indexed) of the leftmost column with a 1 in it. If such an index does not exist, return -1.You can’t access the Binary Matrix ...

Leetcode 797: All Paths From Source to Target

Dec

30

2022

Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order. The graph is given as follows: graph[i] is a list of all nodes you can visit from node i (i.e., there is a directed edge from node i to node graph[i][j]). https://leetcode.com/problems/all-paths-from-source-to-target/description/ class Solution { public List<List<Integer>> allPathsSourceTarget(int[][] ...

Leetcode 1167: Minimum Cost to Connect Sticks

Dec

29

2022

You have some number of sticks with positive integer lengths. These lengths are given as an array sticks, where sticks[i] is the length of the ith stick. You can connect any two sticks of lengths x and y into one stick by paying a cost of x + y. You must connect all the sticks until there is only one stick remaining. Return the minimum cost of connecting ...

Leetcode 1834: Single-Threaded CPU

Dec

29

2022

You are given n tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means that the ith task will be available to process at enqueueTimei and will take processingTimeito finish processing. You have a single-threaded CPU that can process at most one task at a time and will act in the following way: If the CPU is idle ...

Protected access modifier in Java

Jun

28

2021

As per the official java documentation from Oracle: “The protected modifier specifies that the member can only be accessed within its own package (as with package-private) and, in addition, by a subclass of its class in another package.” What this means is: Say, a concrete class Parent in package com.coddicted has a protected method named ...

Java Streams : Convert List of Strings to Single Comma separated String

Feb

8

2021

In this short post, we’d explain how to convert/ reduce a List of Strings into a single comma (,) separated String using Java-8 Streams API. here’s the code: import java.util.Arrays; import java.util.List; public class ListToString { public static String getCommaSeparatedString(List<string> input) { return input.stream() .reduce( // identity function for String concatenation "", (s1, s2) -> ...

Building a Chat-Application

Jun

29

2020

Hello Everyone, We’ve started a Youtube channel named Coddicted and the first series that we’re going to showcase you is about building a WhatsApp like Chat application on Android. Here’s the first in the series of videos: This is still a work-in-progress, but, we hope you enjoy the series as much as we’ve enjoyed creating ...

Find and Replace Pattern

Oct

21

2018

Title: Find and Replace Pattern Source: leetcode.com You have a list of words and a pattern, and you want to know which words in words matches the pattern. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get ...

Linked List Components

Oct

14

2018

Title: Linked List Components Source: leetcode.com We are given head, the head node of a linked list containing unique integer values. We are also given the list G, a subset of the values in the linked list. Return the number of connected components in G, where two values are connected if they appear consecutively in ...

Increasing Order Search Tree

Oct

7

2018

Title: Increasing Order Search Tree Source: leetcode.com Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child (Increasing order search tree). Example 1: Input: [5,3,6,2,4,null,8,1,null,null,null,7,9] 5 / \ 3 6 ...