vaibhav29498
vaibhav29498
  1. Graph representations using set and hash
  2. Optimization techniques for Gradient Descent
  3. Least Frequently Used (LFU) Cache Implementation
  4. Python | Tensorflow nn.relu() and nn.leaky_relu()
  5. Value in a given range with maximum XOR
  6. Determining the inconsistently weighted object
  7. Python | Tensorflow nn.softplus()
  8. Python | Tensorflow nn.sigmoid()
  9. Python | Tensorflow nn.tanh()
  10. Minimum number of palindromes required to express N as a sum | Set 1
  11. Minimum number of palindromes required to express N as a sum | Set 2
  12. Minimum element in a max heap
  13. Generating numbers that are divisor of their right-rotations
  14. Ways to write N as sum of two or more positive integers | Set-2
  15. Number of solutions of n = x + n ⊕ x
  16. Find the probability of a state at a given time in a Markov chain | Set 1
  17. Finding the probability of a state at a given time in a Markov chain | Set 2
  18. Number of ways to partition a string into two balanced subsequences
  19. De Bruijn sequence | Set 1
  20. Generating Lyndon words of length n
  21. K’th Least Element in a Min-Heap
  22. K-th Greatest Element in a Max-Heap
  23. Python | Tensorflow cos() method
  24. Python | Tensorflow sin() method
  25. Python | Tensorflow atan() method
  26. Python | Tensorflow tan() method
  27. Python | Tensorflow cosh() method
  28. Python | Tensorflow sinh() method
  29. Python | Tensorflow asin() method
  30. Python | Tensorflow acos() method
  31. Python | Tensorflow atanh() method
  32. Python | Tensorflow asinh() method
  33. Python | Tensorflow acosh() method
  34. Python | PyTorch sinh() method
  35. Python | PyTorch cosh() method
  36. Python | PyTorch tanh() method
  37. Python | PyTorch sin() method
  38. Python | PyTorch cos() method
  39. Python | PyTorch tan() method
  40. Python | PyTorch asin() method
  41. Python | PyTorch acos() method
  42. Python | PyTorch atan() method
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.