AnwarShahriar

Keybase proof

I hereby claim:

• I am anwarshahriar on github.
• I am noob88 (https://keybase.io/noob88) on keybase.
• I have a public key ASDLM7t0UKezVlhF5JFugKZeM4EQjo5DYDPPMBtkGl7LHQo

To claim this, I am signing this object:

AnwarShahriar

<?xml version="1.0" encoding="utf-8"?>
<RelativeLayout
        xmlns:android="http://schemas.android.com/apk/res/android"
        xmlns:tools="http://schemas.android.com/tools"
        xmlns:app="http://schemas.android.com/apk/res-auto"
        android:layout_width="match_parent"
        android:layout_height="match_parent">
    <RelativeLayout
            android:id="@+id/topBar"
            android:layout_width="match_parent"

AnwarShahriar

package me.anwarshahriar.bitmapwithglide

import android.content.Context
import android.graphics.BitmapFactory
import android.os.Bundle
import android.util.DisplayMetrics
import android.view.LayoutInflater
import android.view.View
import android.view.ViewGroup
import android.widget.ImageView

AnwarShahriar

Did you ever have android build failed​ issue because of dependency resolution?

… or you were curious where all these old rxjava dependencies come from?

You can pretty easy track the module causing issues via following gradle command.

gradlew :root-module:dependencyInsight \
--configuration debugRuntimeClasspath \ // or debugCompileClasspath
--dependency io.reactivex:rxjava:1.1.0 > dependencies.txt // saves result to 'dependencies.txt' file

AnwarShahriar

function findMaxSum(arr) {
    let highestSum = 0
    let nextSum = 0

    for (let i = 0; i < arr.length; i++) {
        nextSum = 0
        for (let j = i; j < arr.length; j++) {
            nextSum += arr[j]
            if (nextSum > highestSum) {
                highestSum = nextSum

AnwarShahriar

/**
Given an array of non negative integers A, and a range (B, C), 
find the number of continuous subsequences in the array which have sum S in the range [B, C] or B <= S <= C

Continuous subsequence is defined as all the numbers A[i], A[i + 1], .... A[j]
where 0 <= i <= j < size(A)

Input Description: 
First line contains the number of inputs preceding with total number of input
Second line contains B lower range of sum (inclusive)

AnwarShahriar

function merge(a, b) {
  let i = 0;
  let j = 0;
  let k = 0;
  let arr = [];
  while (i < a.length && j < b.length) {
    if (a[i] <= b[j]) {
      arr[k] = a[i];
      i++;
    } else {

AnwarShahriar

let x = '12345678901234567890';
let y = '12345678901234567890';

let maxLen = Math.max(x.length, y.length)
if (maxLen !== x.length) {
	let tempX = y;
	y = x;
	x = tempX;
}

AnwarShahriar

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

Array

Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

AnwarShahriar

-module(practice).
-export([join/2, concat/1, member/2]).

join([],Y) -> Y;
join([X|Xs], [Y|Ys]) ->
    [X|join(Xs, [Y|Ys])].

concat([X]) -> X;
concat([X|Xs]) ->
    join(X, concat(Xs)).