Can We Solve In O(N) Time ? - H-Index - Leetcode 274

[@reshmasuresh3037]

Regular a dp video podunga bro ..its very useful

[@MohamedSaif-kl8sq]

broo big fan brooo

[@manikandan.k3049]

Anna leetcode la top 150 questions aprm 75 questions antha series fulla podunga anna very useful ha irukum anna

[@KARTHIK-b3z]

anna Zig zag conversion problem podunga na.

[@arvindks4986]

Bro hashmap use panna mudiyuma?

[@smsvijay3271]

bro when i am going to solve a problem... first i should try it myself or understand the concept from any source and then solve it?

[@AlgoTamizha]

I would suggest the following 1. try the problem yourself. 2. If stuck, dont look for solution immediately.. take 30 min to 1 hour think other ways. More than solving a problem, it is important to think about the problem for some time to get in sync with a pattern. 3. even after sometime if you are stuck, you can look at solutions. BUT after looking at the solution, dont go to the next problem immediately. CODE the solution yourself once. repeat the above steps for any new problem.

[@21flame72]

// User function Template for Java class Solution { // Function to find hIndex public int hIndex(int[] citations) { // code here Arrays.sort(citations); int n =citations.length; for(int i=0;i=n-i){ return n-i; } } return 0; } }

[@Barathraj-b3o]

little bit confusing bro

[@AlgoTamizha]

which part bro?