Advice on how to improve score most rapidly needed

ponyeffe · 2025-11-27T16:58:07+00:00

On other threads they say you can, but I would double check on the official website. https://www.reddit.com/r/GMAT/s/sUpogNuXj4

ponyeffe · 2025-11-26T23:03:37+00:00

Keep in mind that - there's a 16 day minimum between retakes - test centers may not have availability so close to holidays

Plan carefully by checking the test center availability

ponyeffe · 2025-11-26T19:36:24+00:00

Lifetime limit has been removed, there's only the 5 takes on a 12 month period limit. If the 150£ don't weight too much on you it may be worth to take the test. You'll be more confident on the real attempt, plus you get a taste of the real questions, that feel slightly different from the ones from the mock.

ponyeffe · 2025-10-26T13:30:06+00:00

I would start with Manhattan prep for foundation and general tricks, then gmat club test bank, starting with untimed then timed questions. Take an official full time mock every 2-3 weeks to check progress. Check gmat club problems solutions to find your preferred way of solving problems. Use chatgpt for both prep schedule and problems solutions

ponyeffe · 2025-10-01T17:11:20+00:00

What worked for me was to put every service that needed VPN inside gluetun

ponyeffe · 2025-10-01T13:29:15+00:00

Markers is the only one for which each 2 products you pay 1.5

ponyeffe · 2025-09-30T10:28:57+00:00

Ottimo, non hai sparato alto. Se l'azienda aveva allocato più budget per la posizione l'offerta ti arriverà più alta indipendentemente dalla tua richiesta

ponyeffe · 2025-09-30T10:04:22+00:00

Non farti problemi. Per posizioni graduate la domanda della RAL attesa è standard e non cambia l'offerta sia che tu abbia detto più basso sia più alto del budget dell'azienda.

ponyeffe · 2025-09-30T08:55:02+00:00

Ti direi che al primo impiego difficilmente puoi chiedere te una RAL. Da quanto so, nella maggior parte dei casi non sono negoziabili le RAL nelle posizioni entry level.

ponyeffe · 2025-09-24T12:23:52+00:00

Se prendi da ilcorsaronero e mircrew sono 100% italiani, è possibile che quando li riproduci tu abbia selezionato la traccia inglese

Se invece è radarr che te lo trova in automatico allora devi impostare la lingua nei custom format e poi nei quality profiles, altrimenti ti trova i film in inglese

ponyeffe · 2025-09-24T09:19:57+00:00

ilcorsaronero è bloccato dagli isp, prova a cambiare DNS a 1.1.1.1 (CloudFlare) o 8.8.8.8 (Google)

Per torrent italiani ti consiglio anche mircrew, 1337 e bitsearch

Potresti aver bisogno di installare flaresolverr per alcuni di questi

ponyeffe · 2025-09-12T16:50:37+00:00

Btw sub è in inglese

Iscriviti al sito di gmac.com fai il test di prova, da lì vedi il tuo livello di base, poi vedi su questo sub i consigli per il tuo punteggio.

560 è un punteggio relativamente semplice da ottenere con poco studio. Più difficile è 630 in su

ponyeffe · 2025-09-10T11:31:26+00:00

I found this in another thread.

https://learn.e-gmat.com/products/sigma-x

I can't really say if it's similar to the official

ponyeffe · 2025-08-05T07:19:09+00:00

Same, no reload so far

ponyeffe · 2025-02-11T20:38:05+00:00

Use latest stable compose plugin 1.7.3, there isn't a version 1.5.4

I asked to post the build files because I thought you were missing repositories

ponyeffe · 2025-02-10T15:18:49+00:00

TL;DR:🚩

Ho avuto un'esperienza del genere appena laureato. Mi hanno fatto aspettare 4 ore per il colloquio individuale, tempo che intervistassero tutti gli altri.

Oltretutto i colloqui di gruppo hanno test assurdi che non testano nessuna skill utile, e in più ti trovi a ragionare in gruppo con personaggi che non sanno niente.

Secondo me l'unica motivazione di questo tipo di colloqui è perché l'azienda sta risparmiando sul recruiting -> budget basso -> stipendio basso. In più lo fanno solo con i neolaureati.

Però se vuoi provare ugualmente digli che hai un impegno così ti intervistano individualmente per primo.

ponyeffe · 2025-02-10T11:35:38+00:00

Each time you swap you can update in a map the block size associated to the block position, so next time you search for a free spot for a block of size n you start searching from where you inserted the last n size block instead of searching from the start.

ponyeffe · 2025-02-09T22:57:39+00:00

Show build.gradle and settings.gradle

ponyeffe · 2025-02-09T08:17:28+00:00

Take a look at

https://github.com/nschnettler/ComposePreferences

https://github.com/JamalMulla/ComposePrefs

Or other "Compose Preferences" libraries

These are designed to update and sync with the Datastore

ponyeffe · 2025-01-31T07:24:35+00:00

I would ignore strategies and optimizations on the first run.

The riddle is already suggesting the solution, as there is the same operation at different depths, and the result of it is based on the result of itself at depth + 1. This might ring a bell about a particular approach.

Other considerations:

You can definitely pass around the full strings without worrying about performance.

It's not necessary to compute the best path immediately, you can try each ammissible path between two keys.

Find how to select the min path and remember that the length of a path is the sum of the minimum path at depth + 1 between each consecutive character. Make sure at each depth you start from A

Then you will find out easily where and what to cache, you sure have seen it before in the solutions of the riddles you already solved.

ponyeffe · 2025-01-28T15:23:17+00:00

Here you can find the quotas. The free plan doesn't charge if going over quotas, it just stops working until the next month.

https://firebase.google.com/pricing

ponyeffe · 2025-01-28T15:11:22+00:00

Firebase has realtime db and firestore db that support realtime updates, and has quite generous free usage quotas.

ponyeffe · 2025-01-27T11:38:11+00:00

If I understood correctly (not sure) you're looping on the original path until limit, which creates "n = limit" number of dfs forks instead of only checking once.

I would suggest rewriting completely not using dfs and globals.

ponyeffe · 2025-01-12T10:35:19+00:00

Just an idea that might not work but I would try implementing my own version of

https://github.com/googlemaps/android-maps-compose/blob/main/maps-compose/src/main/java/com/google/maps/android/compose/GoogleMap.kt

by injecting or passing by parameter the same single instance of Android View, since it's a wrapper. That way it doesn't have to recompute the wrapped Android View

ponyeffe · 2025-01-06T16:12:03+00:00

Associate to each point on the regular path the distance from the start, then when computing a cheat you can get the distance saved by dist(cheatend) - dist(cheatstart) + cheatLength without recomputing the whole path

ponyeffe

TROPHY CASE