inspector-ambitious

Exercise 1

Write a method that compute the sum of all the elements of an array of integers.

Example

input: [1, 2, 2, 3, 3, 4, 5, 6, 5, 7, 7, 7, 8, 8, 1] output: 69

Exercise 2

Write a method to reverse a string.

inspector-ambitious

Exercise 1

Write a function that compute the sum of all the elements of an array of integers.

Example

input: [1, 2, 2, 3, 3, 4, 5, 6, 5, 7, 7, 7, 8, 8, 1] output: 69

Exercise 2

inspector-ambitious

Exercise 1

Write a method that compute the sum of all the elements of an array of integers.

Example

input: [1, 2, 2, 3, 3, 4, 5, 6, 5, 7, 7, 7, 8, 8, 1] output: 69

Exercise 2

Write a method to reverse a string.

inspector-ambitious

Given a string s, find the length of the longest substring without repeating characters.

Example 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

inspector-ambitious

import mitmproxy.http

import requests

import json

import re

import base64

inspector-ambitious

set pagination off
set disassembly-flavor intel
set disassemble-next-line on
set print pretty on
set confirm off
set history save on
set history filename ~/.gdb_history
tui enable
tui new-layout default src 1 {-horizontal asm 2 regs 1} 2 status 1 cmd 1
tui new-layout no-src {-horizontal asm 2 regs 1} 2 status 1 cmd 1