thinkphp

void solve() {

	int n, x;//dimnesiune si butonul apasat: x secunde

	cin>>n>>x;

	int l = 1e5, r = -1;

	for(int i = 0; i < n; ++i) {

thinkphp

//1,3,4,2,2
[1,2,3,4]
4/2 = 2
int findDuplicate(vector<int>_&nums) {
	
       int low = 1;

       int high = nums.size() - 1;// 5= 5-1= 4

       [1,2,3,4]

thinkphp

int findDuplicate(vector<int>_&nums) {
	

       int low = 1;

       int high = nums.size() - 1;// 5= 5-1= 4

       [1,2,3,4]

thinkphp

bool validMountain(vector<int>& arr) {

  int n = arr.size();
  int start = 0;

int end = n - 1;


//urcare

thinkphp

public class Main {
	
	//Maarriaa
     public static int CountDistinctChars(String s) {

        Set<Character> set = new HashSet<>();//caracterele vor fi distincte

        for(char c : s.toCharArray()) {//m, a, 

thinkphp

class Solution {

public boolean isPalindrome(String s) {



StringBuilder tmp = new StringBuilder();

//Time Complexity: O(n)
for(char c: s.toCharArray()) {	

thinkphp

import java.io.*;
import java.util.*;

public class Rucsac {


       public static void main(String[] args) throws IOException {

              BufferedReader fin = new BufferedReader(new FileReader("rucsac.in"));

thinkphp

Brute-force --->> incerci toate variantele posibile 

Backtracking - te intorci daca nu mai poti inainta

Greedy - >alegi mereu cea mai buna decizie locala

- decizii pas cu pas

- nu revii asupra alegerilor

thinkphp

/*
for(int i = 1; i <= n; ++i) {
	   for(int j = 1; j <= n; ++j) {

	   }
}

O(n^2)

thinkphp

input: 

numar de obiecte, capacitate rucsac

urmatoarele linii:
greutate obiecte, profit obiect

5 10
3 2
4 3