empeje

[SNIPPET-02] Home Exercises Links

• Top 25 At-Home Exercises
  • Supermans
  • Push-up
  • Contralateral Limb Raises
• Bent Knee Push-up

empeje

Tools

Git for Windows

It can be downloaded here

Amix Vimrc

It can be downloaded here

empeje

public class WihoutLoop{

     public static void main(String []args){
        reachfinal(0,100);
     }
     
     public static void reachfinal(int startpoint, int finalpoint){
        if (startpoint != finalpoint){ 
            System.out.println(startpoint);
            reachfinal(startpoint+1, finalpoint);

empeje

def create_matrix(width, height):
    result = []
    for i in range(height):
        result.append([0 for i in range(width)])
    
    print (result)
    
    # TOP BOTTOM LEFT RIGHT
    T = 0
    B = height - 1

empeje

class Button extends React.Component {
	// constructor (props) {
	// super(props);
	// this.state = { counter: 0 };
	// }
  state = { counter: 0 }
  
  handleClick = () => {
  	// this.state.counter++
    this.setState((prevState) => ({

empeje

sudo apt-get install redis-server
sudo /etc/init.d/redis-server restart

neo4j start
neo4j status

sudo apt-get install mongodb-server
sudo apt-get install mongodb-clients
killall mongod
cd ~

empeje

def solution(X, Y, D):
    # write your code in Python 2.7
    gap = Y-X
    if gap % D == 0:
        return gap / D
    else:
        return gap / D + 1

empeje

from collections import deque
# you can write to stdout for debugging purposes, e.g.
# print "this is a debug message"

def solution(A, K):
    # write your code in Python 2.7
    d=deque(A)
    d.rotate(K)
    return list(d)

empeje

def solution(N):
    # write your code in Python 2.7
    bin_representation = "{0:b}".format(N)
    bin_representation = 'x' + bin_representation
    bin_representation = bin_representation + 'x'
    start_index = [i for i in range(0, len(bin_representation)) if ((bin_representation[i] == '1') and (bin_representation[i+1]=='0'))]
    end_index = [i for i in range(0, len(bin_representation)) if ((bin_representation[i] == '1') and (bin_representation[i-1]=='0'))]
    
    
    print(start_index)

empeje

#!/bin/python3

import sys


n = int(input().strip())
scores = list(map(int, input().strip().split(' ')))
# your code goes here
# highest score
max = -float("inf")