_{[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F1898-maximum-number-of-removable-characters.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F1898-maximum-number-of-removable-characters.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F0116-populating-next-right-pointers-in-each-node.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0116-populating-next-right-pointers-in-each-node.go)</div>} | _{<div align='center'>[✔️](java%2F0116-populating-next-right-pointers-in-each-node.java)</div>} | _{<div align='center'>[✔️](javascript%2F0116-populating-next-right-pointers-in-each-node.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0116-populating-next-right-pointers-in-each-node.kt)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F1268-search-suggestions-system.java)</div>} | _{<divalign='center'>[✔️](javascript%2F1268-search-suggestions-system.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F1268-search-suggestions-system.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F0410-split-array-largest-sum.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0410-split-array-largest-sum.kt)</div>} | _{<divalign='center'>[✔️](python%2F0410-split-array-largest-sum.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0410-split-array-largest-sum.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0410-split-array-largest-sum.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F0410-split-array-largest-sum.kt)</div>} | _{<divalign='center'>[✔️](python%2F0410-split-array-largest-sum.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)} | _{<div align='center'>[✔️](c%2F0004-median-of-two-sorted-arrays.c)</div>} | _{<div align='center'>[✔️](cpp%2F0004-median-of-two-sorted-arrays.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0004-median-of-two-sorted-arrays.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0004-median-of-two-sorted-arrays.go)</div>} | _{<div align='center'>[✔️](java%2F0004-median-of-two-sorted-arrays.java)</div>} | _{<div align='center'>[✔️](javascript%2F0004-median-of-two-sorted-arrays.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0004-median-of-two-sorted-arrays.kt)</div>} | _{<div align='center'>[✔️](python%2F0004-median-of-two-sorted-arrays.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F0004-median-of-two-sorted-arrays.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F0004-median-of-two-sorted-arrays.ts)</div>}

_Problem | _C | _C++ | _C# | _Dart | _GO | _Java | _JS | _Kotlin | _Python | _Ruby | _Rust | _Scala | _Swift | _TS

---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----

_{[0094 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)} | _{<div align='center'>[✔️](c%2F0094-binary-tree-inorder-traversal.c)</div>} | _{<div align='center'>[✔️](cpp%2F0094-binary-tree-inorder-traversal.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0094-binary-tree-inorder-traversal.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0094-binary-tree-inorder-traversal.go)</div>} | _{<div align='center'>[✔️](java%2F0094-binary-tree-inorder-traversal.java)</div>} | _{<div align='center'>[✔️](javascript%2F0094-binary-tree-inorder-traversal.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0094-binary-tree-inorder-traversal.kt)</div>} | _{<div align='center'>[✔️](python%2F0094-binary-tree-inorder-traversal.py)</div>} | _{<div align='center'>[✔️](ruby%2F0094-binary-tree-inorder-traversal.rb)</div>} | _{<div align='center'>[✔️](rust%2F0094-binary-tree-inorder-traversal.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0094-binary-tree-inorder-traversal.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0094-binary-tree-inorder-traversal.ts)</div>}

_{[0144 - Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0144-binary-tree-preorder-traversal.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0144-binary-tree-preorder-traversal.kt)</div>} | _{<divalign='center'>[✔️](python%2F0144-binary-tree-preorder-traversal.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0144-binary-tree-preorder-traversal.ts)</div>}

_{[0144 - Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0144-binary-tree-preorder-traversal.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0144-binary-tree-preorder-traversal.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0144-binary-tree-preorder-traversal.kt)</div>} | _{<divalign='center'>[✔️](python%2F0144-binary-tree-preorder-traversal.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0144-binary-tree-preorder-traversal.ts)</div>}

_{[0145 - Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0145-binary-tree-postorder-traversal.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0145-binary-tree-postorder-traversal.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0145-binary-tree-postorder-traversal.kt)</div>} | _{<divalign='center'>[✔️](python%2F0145-binary-tree-postorder-traversal.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](typescript%2F0145-binary-tree-postorder-traversal.ts)</div>}

_{[0226 - Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)} | _{<div align='center'>[✔️](c%2F0226-invert-binary-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0226-invert-binary-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0226-invert-binary-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0226-invert-binary-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0226-invert-binary-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0226-invert-binary-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0226-invert-binary-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0226-invert-binary-tree.py)</div>} | _{<div align='center'>[✔️](ruby%2F0226-invert-binary-tree.rb)</div>} | _{<div align='center'>[✔️](rust%2F0226-invert-binary-tree.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0226-invert-binary-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0226-invert-binary-tree.ts)</div>}

_{[0104 - Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)} | _{<div align='center'>[✔️](c%2F0104-maximum-depth-of-binary-tree.c)</div>} | _{<div align='center'>[✔️](cpp%2F0104-maximum-depth-of-binary-tree.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0104-maximum-depth-of-binary-tree.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0104-maximum-depth-of-binary-tree.go)</div>} | _{<div align='center'>[✔️](java%2F0104-maximum-depth-of-binary-tree.java)</div>} | _{<div align='center'>[✔️](javascript%2F0104-maximum-depth-of-binary-tree.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0104-maximum-depth-of-binary-tree.kt)</div>} | _{<div align='center'>[✔️](python%2F0104-maximum-depth-of-binary-tree.py)</div>} | _{<div align='center'>[✔️](ruby%2F0104-maximum-depth-of-binary-tree.rb)</div>} | _{<div align='center'>[✔️](rust%2F0104-maximum-depth-of-binary-tree.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0104-maximum-depth-of-binary-tree.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0104-maximum-depth-of-binary-tree.ts)</div>}