Selecionamos alguns testes técnicos, pra começar o processo, basta fazer um fork deste repositório, resolver dois ou mais exercícios em qualquer linguagem, preferencialmente PHP, Java, Javascript, Python ou C(++), depois faz um pull request pra gente avaliar tua solução.

Caso você mostre um resultado legal, vamos te chamar pra uma entrevista.

Entra aqui na wiki deste projeto pra você conhecer melhor nosso processo seletivo.

Jogue duro!

Coding Practice

Coding Practice for Interviews

LeetCode

#	Title	Difficulty
1	Two Sum	Easy
2	Add Two Numbers	Medium
3	Longest Substring without Repeating Characters	Medium
5	Longest Palindromic Substring	Medium
8	String to Integer (atoi)	Medium
9	Palindrome Number	Easy
11	Container with Most Water	Medium
12	Integer to Roman	Medium
14	Longest Common Prefix	Easy
15	3Sum	Medium
16	3Sum Closest	Medium
19	Remove Nth Node From End of List	Medium
22	Generate Parentheses	Medium
27	Remove Element	Easy
31	Next Permutation	Medium
53	Maximum Subarray	Easy
56	Merge Intervals	Medium
57	Insert Interval	Hard
61	Rotate List	Medium
73	Set Matrix Zeroes	Medium
94	Binary Tree Inorder Traversal	Medium
98	Validate Binary Search Tree	Medium
100	Same Tree	Easy
102	Binary Tree Level Order Traversal	Medium
104	Maximum Depth of Binary Tree	Easy
110	Balanced Binary Tree	Easy
112	Path Sum	Easy
113	Path Sum II	Medium
116	Populating Next Right Pointers in Each Node	Medium
136	Single Number	Easy
139	Word Break	Medium
144	Binary Tree Preorder Traversal	Medium
145	Binary Tree Postorder Traversal	Medium
151	Reverse Words in a String	Medium
152	Maximum Product Subarray	Medium
153	Find Minimum in Rotated Sorted Array	Medium
154	Find Minimum in Rotated Sorted Array II	Hard
155	Min Stack	Easy
160	Intersection of Two Linked Lists	Easy
162	Find Peak Element	Medium
165	Compare Version Numbers	Medium
189	Rotate Array	Easy
215	Kth Largest Element in an Array	Medium
225	Implement Stack using Queues	Easy
226	Invert Binary Tree	Easy
228	Summary Ranges	Medium
232	Implement Queue using Stacks	Easy
237	Delete Node in a Linked List	Easy
300	Longest Increasing Subsequence	Medium
319	Bulb Switcher	Medium
328	Odd Even Linked List	Medium
334	Increasing Triplet Subsequence	Medium
338	Counting Bits	Medium
344	Reverse String	Easy
345	Reverse Vowels of a String	Easy
371	Sum of Two Integers	Easy
389	Find the Difference	Easy
392	Is Subsequence	Medium
394	Decode String	Medium
406	Queue Reconstruction by Height	Medium
412	Fizz Buzz	Easy
413	Arithmetic Slices	Medium
415	Add Strings	Easy
419	Battleships in a Board	Medium
437	Path Sum III	Easy
442	Find All Duplicates in an Array	Medium
461	Hamming Distance	Easy
463	Island Perimeter	Easy
468	Validate IP Address	Medium
476	Number Complement	Easy
485	Max Consecutive Ones	Easy
500	Keyboard Row	Easy
501	Find Mode in Binary Search Tree	Easy
513	Find Bottom Left Tree Value	Medium
515	Find Largest Value in Each Tree Row	Medium
520	Detect Capital	Easy
521	Longest Uncommon Subsequence I	Easy
535	Encode and Decode TinyURL	Medium
537	Complex Number Multiplication	Medium
540	Single Element in a Sorted Array	Medium
543	Diameter of Binary Tree	Easy
551	Student Attendance Record I	Easy
557	Reverse Words in a String III	Easy
561	Array Partition I	Easy
565	Array Nesting	Medium
566	Reshape the Matrix	Easy
572	Subtree of Another Tree	Easy
595	Big Countries	Easy
606	Construct String from Binary Tree	Easy
609	Find Duplicate File in System	Medium
617	Merge Two Binary Trees	Easy
620	Not Boring Movies	Easy
627	Swap Salary	Easy
637	Average of Levels in Binary Tree	Easy
654	Maximum Binary Tree	Medium
657	Judge Route Circle	Easy
669	Trim a Binary Search Tree	Easy
728	Self Dividing Numbers	Easy
763	Partition Labels	Medium
771	Jewels and Stones	Easy
791	Custom Sort String	Medium

Cracking the Coding Interview

#	Title
1	Arrays and Strings
2	Linked Lists
3	Stacks and Queues
4	Trees and Graphs
5	Bit Manipulation
7	Object Oriented Design
8	Recursion
9	Sorting and Searching
10	Mathematical
12	System Design and Memory Limits
13	C++
16	Low Level
19	Moderate
20	Hard