Job is difficult, business is also difficult
Choose your difficult wisely
3 replies4 likes
Trademan
Stealth • 8m
I need a TECH CO-FOUNDER,
I have seen n number of times in this platfm,
It's time to switch n learn tech😟
Consulting has become old school n
of no value
Robotics is going to be the next big thing in this decade. Agree?
6 replies13 likes
ABHINANDAN KAISTHA
Stealth • 6m
The most important thing to realise for any business is that
Not every customer is your consumer
But your consumer will eventually become your customer,so make products wisely
Hey guys planning to do B.Tech in CS and then M. Tech in Robotics.
My interest :- I like building(or learning) machine learning models, but I like robotics too. I even like to developing android apps.
Looking for advice about wether what I am plann
See More
4 replies7 likes
Soubhagya Biswas
Stealth • 3d
the biggest bug in medial is we cant edit our writes thats can little bit effect on users
Medial Mod
bro fix that thing your start up has the potential.
0 replies1 like
Likith Renikunta
Stealth • 6m
If you are a founder , then on what basis you choose your cofounder like uf there are two people pne is your friend who is trustworthy and has moderate skills other one whom you just know a months ago and is highly skills whom will you choose and wh
Hi Medial family 👋
I want to gather data on anxiety, stress , feels low or frustrated.
For this , all I want is please wisely and honest choose any of the following option, if you are sufferings from any .
Tension not no one is knowing, what you
24th dec christmas eve
25th dec christmas
26th dec boxing day
27th dec at 8pm 100 hours to go for 2025
28th dec and 29th last weekend and last sunday of 2024
30th dec last monday of 2024
31st dec countdown n new year eve for 2025
01st jan 2025 new y
See More
1 replies2 likes
Prince Singh Chouhan
Stealth • 7m
Fisher-Yates algorithm shuffles an array by iterating from the end, swapping each element with a randomly selected one preceding it. This ensures each element has an equal chance of ending up anywhere. Time complexity is O(n).