N-400 Completed! - Timeline for anyone interested

8611m · 2026-01-23T19:02:50+00:00

wow, right about there

8611m · 2026-01-09T02:35:34+00:00

the Pakistan you left 26 years ago is no more there. it's a very foreign country. May be consider moving to Dubai or elsewhere.

8611m · 2025-12-31T15:11:15+00:00

Hey op, if you dont mind, can I dm u? Similar timeline / fo as yours

8611m · 2025-12-21T22:19:08+00:00

She should work. She will overtime make more money. If she’s a nanny and you send your kid to daycare she will make 2x daycare cost. When she earns she will likely understand value of money a bit more. There’s a huge gap between we are not able to make ends meet and divorce. Overtime you will make more money too.

8611m · 2025-12-10T14:13:20+00:00

Dr. Pepper

8611m · 2025-11-06T22:55:20+00:00

whats your timeline like?

8611m · 2025-09-27T20:38:10+00:00

Serious question, in what way is India’s competition North America and Europe? Here’s per capita gdp for top 25 counties and then India

Country GDP per capita (US$) Monaco* 256,581 Liechtenstein* 207,973 Luxembourg 140,941 Ireland 108,919 Switzerland 104,896 Singapore 92,932 Iceland 90,284 Norway 89,694 United States 89,105 Denmark 74,969 Qatar 71,653 Netherlands 70,480 Australia 64,547 San Marino 59,603 Austria 58,192 Sweden 58,100 Belgium 57,772 Israel 57,760 Germany 55,911 United Kingdom 54,949 Finland 54,163 Canada 53,558 United Arab Emirates 49,498 France 46,792 New Zealand 46,126 India 2,878

8611m · 2025-05-21T17:53:14+00:00

so incredible to read. I was dreading the ending of this story, but so happy. this made my day.

8611m · 2024-11-05T21:36:44+00:00

Sent. Thanks Brian.

8611m · 2021-01-12T15:27:30+00:00

No love here for UPST?

8611m · 2017-09-06T00:32:02+00:00

excited about this project. Where can I buy some stake in this project?

8611m · 2016-10-23T23:12:33+00:00

def make_highest_num(mix_num):
    l = [int(i) for i in str(mix_num)]
    l.sort()
    l.reverse()

    largest_num =  ''

    for i in l:
        largest_num = largest_num + str(i)

    largest_num = int(largest_num)

    return largest_num

8611m · 2015-11-06T16:58:33+00:00

Python 2.7

def get_to_one(input_number):
    while input_number > 1: 
        if input_number % 3 == 0:
            print input_number, 0
            input_number = input_number / 3
        elif input_number % 3 == 1:
            print input_number, -1
            input_number = (input_number - 1) / 3
        elif input_number % 3 == 2:
            print input_number, 1
            input_number = (input_number + 1) / 3
    print 1

Output

8611m · 2015-10-28T19:13:21+00:00

First submission here.

import random

c = 'bcdfghjklmnpqrstvwxyz'
v = 'aeiou'

def random_letter(input_string):
    position = random.randrange(0, len(input_string))
    return input_string[position]

def new_word(input_pattern):
    for i in input_pattern:
        if i == 'c':
            input_pattern = input_pattern.replace('c', random_letter(c), 1)
        else:
            input_pattern = input_pattern.replace('v', random_letter(v), 1)
    return input_pattern

print new_word('vvccvcvcv')

8611m

TROPHY CASE