I am very much new to the time complexity practically although I know this concept very well theoretically, while I was searching practice problems on leetcode I came across about Constraints, I do not know how these constraints work practically in a simple java coding program, let's say I have a two sum problem at leetcode what does these marked constrains mean in the pic below
Your help would really be appreciated pls help and guide how these constraints work and what do these constraints meen in this two sum problem?
Thanks in advance

nums[i]can be in the range from-1000000000to1000000000. Your program has to be able to work with all numbers in the specified range. This has nothing to do with time complexity.nums.length => 2- you do not need to care about invalid input; abs(target) <= 10^9 - you do not need to care about integer overflow (i.e. only algorithm makes sense). Small numbers or "input contains lowercase english letters only" may give you idea to use primitive array instead of set/map or do not think about unicode symbols.