Nickly

Transform long URLs into short links

Shorten Your URL

Shortened URLs

# Short ID Original URL Clicks Analytics
1 https://nickly.onrender.com/GyRvxffD https://www.perplexity.ai/search/i-am-building-a-mern-stack-web-JWHL6yqiSr6CfsrTaurQlQ 1 View Analytics
2 https://nickly.onrender.com/https://www.hackerrank.com/contest/aiml3 https://www.hackerrank.com/contests/hack-aiml3-17sep25/challenges/lilys-homework 0 View Analytics
3 https://nickly.onrender.com/medivault https://mediora.onrender.com/ 3 View Analytics
4 https://nickly.onrender.com/abhay https://directoline.onrender.com/ 3 View Analytics
5 https://nickly.onrender.com/w https://www.hackerrank.com/contests/h-cs3c-8oct25/ 0 View Analytics
6 https://nickly.onrender.com/p https://pplx.ai/fakeadarsh36420 2 View Analytics
7 https://nickly.onrender.com/bjFxd-kk https://alamin-tokee.github.io/yfolio/ 1 View Analytics
8 https://nickly.onrender.com/btech https://drive.google.com/drive/folders/1KVNtLAuAv7oMbJj8JPr8dpSCjhFrPNnq 54 View Analytics
9 https://nickly.onrender.com/today potd class Solution { int ind =0; public boolean isTrionic(int[] nums) { inc(nums); System.out.println("pass"); if(ind >= nums.length-1) return false; dec(nums); System.out.println("pass"); if(ind >= nums.length-1){ return false;} inc(nums); System.out.println("pass"); if(ind != nums.length) return false; System.out.println(ind); System.out.println("pass"); return true; } private void inc(int[] nums) { Stack<Integer> st = new Stack<>(); while(ind < nums.length) { if(st.isEmpty() || nums[ind] > st.peek()) { st.push(nums[ind]); ind++; } else { ind--; break; } } } private void dec(int[] nums) { Stack<Integer> st = new Stack<>(); while(ind < nums.length) { if(st.isEmpty() || nums[ind] < st.peek()) { st.push(nums[ind]); ind++; } else { ind--; break; } } } } 0 View Analytics
10 https://nickly.onrender.com/ibm hackathon http://www.hackathon.allsoftsolutions.in/ 0 View Analytics