Many time, when an interview approaches, candidates start searching for different algorithms in different programming languages for practise. This project aims to build a website which will contain the codes along with the techniques and explanations so that it can be helpful for many
I would like to add a problem to find the two numbers that sum to target efficiently. Input: nums = [2,7,11,15], target = 9 Output: [0,1] I would like to work on this issue for SWOC'21. Problem link: https://leetcode.com/explore/featured/card/top-interview-questions-easy/92/array/546/