Infosys Technical Code Challenges & Tips

1. Write a function to find the longest substring without repeating characters in a given string.

2. Implement a function that merges two sorted linked lists into one sorted linked list.

3. Given an array of integers, write a function to find the maximum product of any two distinct elements.

4. Write a program that checks if two strings are anagrams of each other.

5. Create a function that returns the nth Fibonacci number using memoization.

6. Implement a binary search algorithm on a sorted array of integers.

7. Write a function to determine if a given binary tree is height-balanced.

8. Create an algorithm that finds all unique permutations of a list of numbers.

9. Write a function to perform a depth-first search (DFS) on a graph represented as an adjacency list.

10. Given a list of integers, write a function to find all combinations that sum up to a target number.