# Problem: Two Sum # Problem statement: Given an array of integers nums and an integer target, return the indices i and j such that nums[i] + nums[j] == target and i != j. You may assume that every input has exactly one pair of indices i and j that s...
Sharing my insights about dsa,java,tech news, interview prepration
Hi, I'm a backend software engineer with over 2+ years of industry experience. I have built a large, scalable, and distributed fintech-backed system for one of India's top banks. I like to do brainstorming of real-world problems and try to solve them using a programming language.
Markdown supported · ⌘↵ to post
No responses yet.