process tiktok oa done absolutely

[livid wadi]

bytedance fuked me up too

felt like 2 LC hards

[primal shuttle]

i tried to solve.. they were bound by hard time constraints. idk how the hell i need to improve time complexity. 😭

[plucky trail]

how was sql?

[primal shuttle]

with the knowledge i have i couldnt do it actually. or i was so frustrated because i couldnt solve coding.

[old gorge]

tiktok oa is insane

def lc hard

[naive cairn]

@primal shuttle Could you share the questions? :p

[plucky marlin]

+1

[primal shuttle]

1. minimum common integer between all the subarrays of length 1 to n.
   return list of n integers, where index of list is the size of subarray. i.e., if i = 0 then subarrays are of size 1.

2. some channel rating - in all subarrays of length 3 to n. count number of subarrays with equal border element [0, -1] xor and remaining elements xor

[swift sinew]

what about the Database question ?

[cunning jewel]

aw nah https://stackoverflow.com/questions/77275688/find-common-item-in-sub-arrays

[primal shuttle]

yo, this is it. i had nightmares solving it

actually no

nightmares solving it in time constraint

[livid wadi]

@primal shuttle yea thats what i had as well, did you solve either?

[swift sinew]

what was the database question?

[primal shuttle]

please dont ask

[primal shuttle]

its kinda hard to explain without tables. idk

[cunning jewel]

tiktok OA is so hard we dont even understand the questions, much less solve them

[swift sinew]

I found. Ramp codesignal exam the toughest of all I had written

did anyone get 600/600?

[primal shuttle]

but people still managing to full solve tiktok oa. idk whats wrong with me

@livid wadi did you?

[livid wadi]

i solved one, got 10/15 on the xor one

[cunning jewel]

im grinding DP hard and i'm sure i'm still gon fail

[livid wadi]

even if i dont full solve is it possible to move on?

[primal shuttle]

idk.. i thought we couldnt and i gave up. lol

[limber barn]

what logic did you use ? I have one which runs in n^3, looking for a better approach

[red mango]

It can be solved by O(n) use sliding window concept

[strong sentinel]

ramp was easy compared to tiktok lol

i got 600/600 on ramp but couldnt solve a single q on tiktok OA

[shell cargo]

@primal shuttle what about the multiple choice what questions u got?

[inland bison]

did u use gear 5?

[smoky bison]

DM me for Tiktok OA questions, Q4 and Q5

[limber barn]

Can i DM you ?

[swift sinew]

wtf how? which language ? Your probably the fastest coder I know

They're hugeeeeee

[smoky bison]

600 on ramp is impressive

[strong sentinel]

not rly. ik people who did it in 35 mins

i took 55

i did it in python

[smoky bison]

those Step 4 edge cases brutalized me

[strong sentinel]

right?!

[smoky bison]

4 test cases remained, and I got a reject : (

[strong sentinel]

i mean i got 600/600 and got reject

[livid wadi]

is it harder than GCA?

[strong sentinel]

yea lol

ramp's oa is meant for senior engineers

[livid wadi]

das crazy

[shell cargo]

no thats not correct because for the oa it was not distinct integers

[shell cargo]

Although I ran out of time on my attempt the optimal solution would be to calculate the min start of window partaining to number and max end of window and calculate how many windows of size k u can fit inside also because of duplicates your start for duplicated number within k elements would be the caharacter after prev duplicate. Find the min number with n-k+1 numbers in your calculations. That is mink for that k elements. Giving u an overall complexity of (n^2) most optimal I can think of.

[cunning jewel]

this OA already done right?

like it's expired as of 1h30m ago?

[sullen crypt]

did you guys understand the first mc?

i had no idea what it was asking, the question made no sense

The resource allocation one

[livid wadi]

its also doable in O(n). for each element, you keep track of all the indices and find the largest gap between the elements and the end points (0 and n). the largest gap will represent the minimum subarray size that cannot contain the elements, and we can easily update the answer array from there

[sullen crypt]

@livid wadi did u do the oa? Can I dm

[shell cargo]

Find largest and then use largest to calculate possible subarray patterns yeah sounds solid.

[sullen crypt]

@indigo holly

[red mango]

Hi
The first one was bankers algorithm

U woud have got that right if u used bankers algorithm to solve

[swift sinew]

I got 13/15 for the xor question 🥲

Idk where I was going wromg

[sullen crypt]

was it a deadlock?

[red mango]

No we get safe state

[sullen crypt]

just wasnt sure what it was asking, it said each resource had 5 instances but in the chart some of them had 6

[red mango]

I ran the algorithm and i got a sequence so i chosed safe state

[red mango]

Was it because of TLE or wrong ans?
Did u use mod operator

[sullen crypt]

maybe that's right but the question itself didnt make sense to me lol

[red mango]

tiktok oa was weird though
literally 120 mins was too less for those questions

[high mulch]

i guessed on the MC, and skipped the SQL and still moved on 👀

[swift sinew]

No. I wrote O(n) solution. So it’s not tle. I used mod every where possible.

[red mango]

Oh thats weird then

[plucky trail]

how did you do this? that question made no sense since some of the resources were overallocated.

[shell cargo]

oh if i reember u had to modulo 10^7

[shell cargo]

^

[sullen crypt]

What team?

[high mulch]

camera

[high mulch]

Wbu?

[sullen crypt]

product

[swift sinew]

what? not 10^7+9 ?

[strong sentinel]

no

they wanted

10^9 + 7

[shell cargo]

Yeah one of those I don’t remember the exact number😅

[swift sinew]

I remember it being (1e9+7)

[livid wadi]

1e9+7 is the standard, it’s the largest prime number that fits in an int

[strong sentinel]

fuck im a moron

i meant mod 10^9 + 7 😭

[cunning jewel]

reject after successful SQL and both O(n)

[strong sentinel]

how is ur resume 😭 @cunning jewel

[cunning jewel]

probably bad

[strong sentinel]

wdym "probably bad"

like whats ur experience

@cunning jewel

[molten elm]

Lmao I got the same questions, I answered the first 3 well but these dp questions were mad shit hard. Couldn't do better than 6/15 for both questions.

[primal shuttle]

i could 10/15 for the 1st. and then i completely gave up cuz only 5/5 moves forward. probably that was my mistake to give up 💀

[molten elm]

solving them in n^3 was kinda straightforward so I wrote it first within 10 mins just incase the time fucks me up, and it actually did lmao.

when do we hear back about rejection tho? any idea how long it takes?

[swift sinew]

how did you solve the xor question?

I got 13/15

[cunning jewel]

you may have forgot to modulo

basically there were two realizations

1. "xor of first and last = xor of inner" is the same as total xor = 0

2. because xor is its own complement you can check if there's any values equal to current running value so far

like, if the running xor of [0:i] is 2, and the running xor of [0:j] is 2, then the xor of [i:j] is 0

you dont even need to prefix sum you can just count values so far in a hashmap

[swift sinew]

Yeah I did the exact same thing